./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix038_rmo.opt.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/mix038_rmo.opt.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 4c2bddf0da31d44ec528f5975216c3b70f4cb204 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:13:48,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:13:48,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:13:48,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:13:48,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:13:48,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:13:48,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:13:48,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:13:48,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:13:48,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:13:48,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:13:48,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:13:48,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:13:48,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:13:48,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:13:48,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:13:48,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:13:48,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:13:48,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:13:48,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:13:48,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:13:48,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:13:48,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:13:48,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:13:48,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:13:48,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:13:48,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:13:48,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:13:48,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:13:48,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:13:48,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:13:48,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:13:48,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:13:48,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:13:48,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:13:48,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:13:48,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:13:48,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:13:48,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:13:48,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:13:48,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:13:48,120 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:13:48,143 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:13:48,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:13:48,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:13:48,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:13:48,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:13:48,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:13:48,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:13:48,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:13:48,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:13:48,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:13:48,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:13:48,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:13:48,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:13:48,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:13:48,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:13:48,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:13:48,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:13:48,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:13:48,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:13:48,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:13:48,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:13:48,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:13:48,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:13:48,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:13:48,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:13:48,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:13:48,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:13:48,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:13:48,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:13:48,156 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 -> 4c2bddf0da31d44ec528f5975216c3b70f4cb204 [2019-11-28 18:13:48,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:13:48,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:13:48,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:13:48,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:13:48,463 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:13:48,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038_rmo.opt.i [2019-11-28 18:13:48,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3540e2/67410a64d0244c06856bbc5336562cac/FLAG3180ce8ea [2019-11-28 18:13:49,050 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:13:49,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038_rmo.opt.i [2019-11-28 18:13:49,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3540e2/67410a64d0244c06856bbc5336562cac/FLAG3180ce8ea [2019-11-28 18:13:49,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3540e2/67410a64d0244c06856bbc5336562cac [2019-11-28 18:13:49,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:13:49,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:13:49,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:13:49,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:13:49,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:13:49,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:13:49" (1/1) ... [2019-11-28 18:13:49,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5169a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:49, skipping insertion in model container [2019-11-28 18:13:49,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:13:49" (1/1) ... [2019-11-28 18:13:49,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:13:49,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:13:49,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:13:49,932 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:13:50,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:13:50,102 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:13:50,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50 WrapperNode [2019-11-28 18:13:50,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:13:50,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:13:50,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:13:50,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:13:50,110 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:13:50" (1/1) ... [2019-11-28 18:13:50,135 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:13:50" (1/1) ... [2019-11-28 18:13:50,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:13:50,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:13:50,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:13:50,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:13:50,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (1/1) ... [2019-11-28 18:13:50,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:13:50,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:13:50,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:13:50,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:13:50,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (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:13:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:13:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:13:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:13:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:13:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:13:50,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:13:50,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:13:50,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:13:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:13:50,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:13:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:13:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:13:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:13:50,277 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:13:50,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:13:50,896 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:13:50,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:13:50 BoogieIcfgContainer [2019-11-28 18:13:50,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:13:50,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:13:50,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:13:50,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:13:50,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:13:49" (1/3) ... [2019-11-28 18:13:50,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56073412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:13:50, skipping insertion in model container [2019-11-28 18:13:50,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:50" (2/3) ... [2019-11-28 18:13:50,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56073412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:13:50, skipping insertion in model container [2019-11-28 18:13:50,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:13:50" (3/3) ... [2019-11-28 18:13:50,906 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt.i [2019-11-28 18:13:50,916 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:13:50,917 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:13:50,925 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:13:50,926 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:50,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,015 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,016 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:51,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:13:51,065 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:13:51,066 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:13:51,066 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:13:51,066 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:13:51,066 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:13:51,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:13:51,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:13:51,067 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:13:51,085 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-11-28 18:13:51,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-11-28 18:13:51,167 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-11-28 18:13:51,168 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:13:51,181 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:13:51,201 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-11-28 18:13:51,260 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-11-28 18:13:51,260 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:13:51,270 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:13:51,291 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:13:51,293 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:13:55,462 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 18:13:55,606 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 18:13:55,664 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-11-28 18:13:55,664 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:13:55,668 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-11-28 18:13:56,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-11-28 18:13:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-11-28 18:13:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:13:56,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:56,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:56,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-11-28 18:13:56,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:56,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796069864] [2019-11-28 18:13:56,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:56,993 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:13:56,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796069864] [2019-11-28 18:13:56,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:56,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:13:56,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846152424] [2019-11-28 18:13:57,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:57,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:57,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:57,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:57,016 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-11-28 18:13:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:57,376 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-11-28 18:13:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:57,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:13:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:57,547 INFO L225 Difference]: With dead ends: 13322 [2019-11-28 18:13:57,547 INFO L226 Difference]: Without dead ends: 12542 [2019-11-28 18:13:57,549 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:13:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-11-28 18:13:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-11-28 18:13:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-11-28 18:13:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-11-28 18:13:58,509 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-11-28 18:13:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:58,511 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-11-28 18:13:58,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-11-28 18:13:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:13:58,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:58,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:58,517 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:58,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:58,517 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-11-28 18:13:58,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:58,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165436556] [2019-11-28 18:13:58,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:58,661 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:13:58,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165436556] [2019-11-28 18:13:58,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:58,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:13:58,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510124381] [2019-11-28 18:13:58,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:13:58,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:13:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:13:58,665 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 4 states. [2019-11-28 18:13:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:59,154 INFO L93 Difference]: Finished difference Result 19054 states and 69906 transitions. [2019-11-28 18:13:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:13:59,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:13:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:59,235 INFO L225 Difference]: With dead ends: 19054 [2019-11-28 18:13:59,236 INFO L226 Difference]: Without dead ends: 19022 [2019-11-28 18:13:59,237 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:13:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2019-11-28 18:13:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 17202. [2019-11-28 18:13:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17202 states. [2019-11-28 18:13:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17202 states to 17202 states and 63964 transitions. [2019-11-28 18:13:59,937 INFO L78 Accepts]: Start accepts. Automaton has 17202 states and 63964 transitions. Word has length 13 [2019-11-28 18:13:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:59,938 INFO L462 AbstractCegarLoop]: Abstraction has 17202 states and 63964 transitions. [2019-11-28 18:13:59,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:13:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17202 states and 63964 transitions. [2019-11-28 18:13:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:13:59,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:59,945 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:13:59,945 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-11-28 18:13:59,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:59,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638119317] [2019-11-28 18:13:59,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:00,044 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:14:00,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638119317] [2019-11-28 18:14:00,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:00,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:00,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245728429] [2019-11-28 18:14:00,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:00,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:00,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:00,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:00,047 INFO L87 Difference]: Start difference. First operand 17202 states and 63964 transitions. Second operand 4 states. [2019-11-28 18:14:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:00,527 INFO L93 Difference]: Finished difference Result 21830 states and 80562 transitions. [2019-11-28 18:14:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:00,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:14:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:00,617 INFO L225 Difference]: With dead ends: 21830 [2019-11-28 18:14:00,617 INFO L226 Difference]: Without dead ends: 21804 [2019-11-28 18:14:00,618 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:14:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21804 states. [2019-11-28 18:14:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21804 to 18792. [2019-11-28 18:14:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-11-28 18:14:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 69925 transitions. [2019-11-28 18:14:01,241 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 69925 transitions. Word has length 16 [2019-11-28 18:14:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:01,241 INFO L462 AbstractCegarLoop]: Abstraction has 18792 states and 69925 transitions. [2019-11-28 18:14:01,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 69925 transitions. [2019-11-28 18:14:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:14:01,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:01,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:01,250 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1486252895, now seen corresponding path program 1 times [2019-11-28 18:14:01,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:01,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179186296] [2019-11-28 18:14:01,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:01,311 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:14:01,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179186296] [2019-11-28 18:14:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:01,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:01,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341224067] [2019-11-28 18:14:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:01,314 INFO L87 Difference]: Start difference. First operand 18792 states and 69925 transitions. Second operand 3 states. [2019-11-28 18:14:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:01,423 INFO L93 Difference]: Finished difference Result 17806 states and 65342 transitions. [2019-11-28 18:14:01,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:01,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:14:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:01,487 INFO L225 Difference]: With dead ends: 17806 [2019-11-28 18:14:01,487 INFO L226 Difference]: Without dead ends: 17806 [2019-11-28 18:14:01,488 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:14:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17806 states. [2019-11-28 18:14:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17806 to 17542. [2019-11-28 18:14:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17542 states. [2019-11-28 18:14:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17542 states to 17542 states and 64442 transitions. [2019-11-28 18:14:02,599 INFO L78 Accepts]: Start accepts. Automaton has 17542 states and 64442 transitions. Word has length 18 [2019-11-28 18:14:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:02,600 INFO L462 AbstractCegarLoop]: Abstraction has 17542 states and 64442 transitions. [2019-11-28 18:14:02,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 17542 states and 64442 transitions. [2019-11-28 18:14:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:14:02,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:02,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:02,609 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1446671698, now seen corresponding path program 1 times [2019-11-28 18:14:02,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:02,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192970156] [2019-11-28 18:14:02,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:02,691 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:14:02,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192970156] [2019-11-28 18:14:02,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:02,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:02,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979719752] [2019-11-28 18:14:02,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:02,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:02,694 INFO L87 Difference]: Start difference. First operand 17542 states and 64442 transitions. Second operand 3 states. [2019-11-28 18:14:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:02,743 INFO L93 Difference]: Finished difference Result 10124 states and 32418 transitions. [2019-11-28 18:14:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:02,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:14:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:02,767 INFO L225 Difference]: With dead ends: 10124 [2019-11-28 18:14:02,768 INFO L226 Difference]: Without dead ends: 10124 [2019-11-28 18:14:02,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2019-11-28 18:14:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10124. [2019-11-28 18:14:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10124 states. [2019-11-28 18:14:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 32418 transitions. [2019-11-28 18:14:03,017 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 32418 transitions. Word has length 18 [2019-11-28 18:14:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:03,018 INFO L462 AbstractCegarLoop]: Abstraction has 10124 states and 32418 transitions. [2019-11-28 18:14:03,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 32418 transitions. [2019-11-28 18:14:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:14:03,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:03,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:03,023 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2061945651, now seen corresponding path program 1 times [2019-11-28 18:14:03,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:03,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648584336] [2019-11-28 18:14:03,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:03,104 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:14:03,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648584336] [2019-11-28 18:14:03,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:03,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:03,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586181853] [2019-11-28 18:14:03,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:03,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:03,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:03,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:03,113 INFO L87 Difference]: Start difference. First operand 10124 states and 32418 transitions. Second operand 4 states. [2019-11-28 18:14:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:03,188 INFO L93 Difference]: Finished difference Result 15437 states and 49588 transitions. [2019-11-28 18:14:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:03,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 18:14:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:03,217 INFO L225 Difference]: With dead ends: 15437 [2019-11-28 18:14:03,218 INFO L226 Difference]: Without dead ends: 14837 [2019-11-28 18:14:03,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14837 states. [2019-11-28 18:14:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14837 to 14778. [2019-11-28 18:14:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14778 states. [2019-11-28 18:14:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14778 states to 14778 states and 47403 transitions. [2019-11-28 18:14:03,583 INFO L78 Accepts]: Start accepts. Automaton has 14778 states and 47403 transitions. Word has length 19 [2019-11-28 18:14:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:03,584 INFO L462 AbstractCegarLoop]: Abstraction has 14778 states and 47403 transitions. [2019-11-28 18:14:03,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14778 states and 47403 transitions. [2019-11-28 18:14:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:03,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:03,594 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] [2019-11-28 18:14:03,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 65526288, now seen corresponding path program 1 times [2019-11-28 18:14:03,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:03,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736395456] [2019-11-28 18:14:03,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:03,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736395456] [2019-11-28 18:14:03,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:03,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:03,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323303510] [2019-11-28 18:14:03,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:03,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:03,751 INFO L87 Difference]: Start difference. First operand 14778 states and 47403 transitions. Second operand 6 states. [2019-11-28 18:14:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:04,535 INFO L93 Difference]: Finished difference Result 29394 states and 95720 transitions. [2019-11-28 18:14:04,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:14:04,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 18:14:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:04,582 INFO L225 Difference]: With dead ends: 29394 [2019-11-28 18:14:04,582 INFO L226 Difference]: Without dead ends: 28446 [2019-11-28 18:14:04,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:14:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28446 states. [2019-11-28 18:14:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28446 to 15002. [2019-11-28 18:14:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15002 states. [2019-11-28 18:14:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15002 states to 15002 states and 48116 transitions. [2019-11-28 18:14:05,403 INFO L78 Accepts]: Start accepts. Automaton has 15002 states and 48116 transitions. Word has length 21 [2019-11-28 18:14:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:05,404 INFO L462 AbstractCegarLoop]: Abstraction has 15002 states and 48116 transitions. [2019-11-28 18:14:05,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 15002 states and 48116 transitions. [2019-11-28 18:14:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:05,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:05,414 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] [2019-11-28 18:14:05,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2119612684, now seen corresponding path program 2 times [2019-11-28 18:14:05,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:05,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152120725] [2019-11-28 18:14:05,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:05,555 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:14:05,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152120725] [2019-11-28 18:14:05,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:05,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:14:05,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120572292] [2019-11-28 18:14:05,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:14:05,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:14:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:14:05,558 INFO L87 Difference]: Start difference. First operand 15002 states and 48116 transitions. Second operand 8 states. [2019-11-28 18:14:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:06,108 INFO L93 Difference]: Finished difference Result 25900 states and 83511 transitions. [2019-11-28 18:14:06,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:14:06,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 18:14:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:06,148 INFO L225 Difference]: With dead ends: 25900 [2019-11-28 18:14:06,148 INFO L226 Difference]: Without dead ends: 25024 [2019-11-28 18:14:06,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:14:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-11-28 18:14:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 15310. [2019-11-28 18:14:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15310 states. [2019-11-28 18:14:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15310 states to 15310 states and 48631 transitions. [2019-11-28 18:14:06,516 INFO L78 Accepts]: Start accepts. Automaton has 15310 states and 48631 transitions. Word has length 21 [2019-11-28 18:14:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:06,516 INFO L462 AbstractCegarLoop]: Abstraction has 15310 states and 48631 transitions. [2019-11-28 18:14:06,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:14:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 15310 states and 48631 transitions. [2019-11-28 18:14:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:06,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:06,522 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] [2019-11-28 18:14:06,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1525170218, now seen corresponding path program 3 times [2019-11-28 18:14:06,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:06,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024139702] [2019-11-28 18:14:06,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:06,561 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:14:06,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024139702] [2019-11-28 18:14:06,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:06,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:06,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50568520] [2019-11-28 18:14:06,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:06,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:06,563 INFO L87 Difference]: Start difference. First operand 15310 states and 48631 transitions. Second operand 4 states. [2019-11-28 18:14:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:06,588 INFO L93 Difference]: Finished difference Result 2483 states and 6350 transitions. [2019-11-28 18:14:06,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:06,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-28 18:14:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:06,592 INFO L225 Difference]: With dead ends: 2483 [2019-11-28 18:14:06,592 INFO L226 Difference]: Without dead ends: 2483 [2019-11-28 18:14:06,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-11-28 18:14:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2019-11-28 18:14:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2019-11-28 18:14:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 6350 transitions. [2019-11-28 18:14:06,626 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 6350 transitions. Word has length 21 [2019-11-28 18:14:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:06,626 INFO L462 AbstractCegarLoop]: Abstraction has 2483 states and 6350 transitions. [2019-11-28 18:14:06,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 6350 transitions. [2019-11-28 18:14:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:14:06,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:06,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:06,631 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-11-28 18:14:06,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:06,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848969177] [2019-11-28 18:14:06,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:06,708 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:14:06,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848969177] [2019-11-28 18:14:06,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:06,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:06,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420938685] [2019-11-28 18:14:06,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:06,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:06,710 INFO L87 Difference]: Start difference. First operand 2483 states and 6350 transitions. Second operand 6 states. [2019-11-28 18:14:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:07,114 INFO L93 Difference]: Finished difference Result 6488 states and 16462 transitions. [2019-11-28 18:14:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:07,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 18:14:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:07,123 INFO L225 Difference]: With dead ends: 6488 [2019-11-28 18:14:07,123 INFO L226 Difference]: Without dead ends: 6484 [2019-11-28 18:14:07,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-11-28 18:14:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 3395. [2019-11-28 18:14:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2019-11-28 18:14:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 8834 transitions. [2019-11-28 18:14:07,181 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 8834 transitions. Word has length 29 [2019-11-28 18:14:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:07,181 INFO L462 AbstractCegarLoop]: Abstraction has 3395 states and 8834 transitions. [2019-11-28 18:14:07,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 8834 transitions. [2019-11-28 18:14:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:14:07,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:07,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:07,187 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1490700114, now seen corresponding path program 1 times [2019-11-28 18:14:07,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:07,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654097602] [2019-11-28 18:14:07,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:07,272 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:14:07,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654097602] [2019-11-28 18:14:07,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:07,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:07,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708110553] [2019-11-28 18:14:07,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:07,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:07,274 INFO L87 Difference]: Start difference. First operand 3395 states and 8834 transitions. Second operand 6 states. [2019-11-28 18:14:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:07,647 INFO L93 Difference]: Finished difference Result 6292 states and 15829 transitions. [2019-11-28 18:14:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:07,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 18:14:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:07,658 INFO L225 Difference]: With dead ends: 6292 [2019-11-28 18:14:07,659 INFO L226 Difference]: Without dead ends: 6290 [2019-11-28 18:14:07,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6290 states. [2019-11-28 18:14:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6290 to 3108. [2019-11-28 18:14:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2019-11-28 18:14:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 8077 transitions. [2019-11-28 18:14:07,746 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 8077 transitions. Word has length 30 [2019-11-28 18:14:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:07,746 INFO L462 AbstractCegarLoop]: Abstraction has 3108 states and 8077 transitions. [2019-11-28 18:14:07,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 8077 transitions. [2019-11-28 18:14:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:14:07,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:07,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:07,753 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash -485136262, now seen corresponding path program 1 times [2019-11-28 18:14:07,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:07,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306385057] [2019-11-28 18:14:07,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:07,850 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:14:07,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306385057] [2019-11-28 18:14:07,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:07,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:07,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659851384] [2019-11-28 18:14:07,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:07,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:07,854 INFO L87 Difference]: Start difference. First operand 3108 states and 8077 transitions. Second operand 5 states. [2019-11-28 18:14:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:07,884 INFO L93 Difference]: Finished difference Result 1874 states and 5059 transitions. [2019-11-28 18:14:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:07,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 18:14:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:07,888 INFO L225 Difference]: With dead ends: 1874 [2019-11-28 18:14:07,889 INFO L226 Difference]: Without dead ends: 1782 [2019-11-28 18:14:07,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-11-28 18:14:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1102. [2019-11-28 18:14:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-11-28 18:14:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 3048 transitions. [2019-11-28 18:14:07,907 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 3048 transitions. Word has length 31 [2019-11-28 18:14:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:07,907 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 3048 transitions. [2019-11-28 18:14:07,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 3048 transitions. [2019-11-28 18:14:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:14:07,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:07,911 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] [2019-11-28 18:14:07,911 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash 748255129, now seen corresponding path program 1 times [2019-11-28 18:14:07,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:07,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885162832] [2019-11-28 18:14:07,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:08,020 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:14:08,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885162832] [2019-11-28 18:14:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:08,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:08,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368715336] [2019-11-28 18:14:08,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:08,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:08,024 INFO L87 Difference]: Start difference. First operand 1102 states and 3048 transitions. Second operand 4 states. [2019-11-28 18:14:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:08,050 INFO L93 Difference]: Finished difference Result 1670 states and 4367 transitions. [2019-11-28 18:14:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:08,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:14:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:08,052 INFO L225 Difference]: With dead ends: 1670 [2019-11-28 18:14:08,052 INFO L226 Difference]: Without dead ends: 608 [2019-11-28 18:14:08,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-28 18:14:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-11-28 18:14:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-11-28 18:14:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1394 transitions. [2019-11-28 18:14:08,064 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1394 transitions. Word has length 45 [2019-11-28 18:14:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:08,065 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1394 transitions. [2019-11-28 18:14:08,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1394 transitions. [2019-11-28 18:14:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:14:08,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:08,067 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] [2019-11-28 18:14:08,067 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1102645559, now seen corresponding path program 2 times [2019-11-28 18:14:08,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:08,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427376750] [2019-11-28 18:14:08,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:08,226 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:14:08,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427376750] [2019-11-28 18:14:08,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:08,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:08,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545513384] [2019-11-28 18:14:08,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:08,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:08,228 INFO L87 Difference]: Start difference. First operand 608 states and 1394 transitions. Second operand 6 states. [2019-11-28 18:14:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:08,457 INFO L93 Difference]: Finished difference Result 1678 states and 3755 transitions. [2019-11-28 18:14:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:14:08,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-28 18:14:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:08,460 INFO L225 Difference]: With dead ends: 1678 [2019-11-28 18:14:08,460 INFO L226 Difference]: Without dead ends: 1156 [2019-11-28 18:14:08,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:14:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-11-28 18:14:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 680. [2019-11-28 18:14:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-28 18:14:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1567 transitions. [2019-11-28 18:14:08,475 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1567 transitions. Word has length 45 [2019-11-28 18:14:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:08,475 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1567 transitions. [2019-11-28 18:14:08,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1567 transitions. [2019-11-28 18:14:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:14:08,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:08,477 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] [2019-11-28 18:14:08,478 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 3 times [2019-11-28 18:14:08,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:08,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786603761] [2019-11-28 18:14:08,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:08,619 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:14:08,620 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:14:08,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_32|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32| 1)) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32|)) (= v_~y$r_buff0_thd1~0_39 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1016~0.base_32| 4)) (= |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32|) |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_133) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ULTIMATE.start_main_~#t1018~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1017~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1016~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1016~0.offset, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1017~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:14:08,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t1017~0.offset_9| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11| 1) |v_#valid_32|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11|) |v_ULTIMATE.start_main_~#t1017~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t1017~0.base_11| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1017~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1017~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_11|, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1017~0.base, ULTIMATE.start_main_~#t1017~0.offset] because there is no mapped edge [2019-11-28 18:14:08,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1018~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1018~0.base_10|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1018~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10|) |v_ULTIMATE.start_main_~#t1018~0.offset_8| 2)) |v_#memory_int_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1018~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_8|, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1018~0.offset, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= 1 ~y$r_buff0_thd3~0_Out-1427951806) (= ~y$r_buff0_thd1~0_In-1427951806 ~y$r_buff1_thd1~0_Out-1427951806) (= ~__unbuffered_p2_EBX~0_Out-1427951806 ~a~0_In-1427951806) (= ~z~0_Out-1427951806 ~__unbuffered_p2_EAX~0_Out-1427951806) (= ~y$r_buff1_thd0~0_Out-1427951806 ~y$r_buff0_thd0~0_In-1427951806) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1427951806)) (= ~y$r_buff1_thd3~0_Out-1427951806 ~y$r_buff0_thd3~0_In-1427951806) (= ~z~0_Out-1427951806 1) (= ~y$r_buff1_thd2~0_Out-1427951806 ~y$r_buff0_thd2~0_In-1427951806)) InVars {~a~0=~a~0_In-1427951806, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1427951806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1427951806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1427951806, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1427951806, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1427951806} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1427951806, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1427951806, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1427951806, ~a~0=~a~0_In-1427951806, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1427951806, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1427951806, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1427951806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1427951806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1427951806, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1427951806, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1427951806, ~z~0=~z~0_Out-1427951806, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1427951806} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:14:08,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:14:08,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In10079499 256)))) (or (and (= ~y$w_buff0~0_In10079499 |P1Thread1of1ForFork1_#t~ite9_Out10079499|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In10079499| |P1Thread1of1ForFork1_#t~ite8_Out10079499|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out10079499| |P1Thread1of1ForFork1_#t~ite8_Out10079499|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In10079499 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In10079499 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In10079499 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In10079499 256)))) .cse0 (= ~y$w_buff0~0_In10079499 |P1Thread1of1ForFork1_#t~ite8_Out10079499|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In10079499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10079499, ~y$w_buff0~0=~y$w_buff0~0_In10079499, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In10079499, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In10079499|, ~weak$$choice2~0=~weak$$choice2~0_In10079499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10079499} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In10079499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10079499, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out10079499|, ~y$w_buff0~0=~y$w_buff0~0_In10079499, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In10079499, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out10079499|, ~weak$$choice2~0=~weak$$choice2~0_In10079499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10079499} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:14:08,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1282368490 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1282368490 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1282368490 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1282368490 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1282368490 256)))) (= |P1Thread1of1ForFork1_#t~ite11_Out1282368490| ~y$w_buff1~0_In1282368490) (= |P1Thread1of1ForFork1_#t~ite11_Out1282368490| |P1Thread1of1ForFork1_#t~ite12_Out1282368490|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In1282368490| |P1Thread1of1ForFork1_#t~ite11_Out1282368490|) (= |P1Thread1of1ForFork1_#t~ite12_Out1282368490| ~y$w_buff1~0_In1282368490)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1282368490, ~y$w_buff1~0=~y$w_buff1~0_In1282368490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282368490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282368490, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1282368490|, ~weak$$choice2~0=~weak$$choice2~0_In1282368490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282368490} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1282368490, ~y$w_buff1~0=~y$w_buff1~0_In1282368490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282368490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282368490, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1282368490|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1282368490|, ~weak$$choice2~0=~weak$$choice2~0_In1282368490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282368490} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:14:08,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1378772431 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1378772431| |P1Thread1of1ForFork1_#t~ite14_Out1378772431|) (= |P1Thread1of1ForFork1_#t~ite15_Out1378772431| ~y$w_buff0_used~0_In1378772431)) (and (= ~y$w_buff0_used~0_In1378772431 |P1Thread1of1ForFork1_#t~ite14_Out1378772431|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1378772431 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1378772431 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1378772431 256)) (and (= (mod ~y$w_buff1_used~0_In1378772431 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out1378772431| |P1Thread1of1ForFork1_#t~ite14_Out1378772431|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1378772431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1378772431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1378772431, ~weak$$choice2~0=~weak$$choice2~0_In1378772431, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1378772431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1378772431} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1378772431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1378772431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1378772431, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1378772431|, ~weak$$choice2~0=~weak$$choice2~0_In1378772431, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1378772431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1378772431} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:14:08,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:14:08,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:14:08,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1302662648 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1302662648 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1302662648|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1302662648 |P2Thread1of1ForFork2_#t~ite28_Out-1302662648|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1302662648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1302662648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1302662648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1302662648, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1302662648|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:14:08,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In387429804 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In387429804 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In387429804 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In387429804 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out387429804| ~y$w_buff1_used~0_In387429804) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out387429804| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In387429804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In387429804, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In387429804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In387429804} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In387429804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In387429804, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In387429804, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out387429804|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In387429804} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:14:08,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2077597331 256))) (.cse2 (= ~y$r_buff0_thd3~0_In2077597331 ~y$r_buff0_thd3~0_Out2077597331)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2077597331 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out2077597331) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2077597331, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2077597331} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2077597331, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out2077597331|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2077597331} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:14:08,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In941548413 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In941548413 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In941548413 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In941548413 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out941548413| ~y$r_buff1_thd3~0_In941548413) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite31_Out941548413| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In941548413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In941548413, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In941548413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In941548413} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In941548413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In941548413, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out941548413|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In941548413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In941548413} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:08,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:14:08,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:14:08,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1916164452 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1916164452 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1916164452 |ULTIMATE.start_main_#t~ite35_Out1916164452|)) (and (= ~y~0_In1916164452 |ULTIMATE.start_main_#t~ite35_Out1916164452|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1916164452, ~y~0=~y~0_In1916164452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1916164452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1916164452} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1916164452, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1916164452|, ~y~0=~y~0_In1916164452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1916164452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1916164452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:14:08,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:14:08,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In424466076 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In424466076 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out424466076| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In424466076 |ULTIMATE.start_main_#t~ite37_Out424466076|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In424466076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424466076} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In424466076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424466076, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out424466076|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:14:08,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1117416204 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1117416204 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1117416204 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1117416204 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1117416204|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1117416204| ~y$w_buff1_used~0_In-1117416204) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117416204, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117416204, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117416204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117416204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117416204, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117416204, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1117416204|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117416204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117416204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:08,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1166939922 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1166939922 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1166939922| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1166939922| ~y$r_buff0_thd0~0_In-1166939922)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1166939922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1166939922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1166939922, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1166939922|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1166939922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:08,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1181693188 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1181693188 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1181693188 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1181693188 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1181693188| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out1181693188| ~y$r_buff1_thd0~0_In1181693188)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1181693188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1181693188, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1181693188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181693188} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1181693188|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1181693188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1181693188, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1181693188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181693188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:08,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:08,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:14:08 BasicIcfg [2019-11-28 18:14:08,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:14:08,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:14:08,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:14:08,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:14:08,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:13:50" (3/4) ... [2019-11-28 18:14:08,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:14:08,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_32|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32| 1)) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32|)) (= v_~y$r_buff0_thd1~0_39 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1016~0.base_32| 4)) (= |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32|) |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_133) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ULTIMATE.start_main_~#t1018~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1017~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1016~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1016~0.offset, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1017~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:14:08,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t1017~0.offset_9| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11| 1) |v_#valid_32|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11|) |v_ULTIMATE.start_main_~#t1017~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t1017~0.base_11| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1017~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1017~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_11|, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1017~0.base, ULTIMATE.start_main_~#t1017~0.offset] because there is no mapped edge [2019-11-28 18:14:08,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1018~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1018~0.base_10|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1018~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10|) |v_ULTIMATE.start_main_~#t1018~0.offset_8| 2)) |v_#memory_int_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1018~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_8|, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1018~0.offset, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:08,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= 1 ~y$r_buff0_thd3~0_Out-1427951806) (= ~y$r_buff0_thd1~0_In-1427951806 ~y$r_buff1_thd1~0_Out-1427951806) (= ~__unbuffered_p2_EBX~0_Out-1427951806 ~a~0_In-1427951806) (= ~z~0_Out-1427951806 ~__unbuffered_p2_EAX~0_Out-1427951806) (= ~y$r_buff1_thd0~0_Out-1427951806 ~y$r_buff0_thd0~0_In-1427951806) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1427951806)) (= ~y$r_buff1_thd3~0_Out-1427951806 ~y$r_buff0_thd3~0_In-1427951806) (= ~z~0_Out-1427951806 1) (= ~y$r_buff1_thd2~0_Out-1427951806 ~y$r_buff0_thd2~0_In-1427951806)) InVars {~a~0=~a~0_In-1427951806, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1427951806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1427951806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1427951806, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1427951806, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1427951806} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1427951806, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1427951806, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1427951806, ~a~0=~a~0_In-1427951806, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1427951806, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1427951806, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1427951806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1427951806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1427951806, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1427951806, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1427951806, ~z~0=~z~0_Out-1427951806, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1427951806} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:14:08,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:14:08,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In10079499 256)))) (or (and (= ~y$w_buff0~0_In10079499 |P1Thread1of1ForFork1_#t~ite9_Out10079499|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In10079499| |P1Thread1of1ForFork1_#t~ite8_Out10079499|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out10079499| |P1Thread1of1ForFork1_#t~ite8_Out10079499|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In10079499 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In10079499 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In10079499 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In10079499 256)))) .cse0 (= ~y$w_buff0~0_In10079499 |P1Thread1of1ForFork1_#t~ite8_Out10079499|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In10079499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10079499, ~y$w_buff0~0=~y$w_buff0~0_In10079499, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In10079499, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In10079499|, ~weak$$choice2~0=~weak$$choice2~0_In10079499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10079499} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In10079499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10079499, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out10079499|, ~y$w_buff0~0=~y$w_buff0~0_In10079499, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In10079499, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out10079499|, ~weak$$choice2~0=~weak$$choice2~0_In10079499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In10079499} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:14:08,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1282368490 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1282368490 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1282368490 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1282368490 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1282368490 256)))) (= |P1Thread1of1ForFork1_#t~ite11_Out1282368490| ~y$w_buff1~0_In1282368490) (= |P1Thread1of1ForFork1_#t~ite11_Out1282368490| |P1Thread1of1ForFork1_#t~ite12_Out1282368490|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In1282368490| |P1Thread1of1ForFork1_#t~ite11_Out1282368490|) (= |P1Thread1of1ForFork1_#t~ite12_Out1282368490| ~y$w_buff1~0_In1282368490)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1282368490, ~y$w_buff1~0=~y$w_buff1~0_In1282368490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282368490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282368490, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1282368490|, ~weak$$choice2~0=~weak$$choice2~0_In1282368490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282368490} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1282368490, ~y$w_buff1~0=~y$w_buff1~0_In1282368490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282368490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1282368490, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1282368490|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1282368490|, ~weak$$choice2~0=~weak$$choice2~0_In1282368490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282368490} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:14:08,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1378772431 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1378772431| |P1Thread1of1ForFork1_#t~ite14_Out1378772431|) (= |P1Thread1of1ForFork1_#t~ite15_Out1378772431| ~y$w_buff0_used~0_In1378772431)) (and (= ~y$w_buff0_used~0_In1378772431 |P1Thread1of1ForFork1_#t~ite14_Out1378772431|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1378772431 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1378772431 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1378772431 256)) (and (= (mod ~y$w_buff1_used~0_In1378772431 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out1378772431| |P1Thread1of1ForFork1_#t~ite14_Out1378772431|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1378772431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1378772431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1378772431, ~weak$$choice2~0=~weak$$choice2~0_In1378772431, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1378772431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1378772431} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1378772431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1378772431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1378772431, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1378772431|, ~weak$$choice2~0=~weak$$choice2~0_In1378772431, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1378772431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1378772431} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:14:08,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:14:08,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:14:08,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1302662648 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1302662648 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1302662648|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1302662648 |P2Thread1of1ForFork2_#t~ite28_Out-1302662648|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1302662648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1302662648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1302662648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1302662648, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1302662648|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:14:08,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In387429804 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In387429804 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In387429804 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In387429804 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out387429804| ~y$w_buff1_used~0_In387429804) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out387429804| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In387429804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In387429804, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In387429804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In387429804} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In387429804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In387429804, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In387429804, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out387429804|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In387429804} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:14:08,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2077597331 256))) (.cse2 (= ~y$r_buff0_thd3~0_In2077597331 ~y$r_buff0_thd3~0_Out2077597331)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In2077597331 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out2077597331) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2077597331, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2077597331} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2077597331, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out2077597331|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2077597331} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:14:08,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In941548413 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In941548413 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In941548413 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In941548413 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out941548413| ~y$r_buff1_thd3~0_In941548413) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite31_Out941548413| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In941548413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In941548413, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In941548413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In941548413} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In941548413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In941548413, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out941548413|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In941548413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In941548413} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:08,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:14:08,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:14:08,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1916164452 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1916164452 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1916164452 |ULTIMATE.start_main_#t~ite35_Out1916164452|)) (and (= ~y~0_In1916164452 |ULTIMATE.start_main_#t~ite35_Out1916164452|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1916164452, ~y~0=~y~0_In1916164452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1916164452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1916164452} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1916164452, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1916164452|, ~y~0=~y~0_In1916164452, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1916164452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1916164452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:14:08,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:14:08,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In424466076 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In424466076 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out424466076| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In424466076 |ULTIMATE.start_main_#t~ite37_Out424466076|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In424466076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424466076} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In424466076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424466076, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out424466076|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:14:08,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1117416204 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1117416204 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1117416204 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1117416204 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1117416204|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1117416204| ~y$w_buff1_used~0_In-1117416204) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117416204, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117416204, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117416204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117416204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117416204, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117416204, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1117416204|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117416204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117416204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:08,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1166939922 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1166939922 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1166939922| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1166939922| ~y$r_buff0_thd0~0_In-1166939922)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1166939922, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1166939922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1166939922, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1166939922|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1166939922} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:08,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1181693188 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1181693188 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1181693188 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1181693188 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1181693188| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out1181693188| ~y$r_buff1_thd0~0_In1181693188)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1181693188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1181693188, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1181693188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181693188} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1181693188|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1181693188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1181693188, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1181693188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181693188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:08,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:08,945 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:14:08,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:14:08,947 INFO L168 Benchmark]: Toolchain (without parser) took 19587.83 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 951.0 MB in the beginning and 637.9 MB in the end (delta: 313.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-28 18:14:08,948 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:08,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:08,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:08,951 INFO L168 Benchmark]: Boogie Preprocessor took 50.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:08,952 INFO L168 Benchmark]: RCFGBuilder took 681.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:08,954 INFO L168 Benchmark]: TraceAbstraction took 17890.34 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 876.1 MB). Free memory was 1.1 GB in the beginning and 637.9 MB in the end (delta: 430.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-28 18:14:08,954 INFO L168 Benchmark]: Witness Printer took 155.98 ms. Allocated memory is still 2.1 GB. Free memory is still 637.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:08,956 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.73 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 742.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 681.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17890.34 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 876.1 MB). Free memory was 1.1 GB in the beginning and 637.9 MB in the end (delta: 430.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 155.98 ms. Allocated memory is still 2.1 GB. Free memory is still 637.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1016, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L822] FCALL, FORK 0 pthread_create(&t1017, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L824] FCALL, FORK 0 pthread_create(&t1018, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 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) [L756] 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)) [L757] 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)) [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 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 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1764 SDtfs, 2596 SDslu, 2922 SDs, 0 SdLazy, 1621 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18792occurred 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: 5.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 35740 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 52754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...