/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:17:55,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:17:55,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:17:55,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:17:55,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:17:55,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:17:55,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:17:55,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:17:55,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:17:55,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:17:55,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:17:55,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:17:55,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:17:55,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:17:55,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:17:55,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:17:55,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:17:55,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:17:55,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:17:55,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:17:55,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:17:55,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:17:55,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:17:55,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:17:55,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:17:55,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:17:55,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:17:55,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:17:55,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:17:55,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:17:55,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:17:55,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:17:55,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:17:55,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:17:55,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:17:55,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:17:55,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:17:55,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:17:55,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:17:55,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:17:55,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:17:55,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:17:55,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:17:55,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:17:55,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:17:55,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:17:55,271 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:17:55,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:17:55,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:17:55,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:17:55,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:17:55,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:17:55,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:17:55,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:17:55,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:17:55,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:17:55,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:17:55,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:17:55,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:17:55,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:17:55,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:17:55,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:17:55,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:17:55,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:17:55,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:17:55,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:17:55,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:17:55,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:17:55,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:17:55,275 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:17:55,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:17:55,275 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:17:55,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:17:55,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:17:55,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:17:55,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:17:55,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:17:55,589 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:17:55,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-27 16:17:55,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5fce605/8661e2f0b4784581be1d1b47a229094b/FLAGd3584cd1e [2019-12-27 16:17:56,269 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:17:56,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-27 16:17:56,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5fce605/8661e2f0b4784581be1d1b47a229094b/FLAGd3584cd1e [2019-12-27 16:17:56,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5fce605/8661e2f0b4784581be1d1b47a229094b [2019-12-27 16:17:56,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:17:56,513 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:17:56,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:17:56,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:17:56,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:17:56,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:17:56" (1/1) ... [2019-12-27 16:17:56,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a48cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:56, skipping insertion in model container [2019-12-27 16:17:56,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:17:56" (1/1) ... [2019-12-27 16:17:56,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:17:56,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:17:57,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:17:57,156 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:17:57,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:17:57,283 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:17:57,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57 WrapperNode [2019-12-27 16:17:57,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:17:57,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:17:57,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:17:57,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:17:57,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:17:57,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:17:57,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:17:57,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:17:57,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (1/1) ... [2019-12-27 16:17:57,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:17:57,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:17:57,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:17:57,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:17:57,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (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-12-27 16:17:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:17:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:17:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:17:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:17:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:17:57,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:17:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:17:57,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:17:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:17:57,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:17:57,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:17:57,460 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:17:58,226 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:17:58,226 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:17:58,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:17:58 BoogieIcfgContainer [2019-12-27 16:17:58,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:17:58,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:17:58,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:17:58,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:17:58,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:17:56" (1/3) ... [2019-12-27 16:17:58,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0cb43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:17:58, skipping insertion in model container [2019-12-27 16:17:58,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:57" (2/3) ... [2019-12-27 16:17:58,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0cb43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:17:58, skipping insertion in model container [2019-12-27 16:17:58,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:17:58" (3/3) ... [2019-12-27 16:17:58,235 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.opt.i [2019-12-27 16:17:58,245 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:17:58,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:17:58,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:17:58,261 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:17:58,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,311 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:17:58,399 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:17:58,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:17:58,418 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:17:58,418 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:17:58,419 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:17:58,419 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:17:58,419 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:17:58,419 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:17:58,419 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:17:58,435 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 16:17:58,437 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 16:17:58,541 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 16:17:58,541 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:17:58,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:17:58,576 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 16:17:58,620 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 16:17:58,620 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:17:58,626 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:17:58,639 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:17:58,641 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:18:03,673 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 16:18:03,791 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 16:18:03,840 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-27 16:18:03,840 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 16:18:03,844 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-27 16:18:04,318 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 16:18:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 16:18:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:18:04,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:04,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:18:04,328 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-27 16:18:04,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:04,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165098863] [2019-12-27 16:18:04,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:04,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165098863] [2019-12-27 16:18:04,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:04,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:18:04,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933624158] [2019-12-27 16:18:04,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:04,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:04,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:18:04,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:04,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:04,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:04,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:04,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:04,573 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 16:18:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:04,813 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-27 16:18:04,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:04,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:18:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:04,902 INFO L225 Difference]: With dead ends: 8468 [2019-12-27 16:18:04,903 INFO L226 Difference]: Without dead ends: 7976 [2019-12-27 16:18:04,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-27 16:18:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-27 16:18:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-27 16:18:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-27 16:18:05,405 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-27 16:18:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:05,406 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-27 16:18:05,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-27 16:18:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:18:05,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:05,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:05,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-27 16:18:05,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:05,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430506644] [2019-12-27 16:18:05,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:05,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430506644] [2019-12-27 16:18:05,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:05,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:05,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050548262] [2019-12-27 16:18:05,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:05,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:05,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:18:05,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:05,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:05,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:05,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:05,598 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-27 16:18:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:05,932 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-27 16:18:05,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:05,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:18:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:06,005 INFO L225 Difference]: With dead ends: 12178 [2019-12-27 16:18:06,005 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 16:18:06,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:18:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 16:18:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-27 16:18:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-27 16:18:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-27 16:18:06,953 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-27 16:18:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:06,954 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-27 16:18:06,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:18:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-27 16:18:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:18:06,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:06,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:06,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-27 16:18:06,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:06,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054322275] [2019-12-27 16:18:06,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:07,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054322275] [2019-12-27 16:18:07,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81128868] [2019-12-27 16:18:07,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:07,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:07,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:18:07,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:07,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:07,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:07,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:07,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:07,050 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-27 16:18:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:07,304 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-27 16:18:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:07,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:18:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:07,348 INFO L225 Difference]: With dead ends: 13366 [2019-12-27 16:18:07,348 INFO L226 Difference]: Without dead ends: 13366 [2019-12-27 16:18:07,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:18:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-27 16:18:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-27 16:18:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-27 16:18:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-27 16:18:07,927 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-27 16:18:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:07,928 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-27 16:18:07,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:18:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-27 16:18:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:18:07,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:07,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:07,932 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-27 16:18:07,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:07,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052248122] [2019-12-27 16:18:07,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:08,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052248122] [2019-12-27 16:18:08,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:08,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:18:08,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385549556] [2019-12-27 16:18:08,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:08,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:08,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 16:18:08,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:08,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:08,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:08,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:08,017 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-27 16:18:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:08,078 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-27 16:18:08,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:08,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:18:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:08,109 INFO L225 Difference]: With dead ends: 11853 [2019-12-27 16:18:08,110 INFO L226 Difference]: Without dead ends: 11853 [2019-12-27 16:18:08,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-27 16:18:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-27 16:18:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-27 16:18:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-27 16:18:08,451 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-27 16:18:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:08,451 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-27 16:18:08,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-27 16:18:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:18:08,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:08,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:08,456 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-27 16:18:08,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:08,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733282510] [2019-12-27 16:18:08,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:08,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733282510] [2019-12-27 16:18:08,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:08,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:08,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634757957] [2019-12-27 16:18:08,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:08,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:08,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 16:18:08,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:08,568 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:08,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:08,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:08,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:08,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:08,569 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 3 states. [2019-12-27 16:18:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:08,768 INFO L93 Difference]: Finished difference Result 11207 states and 34674 transitions. [2019-12-27 16:18:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:08,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 16:18:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:08,796 INFO L225 Difference]: With dead ends: 11207 [2019-12-27 16:18:08,796 INFO L226 Difference]: Without dead ends: 11207 [2019-12-27 16:18:08,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11207 states. [2019-12-27 16:18:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11207 to 11127. [2019-12-27 16:18:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11127 states. [2019-12-27 16:18:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11127 states to 11127 states and 34442 transitions. [2019-12-27 16:18:09,087 INFO L78 Accepts]: Start accepts. Automaton has 11127 states and 34442 transitions. Word has length 17 [2019-12-27 16:18:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:09,088 INFO L462 AbstractCegarLoop]: Abstraction has 11127 states and 34442 transitions. [2019-12-27 16:18:09,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11127 states and 34442 transitions. [2019-12-27 16:18:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:18:09,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:09,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:09,095 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash -851147492, now seen corresponding path program 1 times [2019-12-27 16:18:09,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:09,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271962600] [2019-12-27 16:18:09,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:09,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271962600] [2019-12-27 16:18:09,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:09,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:18:09,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910183285] [2019-12-27 16:18:09,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:09,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:09,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 31 transitions. [2019-12-27 16:18:09,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:09,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:09,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:09,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:09,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:09,199 INFO L87 Difference]: Start difference. First operand 11127 states and 34442 transitions. Second operand 4 states. [2019-12-27 16:18:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:09,230 INFO L93 Difference]: Finished difference Result 2147 states and 5357 transitions. [2019-12-27 16:18:09,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:18:09,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 16:18:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:09,233 INFO L225 Difference]: With dead ends: 2147 [2019-12-27 16:18:09,233 INFO L226 Difference]: Without dead ends: 1515 [2019-12-27 16:18:09,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:18:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-12-27 16:18:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2019-12-27 16:18:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-12-27 16:18:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 3348 transitions. [2019-12-27 16:18:09,258 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 3348 transitions. Word has length 17 [2019-12-27 16:18:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:09,259 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 3348 transitions. [2019-12-27 16:18:09,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:18:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 3348 transitions. [2019-12-27 16:18:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:18:09,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:09,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:09,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:09,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-27 16:18:09,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:09,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873519593] [2019-12-27 16:18:09,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:09,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873519593] [2019-12-27 16:18:09,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:09,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:18:09,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132792809] [2019-12-27 16:18:09,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:09,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:09,360 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:18:09,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:09,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:09,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:18:09,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:18:09,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:09,362 INFO L87 Difference]: Start difference. First operand 1515 states and 3348 transitions. Second operand 6 states. [2019-12-27 16:18:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:09,952 INFO L93 Difference]: Finished difference Result 4210 states and 9198 transitions. [2019-12-27 16:18:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:18:09,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 16:18:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:09,959 INFO L225 Difference]: With dead ends: 4210 [2019-12-27 16:18:09,959 INFO L226 Difference]: Without dead ends: 4175 [2019-12-27 16:18:09,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:18:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2019-12-27 16:18:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 1849. [2019-12-27 16:18:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-12-27 16:18:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 4161 transitions. [2019-12-27 16:18:10,005 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 4161 transitions. Word has length 25 [2019-12-27 16:18:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:10,005 INFO L462 AbstractCegarLoop]: Abstraction has 1849 states and 4161 transitions. [2019-12-27 16:18:10,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:18:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 4161 transitions. [2019-12-27 16:18:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:18:10,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:10,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:10,008 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-27 16:18:10,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:10,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380568742] [2019-12-27 16:18:10,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:10,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380568742] [2019-12-27 16:18:10,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:10,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:18:10,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562884188] [2019-12-27 16:18:10,094 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:10,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:10,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:18:10,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:10,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:10,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:18:10,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:18:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:10,226 INFO L87 Difference]: Start difference. First operand 1849 states and 4161 transitions. Second operand 6 states. [2019-12-27 16:18:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:10,750 INFO L93 Difference]: Finished difference Result 3919 states and 8500 transitions. [2019-12-27 16:18:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:18:10,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 16:18:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:10,757 INFO L225 Difference]: With dead ends: 3919 [2019-12-27 16:18:10,757 INFO L226 Difference]: Without dead ends: 3890 [2019-12-27 16:18:10,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:18:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-12-27 16:18:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 1828. [2019-12-27 16:18:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-12-27 16:18:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 4133 transitions. [2019-12-27 16:18:10,800 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 4133 transitions. Word has length 26 [2019-12-27 16:18:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:10,801 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 4133 transitions. [2019-12-27 16:18:10,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:18:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 4133 transitions. [2019-12-27 16:18:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:18:10,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:10,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:10,804 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash 382543579, now seen corresponding path program 1 times [2019-12-27 16:18:10,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:10,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423439001] [2019-12-27 16:18:10,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:10,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-12-27 16:18:10,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423439001] [2019-12-27 16:18:10,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:10,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:10,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1914342797] [2019-12-27 16:18:10,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:10,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:10,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 44 transitions. [2019-12-27 16:18:10,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:10,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:10,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:10,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:10,871 INFO L87 Difference]: Start difference. First operand 1828 states and 4133 transitions. Second operand 3 states. [2019-12-27 16:18:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:10,897 INFO L93 Difference]: Finished difference Result 3313 states and 7495 transitions. [2019-12-27 16:18:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:10,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 16:18:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:10,901 INFO L225 Difference]: With dead ends: 3313 [2019-12-27 16:18:10,901 INFO L226 Difference]: Without dead ends: 1754 [2019-12-27 16:18:10,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-12-27 16:18:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1726. [2019-12-27 16:18:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 16:18:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3821 transitions. [2019-12-27 16:18:10,942 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3821 transitions. Word has length 28 [2019-12-27 16:18:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:10,942 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3821 transitions. [2019-12-27 16:18:10,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3821 transitions. [2019-12-27 16:18:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:18:10,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:10,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:10,947 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 2 times [2019-12-27 16:18:10,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:10,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187337776] [2019-12-27 16:18:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:11,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187337776] [2019-12-27 16:18:11,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:11,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:18:11,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617891360] [2019-12-27 16:18:11,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:11,042 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:11,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 16:18:11,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:11,130 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:18:11,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:18:11,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:18:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:11,132 INFO L87 Difference]: Start difference. First operand 1726 states and 3821 transitions. Second operand 6 states. [2019-12-27 16:18:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:11,181 INFO L93 Difference]: Finished difference Result 890 states and 1927 transitions. [2019-12-27 16:18:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:11,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:18:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:11,182 INFO L225 Difference]: With dead ends: 890 [2019-12-27 16:18:11,183 INFO L226 Difference]: Without dead ends: 722 [2019-12-27 16:18:11,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:18:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-27 16:18:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2019-12-27 16:18:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 16:18:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1611 transitions. [2019-12-27 16:18:11,199 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1611 transitions. Word has length 28 [2019-12-27 16:18:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:11,199 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1611 transitions. [2019-12-27 16:18:11,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:18:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1611 transitions. [2019-12-27 16:18:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:18:11,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:11,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:11,203 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1412598433, now seen corresponding path program 1 times [2019-12-27 16:18:11,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:11,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882811829] [2019-12-27 16:18:11,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:11,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882811829] [2019-12-27 16:18:11,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:11,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:18:11,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [981551656] [2019-12-27 16:18:11,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:11,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:11,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 136 transitions. [2019-12-27 16:18:11,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:11,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:18:11,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:18:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:18:11,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:18:11,441 INFO L87 Difference]: Start difference. First operand 722 states and 1611 transitions. Second operand 9 states. [2019-12-27 16:18:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:11,668 INFO L93 Difference]: Finished difference Result 1443 states and 3133 transitions. [2019-12-27 16:18:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:18:11,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 16:18:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:11,774 INFO L225 Difference]: With dead ends: 1443 [2019-12-27 16:18:11,775 INFO L226 Difference]: Without dead ends: 966 [2019-12-27 16:18:11,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:18:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-27 16:18:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 795. [2019-12-27 16:18:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-27 16:18:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1734 transitions. [2019-12-27 16:18:11,794 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1734 transitions. Word has length 52 [2019-12-27 16:18:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:11,794 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1734 transitions. [2019-12-27 16:18:11,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:18:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1734 transitions. [2019-12-27 16:18:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:18:11,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:11,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:11,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1409603297, now seen corresponding path program 2 times [2019-12-27 16:18:11,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:11,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103837040] [2019-12-27 16:18:11,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:18:11,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103837040] [2019-12-27 16:18:11,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:11,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:11,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657189615] [2019-12-27 16:18:11,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:11,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:11,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 140 transitions. [2019-12-27 16:18:11,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:11,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:18:11,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:11,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:11,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:11,999 INFO L87 Difference]: Start difference. First operand 795 states and 1734 transitions. Second operand 3 states. [2019-12-27 16:18:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:12,052 INFO L93 Difference]: Finished difference Result 1005 states and 2172 transitions. [2019-12-27 16:18:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:12,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 16:18:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:12,054 INFO L225 Difference]: With dead ends: 1005 [2019-12-27 16:18:12,054 INFO L226 Difference]: Without dead ends: 1005 [2019-12-27 16:18:12,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-12-27 16:18:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 703. [2019-12-27 16:18:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-27 16:18:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1519 transitions. [2019-12-27 16:18:12,067 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1519 transitions. Word has length 52 [2019-12-27 16:18:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:12,068 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1519 transitions. [2019-12-27 16:18:12,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1519 transitions. [2019-12-27 16:18:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:18:12,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:12,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:12,070 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-27 16:18:12,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:12,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854971004] [2019-12-27 16:18:12,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:18:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:18:12,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:18:12,202 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:18:12,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t587~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t587~0.base_29| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29|) |v_ULTIMATE.start_main_~#t587~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29|) 0) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_29|) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~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_796, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_14|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_20|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_17|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:18:12,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:18:12,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:18:12,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1970328274 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1970328274 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1970328274| ~y$w_buff0_used~0_In1970328274) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1970328274|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1970328274, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1970328274} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1970328274|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1970328274, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1970328274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:18:12,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2106071860 256)))) (or (and (= ~y$w_buff0~0_In-2106071860 |P1Thread1of1ForFork1_#t~ite15_Out-2106071860|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-2106071860| |P1Thread1of1ForFork1_#t~ite14_Out-2106071860|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-2106071860| |P1Thread1of1ForFork1_#t~ite14_Out-2106071860|) (= ~y$w_buff0~0_In-2106071860 |P1Thread1of1ForFork1_#t~ite14_Out-2106071860|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2106071860 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2106071860 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2106071860 256)) (and (= (mod ~y$r_buff1_thd2~0_In-2106071860 256) 0) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2106071860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2106071860, ~y$w_buff0~0=~y$w_buff0~0_In-2106071860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2106071860, ~weak$$choice2~0=~weak$$choice2~0_In-2106071860, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2106071860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2106071860} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2106071860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2106071860, ~y$w_buff0~0=~y$w_buff0~0_In-2106071860, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2106071860, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2106071860|, ~weak$$choice2~0=~weak$$choice2~0_In-2106071860, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2106071860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2106071860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 16:18:12,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-794247082 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-794247082| ~y$w_buff1~0_In-794247082) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In-794247082| |P1Thread1of1ForFork1_#t~ite17_Out-794247082|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-794247082 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-794247082 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-794247082 256) 0)) (= (mod ~y$w_buff0_used~0_In-794247082 256) 0))) (= |P1Thread1of1ForFork1_#t~ite17_Out-794247082| ~y$w_buff1~0_In-794247082) .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out-794247082| |P1Thread1of1ForFork1_#t~ite18_Out-794247082|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-794247082, ~y$w_buff1~0=~y$w_buff1~0_In-794247082, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794247082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-794247082, ~weak$$choice2~0=~weak$$choice2~0_In-794247082, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-794247082|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794247082} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-794247082, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-794247082|, ~y$w_buff1~0=~y$w_buff1~0_In-794247082, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794247082, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-794247082, ~weak$$choice2~0=~weak$$choice2~0_In-794247082, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-794247082|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794247082} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 16:18:12,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-583085535 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-583085535 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-583085535 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-583085535 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-583085535|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-583085535 |P0Thread1of1ForFork0_#t~ite6_Out-583085535|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-583085535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-583085535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-583085535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-583085535} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-583085535|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-583085535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-583085535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-583085535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-583085535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:18:12,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In844345996 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In844345996 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out844345996 ~y$r_buff0_thd1~0_In844345996)) (and (= ~y$r_buff0_thd1~0_Out844345996 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In844345996, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In844345996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In844345996, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out844345996|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out844345996} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:18:12,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-698731986 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-698731986 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-698731986 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-698731986 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-698731986|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In-698731986 |P0Thread1of1ForFork0_#t~ite8_Out-698731986|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-698731986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-698731986, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-698731986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-698731986} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-698731986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-698731986, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-698731986|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-698731986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-698731986} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:18:12,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1729571851 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1729571851| |P1Thread1of1ForFork1_#t~ite20_Out-1729571851|) (not .cse0) (= ~y$w_buff0_used~0_In-1729571851 |P1Thread1of1ForFork1_#t~ite21_Out-1729571851|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1729571851 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1729571851 256)) (and (= (mod ~y$w_buff1_used~0_In-1729571851 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1729571851 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1729571851| |P1Thread1of1ForFork1_#t~ite21_Out-1729571851|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1729571851| ~y$w_buff0_used~0_In-1729571851)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1729571851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729571851, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1729571851|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1729571851, ~weak$$choice2~0=~weak$$choice2~0_In-1729571851, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729571851} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1729571851, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729571851, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1729571851|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1729571851, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1729571851|, ~weak$$choice2~0=~weak$$choice2~0_In-1729571851, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729571851} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:18:12,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:18:12,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2097139772 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-2097139772 |P1Thread1of1ForFork1_#t~ite30_Out-2097139772|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-2097139772| |P1Thread1of1ForFork1_#t~ite29_Out-2097139772|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2097139772| |P1Thread1of1ForFork1_#t~ite30_Out-2097139772|) (= |P1Thread1of1ForFork1_#t~ite29_Out-2097139772| ~y$r_buff1_thd2~0_In-2097139772) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2097139772 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-2097139772 256) 0)) (= (mod ~y$w_buff0_used~0_In-2097139772 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2097139772 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2097139772, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2097139772|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2097139772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2097139772, ~weak$$choice2~0=~weak$$choice2~0_In-2097139772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2097139772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2097139772, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2097139772|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2097139772|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2097139772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2097139772, ~weak$$choice2~0=~weak$$choice2~0_In-2097139772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2097139772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 16:18:12,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:18:12,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 16:18:12,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1314837155 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1314837155 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1314837155| ~y$w_buff1~0_In-1314837155) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1314837155| ~y~0_In-1314837155)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1314837155, ~y$w_buff1~0=~y$w_buff1~0_In-1314837155, ~y~0=~y~0_In-1314837155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314837155} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1314837155, ~y$w_buff1~0=~y$w_buff1~0_In-1314837155, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1314837155|, ~y~0=~y~0_In-1314837155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314837155} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 16:18:12,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 16:18:12,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-18409036 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-18409036 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-18409036| ~y$w_buff0_used~0_In-18409036)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-18409036| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-18409036, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-18409036} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-18409036, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-18409036, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-18409036|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:18:12,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1097691698 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1097691698 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1097691698 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1097691698 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1097691698|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1097691698 |P1Thread1of1ForFork1_#t~ite35_Out1097691698|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1097691698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1097691698, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1097691698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1097691698} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1097691698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1097691698, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1097691698, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1097691698|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1097691698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:18:12,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-232011308 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-232011308 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-232011308| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-232011308| ~y$r_buff0_thd2~0_In-232011308)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-232011308, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-232011308} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-232011308, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-232011308, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-232011308|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:18:12,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1860847074 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1860847074 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1860847074 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1860847074 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1860847074|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1860847074 |P1Thread1of1ForFork1_#t~ite37_Out-1860847074|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1860847074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1860847074, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1860847074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1860847074} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1860847074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1860847074, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1860847074, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1860847074|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1860847074} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:18:12,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:18:12,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:18:12,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1785976353 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1785976353 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1785976353| ~y$w_buff1~0_In-1785976353) (not .cse1)) (and (= ~y~0_In-1785976353 |ULTIMATE.start_main_#t~ite40_Out-1785976353|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1785976353, ~y~0=~y~0_In-1785976353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1785976353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1785976353} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1785976353|, ~y$w_buff1~0=~y$w_buff1~0_In-1785976353, ~y~0=~y~0_In-1785976353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1785976353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1785976353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:18:12,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 16:18:12,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1266304170 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1266304170 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1266304170 |ULTIMATE.start_main_#t~ite42_Out1266304170|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1266304170|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1266304170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1266304170} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1266304170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1266304170, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1266304170|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:18:12,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1296687898 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1296687898 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1296687898 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1296687898 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1296687898| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1296687898| ~y$w_buff1_used~0_In-1296687898) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1296687898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1296687898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1296687898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1296687898} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1296687898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1296687898, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1296687898|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1296687898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1296687898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:18:12,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-638198693 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-638198693 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-638198693| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-638198693| ~y$r_buff0_thd0~0_In-638198693)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-638198693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638198693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-638198693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638198693, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-638198693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:18:12,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In870968814 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In870968814 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In870968814 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In870968814 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In870968814 |ULTIMATE.start_main_#t~ite45_Out870968814|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out870968814|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In870968814, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In870968814, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In870968814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In870968814} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In870968814, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In870968814, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In870968814, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out870968814|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In870968814} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:18:12,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:18:12,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:18:12 BasicIcfg [2019-12-27 16:18:12,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:18:12,346 INFO L168 Benchmark]: Toolchain (without parser) took 15830.71 ms. Allocated memory was 138.4 MB in the beginning and 732.4 MB in the end (delta: 594.0 MB). Free memory was 101.4 MB in the beginning and 364.1 MB in the end (delta: -262.7 MB). Peak memory consumption was 331.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,347 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.68 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 155.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 202.9 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,353 INFO L168 Benchmark]: Boogie Preprocessor took 40.96 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,354 INFO L168 Benchmark]: RCFGBuilder took 840.19 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 105.9 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,358 INFO L168 Benchmark]: TraceAbstraction took 14113.28 ms. Allocated memory was 202.9 MB in the beginning and 732.4 MB in the end (delta: 529.5 MB). Free memory was 105.2 MB in the beginning and 364.1 MB in the end (delta: -258.9 MB). Peak memory consumption was 270.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:12,367 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.68 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 155.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.22 ms. Allocated memory is still 202.9 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.96 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.19 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 105.9 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14113.28 ms. Allocated memory was 202.9 MB in the beginning and 732.4 MB in the end (delta: 529.5 MB). Free memory was 105.2 MB in the beginning and 364.1 MB in the end (delta: -258.9 MB). Peak memory consumption was 270.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 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) [L763] 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)) [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$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)) [L766] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1402 SDtfs, 1682 SDslu, 2352 SDs, 0 SdLazy, 1227 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred 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: 2.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 7735 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 23909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...