/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:04:52,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:04:52,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:04:52,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:04:52,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:04:52,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:04:52,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:04:52,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:04:52,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:04:52,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:04:52,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:04:52,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:04:52,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:04:52,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:04:52,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:04:52,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:04:52,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:04:52,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:04:52,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:04:52,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:04:52,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:04:52,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:04:52,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:04:52,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:04:52,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:04:52,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:04:52,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:04:52,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:04:52,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:04:52,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:04:52,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:04:52,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:04:52,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:04:52,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:04:52,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:04:52,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:04:52,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:04:52,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:04:52,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:04:52,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:04:52,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:04:52,227 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-VariableLbe-MCR.epf [2019-12-27 21:04:52,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:04:52,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:04:52,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:04:52,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:04:52,244 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:04:52,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:04:52,244 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:04:52,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:04:52,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:04:52,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:04:52,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:04:52,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:04:52,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:04:52,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:04:52,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:04:52,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:04:52,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:04:52,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:04:52,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:04:52,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:04:52,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:04:52,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:04:52,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:04:52,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:04:52,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:04:52,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:04:52,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:04:52,248 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:04:52,248 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:04:52,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:04:52,249 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:04:52,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:04:52,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:04:52,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:04:52,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:04:52,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:04:52,555 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:04:52,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-27 21:04:52,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30dd00699/f15faefdd466410aaf5ed920cf114bbd/FLAGad73e2276 [2019-12-27 21:04:53,209 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:04:53,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-27 21:04:53,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30dd00699/f15faefdd466410aaf5ed920cf114bbd/FLAGad73e2276 [2019-12-27 21:04:53,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30dd00699/f15faefdd466410aaf5ed920cf114bbd [2019-12-27 21:04:53,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:04:53,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:04:53,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:04:53,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:04:53,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:04:53,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:04:53" (1/1) ... [2019-12-27 21:04:53,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:53, skipping insertion in model container [2019-12-27 21:04:53,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:04:53" (1/1) ... [2019-12-27 21:04:53,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:04:53,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:04:54,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:04:54,177 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:04:54,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:04:54,324 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:04:54,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54 WrapperNode [2019-12-27 21:04:54,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:04:54,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:04:54,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:04:54,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:04:54,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:04:54,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:04:54,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:04:54,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:04:54,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (1/1) ... [2019-12-27 21:04:54,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:04:54,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:04:54,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:04:54,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:04:54,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (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 21:04:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:04:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:04:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:04:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:04:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:04:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:04:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:04:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:04:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:04:54,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:04:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:04:54,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:04:54,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:04:54,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:04:54,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:04:54,509 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 21:04:55,205 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:04:55,205 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:04:55,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:04:55 BoogieIcfgContainer [2019-12-27 21:04:55,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:04:55,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:04:55,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:04:55,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:04:55,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:04:53" (1/3) ... [2019-12-27 21:04:55,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1266ae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:04:55, skipping insertion in model container [2019-12-27 21:04:55,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:04:54" (2/3) ... [2019-12-27 21:04:55,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1266ae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:04:55, skipping insertion in model container [2019-12-27 21:04:55,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:04:55" (3/3) ... [2019-12-27 21:04:55,220 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2019-12-27 21:04:55,231 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:04:55,231 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:04:55,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:04:55,245 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:04:55,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,303 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,346 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,347 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,347 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,348 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,348 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,349 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,381 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,388 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,389 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,390 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,394 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:04:55,409 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:04:55,429 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:04:55,429 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:04:55,429 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:04:55,429 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:04:55,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:04:55,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:04:55,430 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:04:55,430 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:04:55,452 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 21:04:55,454 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:04:55,563 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:04:55,563 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:04:55,577 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:04:55,597 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:04:55,647 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:04:55,647 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:04:55,654 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:04:55,669 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:04:55,670 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:04:59,744 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 21:04:59,908 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 21:04:59,923 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 21:04:59,924 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 21:04:59,927 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 21:05:01,339 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 21:05:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 21:05:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:05:01,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:01,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:05:01,349 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 21:05:01,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:01,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107191691] [2019-12-27 21:05:01,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:01,688 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 21:05:01,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107191691] [2019-12-27 21:05:01,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:01,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:05:01,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39449248] [2019-12-27 21:05:01,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:01,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:01,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:05:01,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:01,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:01,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:05:01,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:01,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:05:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:05:01,737 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 21:05:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:02,311 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 21:05:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:05:02,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:05:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:02,567 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 21:05:02,567 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 21:05:02,568 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 21:05:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 21:05:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 21:05:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 21:05:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 21:05:04,571 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 21:05:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:04,572 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 21:05:04,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:05:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 21:05:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:05:04,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:04,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:05:04,585 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 21:05:04,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:04,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635128597] [2019-12-27 21:05:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:04,733 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 21:05:04,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635128597] [2019-12-27 21:05:04,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:04,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:05:04,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146572383] [2019-12-27 21:05:04,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:04,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:04,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:05:04,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:04,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:04,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:05:04,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:05:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:05:04,743 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 21:05:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:06,743 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 21:05:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:05:06,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 21:05:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:06,918 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 21:05:06,918 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 21:05:06,920 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 21:05:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 21:05:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 21:05:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 21:05:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 21:05:08,039 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 21:05:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:08,040 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 21:05:08,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:05:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 21:05:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:05:08,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:08,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:05:08,057 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 21:05:08,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:08,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686470394] [2019-12-27 21:05:08,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:08,184 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 21:05:08,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686470394] [2019-12-27 21:05:08,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:08,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:05:08,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876536884] [2019-12-27 21:05:08,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:08,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:08,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:05:08,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:08,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:05:08,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:05:08,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:05:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:05:08,243 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 5 states. [2019-12-27 21:05:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:08,912 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 21:05:08,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:05:08,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:05:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:09,113 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 21:05:09,113 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 21:05:09,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:05:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 21:05:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 21:05:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 21:05:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 21:05:12,657 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 21:05:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:12,657 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 21:05:12,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:05:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 21:05:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 21:05:12,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:12,669 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] [2019-12-27 21:05:12,670 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 21:05:12,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:12,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865653109] [2019-12-27 21:05:12,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:12,726 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 21:05:12,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865653109] [2019-12-27 21:05:12,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:12,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:05:12,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86420754] [2019-12-27 21:05:12,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:12,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:12,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 21:05:12,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:12,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:12,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:05:12,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:05:12,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:05:12,738 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 21:05:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:12,917 INFO L93 Difference]: Finished difference Result 30483 states and 126804 transitions. [2019-12-27 21:05:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:05:12,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 21:05:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:13,033 INFO L225 Difference]: With dead ends: 30483 [2019-12-27 21:05:13,033 INFO L226 Difference]: Without dead ends: 30483 [2019-12-27 21:05:13,034 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 21:05:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30483 states. [2019-12-27 21:05:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30483 to 30483. [2019-12-27 21:05:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30483 states. [2019-12-27 21:05:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30483 states to 30483 states and 126804 transitions. [2019-12-27 21:05:14,064 INFO L78 Accepts]: Start accepts. Automaton has 30483 states and 126804 transitions. Word has length 20 [2019-12-27 21:05:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:14,065 INFO L462 AbstractCegarLoop]: Abstraction has 30483 states and 126804 transitions. [2019-12-27 21:05:14,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:05:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30483 states and 126804 transitions. [2019-12-27 21:05:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 21:05:14,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:14,075 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] [2019-12-27 21:05:14,076 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -300921262, now seen corresponding path program 1 times [2019-12-27 21:05:14,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:14,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224248561] [2019-12-27 21:05:14,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:05:14,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224248561] [2019-12-27 21:05:14,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:14,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:05:14,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50005064] [2019-12-27 21:05:14,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:14,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:14,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 21:05:14,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:14,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:14,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:05:14,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:05:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:05:14,336 INFO L87 Difference]: Start difference. First operand 30483 states and 126804 transitions. Second operand 3 states. [2019-12-27 21:05:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:14,486 INFO L93 Difference]: Finished difference Result 30156 states and 125536 transitions. [2019-12-27 21:05:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:05:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 21:05:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:14,591 INFO L225 Difference]: With dead ends: 30156 [2019-12-27 21:05:14,591 INFO L226 Difference]: Without dead ends: 30156 [2019-12-27 21:05:14,592 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 21:05:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-27 21:05:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 30156. [2019-12-27 21:05:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30156 states. [2019-12-27 21:05:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30156 states to 30156 states and 125536 transitions. [2019-12-27 21:05:16,674 INFO L78 Accepts]: Start accepts. Automaton has 30156 states and 125536 transitions. Word has length 21 [2019-12-27 21:05:16,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:16,675 INFO L462 AbstractCegarLoop]: Abstraction has 30156 states and 125536 transitions. [2019-12-27 21:05:16,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:05:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30156 states and 125536 transitions. [2019-12-27 21:05:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:05:16,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:16,688 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] [2019-12-27 21:05:16,688 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:16,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 21:05:16,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:16,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496264525] [2019-12-27 21:05:16,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:16,793 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 21:05:16,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496264525] [2019-12-27 21:05:16,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:16,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:05:16,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205787380] [2019-12-27 21:05:16,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:16,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:16,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 46 transitions. [2019-12-27 21:05:16,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:16,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:05:16,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:05:16,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:05:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:05:16,817 INFO L87 Difference]: Start difference. First operand 30156 states and 125536 transitions. Second operand 4 states. [2019-12-27 21:05:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:17,064 INFO L93 Difference]: Finished difference Result 30156 states and 124144 transitions. [2019-12-27 21:05:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:05:17,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 21:05:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:17,187 INFO L225 Difference]: With dead ends: 30156 [2019-12-27 21:05:17,187 INFO L226 Difference]: Without dead ends: 30156 [2019-12-27 21:05:17,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 21:05:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-27 21:05:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 29756. [2019-12-27 21:05:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2019-12-27 21:05:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 122584 transitions. [2019-12-27 21:05:18,135 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 122584 transitions. Word has length 22 [2019-12-27 21:05:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:18,136 INFO L462 AbstractCegarLoop]: Abstraction has 29756 states and 122584 transitions. [2019-12-27 21:05:18,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:05:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 122584 transitions. [2019-12-27 21:05:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:05:18,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:18,146 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] [2019-12-27 21:05:18,146 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1925311680, now seen corresponding path program 1 times [2019-12-27 21:05:18,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:18,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281199494] [2019-12-27 21:05:18,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:18,214 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 21:05:18,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281199494] [2019-12-27 21:05:18,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:18,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:05:18,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565902678] [2019-12-27 21:05:18,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:18,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:18,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 41 transitions. [2019-12-27 21:05:18,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:05:18,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:05:18,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:05:18,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:18,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:05:18,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:05:18,277 INFO L87 Difference]: Start difference. First operand 29756 states and 122584 transitions. Second operand 8 states. [2019-12-27 21:05:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:19,067 INFO L93 Difference]: Finished difference Result 18293 states and 60476 transitions. [2019-12-27 21:05:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:05:19,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-27 21:05:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:19,095 INFO L225 Difference]: With dead ends: 18293 [2019-12-27 21:05:19,095 INFO L226 Difference]: Without dead ends: 16493 [2019-12-27 21:05:19,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:05:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16493 states. [2019-12-27 21:05:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16493 to 10556. [2019-12-27 21:05:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10556 states. [2019-12-27 21:05:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 34237 transitions. [2019-12-27 21:05:19,355 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 34237 transitions. Word has length 23 [2019-12-27 21:05:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:19,355 INFO L462 AbstractCegarLoop]: Abstraction has 10556 states and 34237 transitions. [2019-12-27 21:05:19,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:05:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 34237 transitions. [2019-12-27 21:05:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:05:19,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:19,361 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] [2019-12-27 21:05:19,361 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1601638180, now seen corresponding path program 1 times [2019-12-27 21:05:19,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:19,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276271105] [2019-12-27 21:05:19,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:19,402 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 21:05:19,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276271105] [2019-12-27 21:05:19,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:19,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:05:19,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965803095] [2019-12-27 21:05:19,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:19,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:19,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 50 transitions. [2019-12-27 21:05:19,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:19,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:05:19,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:05:19,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:05:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:05:19,433 INFO L87 Difference]: Start difference. First operand 10556 states and 34237 transitions. Second operand 4 states. [2019-12-27 21:05:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:19,510 INFO L93 Difference]: Finished difference Result 17590 states and 56181 transitions. [2019-12-27 21:05:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:05:19,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 21:05:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:19,529 INFO L225 Difference]: With dead ends: 17590 [2019-12-27 21:05:19,529 INFO L226 Difference]: Without dead ends: 10990 [2019-12-27 21:05:19,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:05:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10990 states. [2019-12-27 21:05:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10990 to 10806. [2019-12-27 21:05:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10806 states. [2019-12-27 21:05:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10806 states to 10806 states and 33714 transitions. [2019-12-27 21:05:19,691 INFO L78 Accepts]: Start accepts. Automaton has 10806 states and 33714 transitions. Word has length 24 [2019-12-27 21:05:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:19,691 INFO L462 AbstractCegarLoop]: Abstraction has 10806 states and 33714 transitions. [2019-12-27 21:05:19,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:05:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 10806 states and 33714 transitions. [2019-12-27 21:05:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:05:19,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:19,696 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] [2019-12-27 21:05:19,696 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 702094496, now seen corresponding path program 2 times [2019-12-27 21:05:19,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:19,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069655741] [2019-12-27 21:05:19,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:19,749 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 21:05:19,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069655741] [2019-12-27 21:05:19,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:19,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:05:19,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [890400313] [2019-12-27 21:05:19,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:19,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:19,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 56 transitions. [2019-12-27 21:05:19,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:19,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:05:19,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:05:19,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:19,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:05:19,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:05:19,868 INFO L87 Difference]: Start difference. First operand 10806 states and 33714 transitions. Second operand 6 states. [2019-12-27 21:05:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:19,958 INFO L93 Difference]: Finished difference Result 16343 states and 51703 transitions. [2019-12-27 21:05:19,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:05:19,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 21:05:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:19,972 INFO L225 Difference]: With dead ends: 16343 [2019-12-27 21:05:19,972 INFO L226 Difference]: Without dead ends: 8666 [2019-12-27 21:05:19,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:05:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2019-12-27 21:05:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 8361. [2019-12-27 21:05:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8361 states. [2019-12-27 21:05:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8361 states to 8361 states and 26206 transitions. [2019-12-27 21:05:20,098 INFO L78 Accepts]: Start accepts. Automaton has 8361 states and 26206 transitions. Word has length 24 [2019-12-27 21:05:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:20,098 INFO L462 AbstractCegarLoop]: Abstraction has 8361 states and 26206 transitions. [2019-12-27 21:05:20,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:05:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8361 states and 26206 transitions. [2019-12-27 21:05:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:05:20,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:20,102 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] [2019-12-27 21:05:20,102 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 238221496, now seen corresponding path program 3 times [2019-12-27 21:05:20,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:20,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990543723] [2019-12-27 21:05:20,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:20,185 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 21:05:20,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990543723] [2019-12-27 21:05:20,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:20,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:05:20,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017849338] [2019-12-27 21:05:20,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:20,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:20,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 21:05:20,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:20,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:20,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:05:20,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:20,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:05:20,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:05:20,196 INFO L87 Difference]: Start difference. First operand 8361 states and 26206 transitions. Second operand 6 states. [2019-12-27 21:05:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:20,301 INFO L93 Difference]: Finished difference Result 3182 states and 9111 transitions. [2019-12-27 21:05:20,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:05:20,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 21:05:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:20,308 INFO L225 Difference]: With dead ends: 3182 [2019-12-27 21:05:20,308 INFO L226 Difference]: Without dead ends: 2648 [2019-12-27 21:05:20,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:05:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2019-12-27 21:05:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2648. [2019-12-27 21:05:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2648 states. [2019-12-27 21:05:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 7485 transitions. [2019-12-27 21:05:20,358 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 7485 transitions. Word has length 24 [2019-12-27 21:05:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:20,359 INFO L462 AbstractCegarLoop]: Abstraction has 2648 states and 7485 transitions. [2019-12-27 21:05:20,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:05:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 7485 transitions. [2019-12-27 21:05:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:05:20,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:20,364 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] [2019-12-27 21:05:20,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 21:05:20,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:20,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309521069] [2019-12-27 21:05:20,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:20,411 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 21:05:20,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309521069] [2019-12-27 21:05:20,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:20,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:05:20,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1035015836] [2019-12-27 21:05:20,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:20,420 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:20,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 220 transitions. [2019-12-27 21:05:20,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:20,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:05:20,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:05:20,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:05:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:05:20,506 INFO L87 Difference]: Start difference. First operand 2648 states and 7485 transitions. Second operand 5 states. [2019-12-27 21:05:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:20,597 INFO L93 Difference]: Finished difference Result 3966 states and 11148 transitions. [2019-12-27 21:05:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:05:20,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:05:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:20,603 INFO L225 Difference]: With dead ends: 3966 [2019-12-27 21:05:20,604 INFO L226 Difference]: Without dead ends: 3966 [2019-12-27 21:05:20,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:05:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2019-12-27 21:05:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3124. [2019-12-27 21:05:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2019-12-27 21:05:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 8947 transitions. [2019-12-27 21:05:20,645 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 8947 transitions. Word has length 32 [2019-12-27 21:05:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:20,645 INFO L462 AbstractCegarLoop]: Abstraction has 3124 states and 8947 transitions. [2019-12-27 21:05:20,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:05:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 8947 transitions. [2019-12-27 21:05:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:05:20,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:20,649 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] [2019-12-27 21:05:20,650 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 21:05:20,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:20,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693028627] [2019-12-27 21:05:20,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:20,790 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 21:05:20,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693028627] [2019-12-27 21:05:20,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:20,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:05:20,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855302544] [2019-12-27 21:05:20,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:20,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:20,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 220 transitions. [2019-12-27 21:05:20,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:20,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:05:20,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:05:20,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:05:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:05:20,905 INFO L87 Difference]: Start difference. First operand 3124 states and 8947 transitions. Second operand 8 states. [2019-12-27 21:05:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:21,534 INFO L93 Difference]: Finished difference Result 6556 states and 17848 transitions. [2019-12-27 21:05:21,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:05:21,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 21:05:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:21,545 INFO L225 Difference]: With dead ends: 6556 [2019-12-27 21:05:21,545 INFO L226 Difference]: Without dead ends: 6418 [2019-12-27 21:05:21,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:05:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2019-12-27 21:05:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 3254. [2019-12-27 21:05:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-12-27 21:05:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 9275 transitions. [2019-12-27 21:05:21,598 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 9275 transitions. Word has length 32 [2019-12-27 21:05:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:21,598 INFO L462 AbstractCegarLoop]: Abstraction has 3254 states and 9275 transitions. [2019-12-27 21:05:21,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:05:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 9275 transitions. [2019-12-27 21:05:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:05:21,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:21,602 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] [2019-12-27 21:05:21,603 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:21,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 21:05:21,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:21,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749276147] [2019-12-27 21:05:21,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:21,726 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 21:05:21,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749276147] [2019-12-27 21:05:21,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:21,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:05:21,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185274024] [2019-12-27 21:05:21,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:21,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:21,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 233 transitions. [2019-12-27 21:05:21,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:21,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:05:21,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:05:21,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:05:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:05:21,849 INFO L87 Difference]: Start difference. First operand 3254 states and 9275 transitions. Second operand 8 states. [2019-12-27 21:05:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:22,424 INFO L93 Difference]: Finished difference Result 6239 states and 16879 transitions. [2019-12-27 21:05:22,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:05:22,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:05:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:22,433 INFO L225 Difference]: With dead ends: 6239 [2019-12-27 21:05:22,434 INFO L226 Difference]: Without dead ends: 6095 [2019-12-27 21:05:22,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:05:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-12-27 21:05:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3058. [2019-12-27 21:05:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2019-12-27 21:05:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 8767 transitions. [2019-12-27 21:05:22,484 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 8767 transitions. Word has length 33 [2019-12-27 21:05:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:22,484 INFO L462 AbstractCegarLoop]: Abstraction has 3058 states and 8767 transitions. [2019-12-27 21:05:22,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:05:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 8767 transitions. [2019-12-27 21:05:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:05:22,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:22,488 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] [2019-12-27 21:05:22,489 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2023232687, now seen corresponding path program 1 times [2019-12-27 21:05:22,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:22,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465058094] [2019-12-27 21:05:22,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:22,575 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 21:05:22,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465058094] [2019-12-27 21:05:22,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:22,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:05:22,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457057036] [2019-12-27 21:05:22,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:22,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:22,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 21:05:22,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:22,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:22,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:05:22,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:05:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:05:22,595 INFO L87 Difference]: Start difference. First operand 3058 states and 8767 transitions. Second operand 7 states. [2019-12-27 21:05:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:22,719 INFO L93 Difference]: Finished difference Result 2310 states and 6941 transitions. [2019-12-27 21:05:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:05:22,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:05:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:22,723 INFO L225 Difference]: With dead ends: 2310 [2019-12-27 21:05:22,723 INFO L226 Difference]: Without dead ends: 1641 [2019-12-27 21:05:22,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:05:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-27 21:05:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1587. [2019-12-27 21:05:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-12-27 21:05:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 4626 transitions. [2019-12-27 21:05:22,754 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 4626 transitions. Word has length 33 [2019-12-27 21:05:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:22,754 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 4626 transitions. [2019-12-27 21:05:22,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:05:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 4626 transitions. [2019-12-27 21:05:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:05:22,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:22,759 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] [2019-12-27 21:05:22,759 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1690133927, now seen corresponding path program 1 times [2019-12-27 21:05:22,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:22,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703858971] [2019-12-27 21:05:22,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:22,853 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 21:05:22,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703858971] [2019-12-27 21:05:22,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:22,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:05:22,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948407935] [2019-12-27 21:05:22,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:22,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:22,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 103 transitions. [2019-12-27 21:05:22,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:22,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:22,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:05:22,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:05:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:05:22,927 INFO L87 Difference]: Start difference. First operand 1587 states and 4626 transitions. Second operand 4 states. [2019-12-27 21:05:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:22,947 INFO L93 Difference]: Finished difference Result 2023 states and 5628 transitions. [2019-12-27 21:05:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:05:22,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 21:05:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:22,948 INFO L225 Difference]: With dead ends: 2023 [2019-12-27 21:05:22,949 INFO L226 Difference]: Without dead ends: 481 [2019-12-27 21:05:22,949 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 21:05:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-27 21:05:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-27 21:05:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 21:05:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 21:05:22,955 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 48 [2019-12-27 21:05:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:22,955 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 21:05:22,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:05:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 21:05:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:05:22,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:22,956 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] [2019-12-27 21:05:22,956 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 2 times [2019-12-27 21:05:22,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:22,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642564602] [2019-12-27 21:05:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:05:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:05:23,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642564602] [2019-12-27 21:05:23,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:05:23,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:05:23,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959406039] [2019-12-27 21:05:23,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:05:23,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:05:23,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-27 21:05:23,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:05:23,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:05:23,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:05:23,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:05:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:05:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:05:23,092 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 21:05:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:05:23,240 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 21:05:23,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:05:23,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 21:05:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:05:23,241 INFO L225 Difference]: With dead ends: 912 [2019-12-27 21:05:23,241 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 21:05:23,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:05:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 21:05:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 21:05:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 21:05:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 21:05:23,249 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 21:05:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:05:23,249 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 21:05:23,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:05:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 21:05:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:05:23,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:05:23,251 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] [2019-12-27 21:05:23,251 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:05:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:05:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 3 times [2019-12-27 21:05:23,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:05:23,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867891543] [2019-12-27 21:05:23,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:05:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:05:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:05:23,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:05:23,377 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:05:23,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= 0 |v_ULTIMATE.start_main_~#t997~0.offset_22|) (= v_~z$read_delayed_var~0.offset_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t997~0.base_29|) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= |v_#memory_int_25| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t997~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t997~0.base_29|) |v_ULTIMATE.start_main_~#t997~0.offset_22| 0))) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_66 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z~0_20 0) (= v_~y~0_11 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t997~0.base_29| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t997~0.base_29| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t997~0.base_29|) 0) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t997~0.offset=|v_ULTIMATE.start_main_~#t997~0.offset_22|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_15|, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_~#t997~0.base=|v_ULTIMATE.start_main_~#t997~0.base_29|, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_19|, ~y~0=v_~y~0_11, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_18|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t997~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t999~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1000~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t997~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1000~0.base, ~y~0, ULTIMATE.start_main_~#t998~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t999~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t998~0.base] because there is no mapped edge [2019-12-27 21:05:23,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11|) |v_ULTIMATE.start_main_~#t998~0.offset_10| 1)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t998~0.base_11| 4) |v_#length_23|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t998~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t998~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_11|, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t998~0.base, ULTIMATE.start_main_~#t998~0.offset] because there is no mapped edge [2019-12-27 21:05:23,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t999~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t999~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12|) |v_ULTIMATE.start_main_~#t999~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t999~0.offset_11| 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t999~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t999~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t999~0.offset] because there is no mapped edge [2019-12-27 21:05:23,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1000~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1000~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1000~0.base_12| 4)) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12|) |v_ULTIMATE.start_main_~#t1000~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1000~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_12|, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1000~0.base, ULTIMATE.start_main_~#t1000~0.offset, #length] because there is no mapped edge [2019-12-27 21:05:23,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (= ~z$r_buff1_thd3~0_Out-131840910 ~z$r_buff0_thd3~0_In-131840910) (= 1 ~a~0_Out-131840910) (= 1 ~z$r_buff0_thd4~0_Out-131840910) (= ~__unbuffered_p3_EAX~0_Out-131840910 ~a~0_Out-131840910) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-131840910 0)) (= ~z$r_buff1_thd0~0_Out-131840910 ~z$r_buff0_thd0~0_In-131840910) (= ~z$r_buff0_thd1~0_In-131840910 ~z$r_buff1_thd1~0_Out-131840910) (= ~b~0_In-131840910 ~__unbuffered_p3_EBX~0_Out-131840910) (= ~z$r_buff0_thd2~0_In-131840910 ~z$r_buff1_thd2~0_Out-131840910) (= ~z$r_buff0_thd4~0_In-131840910 ~z$r_buff1_thd4~0_Out-131840910)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-131840910, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-131840910, ~b~0=~b~0_In-131840910, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-131840910, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-131840910, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-131840910, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-131840910} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-131840910, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-131840910, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-131840910, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-131840910, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-131840910, ~a~0=~a~0_Out-131840910, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-131840910, ~b~0=~b~0_In-131840910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-131840910, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-131840910, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-131840910, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-131840910, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-131840910, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-131840910, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-131840910} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:05:23,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 21:05:23,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 2 v_~x~0_8) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_7, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:05:23,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In696432436 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In696432436 256) 0))) (or (= (mod ~z$w_buff0_used~0_In696432436 256) 0) (and (= (mod ~z$w_buff1_used~0_In696432436 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In696432436 256)) .cse0))) (= |P2Thread1of1ForFork1_#t~ite8_Out696432436| ~z$w_buff0~0_In696432436) (= |P2Thread1of1ForFork1_#t~ite8_Out696432436| |P2Thread1of1ForFork1_#t~ite9_Out696432436|) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite8_In696432436| |P2Thread1of1ForFork1_#t~ite8_Out696432436|) (= ~z$w_buff0~0_In696432436 |P2Thread1of1ForFork1_#t~ite9_Out696432436|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In696432436, ~z$w_buff0_used~0=~z$w_buff0_used~0_In696432436, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In696432436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In696432436, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In696432436, ~weak$$choice2~0=~weak$$choice2~0_In696432436, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In696432436|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In696432436, ~z$w_buff0_used~0=~z$w_buff0_used~0_In696432436, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In696432436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In696432436, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In696432436, ~weak$$choice2~0=~weak$$choice2~0_In696432436, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out696432436|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out696432436|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:05:23,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1437324607 256)))) (or (and (= ~z$w_buff1~0_In-1437324607 |P2Thread1of1ForFork1_#t~ite11_Out-1437324607|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1437324607 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1437324607 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-1437324607 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1437324607 256)))) .cse1 (= |P2Thread1of1ForFork1_#t~ite12_Out-1437324607| |P2Thread1of1ForFork1_#t~ite11_Out-1437324607|)) (and (not .cse1) (= ~z$w_buff1~0_In-1437324607 |P2Thread1of1ForFork1_#t~ite12_Out-1437324607|) (= |P2Thread1of1ForFork1_#t~ite11_In-1437324607| |P2Thread1of1ForFork1_#t~ite11_Out-1437324607|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1437324607, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1437324607, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-1437324607|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1437324607, ~z$w_buff1~0=~z$w_buff1~0_In-1437324607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1437324607, ~weak$$choice2~0=~weak$$choice2~0_In-1437324607} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1437324607, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1437324607|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1437324607, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1437324607|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1437324607, ~z$w_buff1~0=~z$w_buff1~0_In-1437324607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1437324607, ~weak$$choice2~0=~weak$$choice2~0_In-1437324607} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:05:23,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In710775941 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_In710775941| |P2Thread1of1ForFork1_#t~ite14_Out710775941|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite15_Out710775941| ~z$w_buff0_used~0_In710775941)) (and (= |P2Thread1of1ForFork1_#t~ite15_Out710775941| |P2Thread1of1ForFork1_#t~ite14_Out710775941|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In710775941 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In710775941 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In710775941 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In710775941 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite14_Out710775941| ~z$w_buff0_used~0_In710775941)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In710775941|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710775941, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In710775941, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710775941, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In710775941, ~weak$$choice2~0=~weak$$choice2~0_In710775941} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out710775941|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out710775941|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710775941, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In710775941, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710775941, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In710775941, ~weak$$choice2~0=~weak$$choice2~0_In710775941} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 21:05:23,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 21:05:23,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2141836608 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite24_Out2141836608| ~z$r_buff1_thd3~0_In2141836608) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In2141836608| |P2Thread1of1ForFork1_#t~ite23_Out2141836608|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out2141836608| |P2Thread1of1ForFork1_#t~ite23_Out2141836608|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2141836608 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In2141836608 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In2141836608 256)) (and (= (mod ~z$w_buff1_used~0_In2141836608 256) 0) .cse1))) (= ~z$r_buff1_thd3~0_In2141836608 |P2Thread1of1ForFork1_#t~ite23_Out2141836608|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2141836608, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2141836608, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In2141836608|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141836608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141836608, ~weak$$choice2~0=~weak$$choice2~0_In2141836608} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out2141836608|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2141836608, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2141836608, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out2141836608|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141836608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2141836608, ~weak$$choice2~0=~weak$$choice2~0_In2141836608} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 21:05:23,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:05:23,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1884319793 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1884319793 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1884319793| ~z$w_buff0_used~0_In-1884319793) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-1884319793| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1884319793, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1884319793} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1884319793|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1884319793, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1884319793} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 21:05:23,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-517520948 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-517520948 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-517520948 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-517520948 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out-517520948| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite29_Out-517520948| ~z$w_buff1_used~0_In-517520948)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-517520948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517520948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-517520948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517520948} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-517520948|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-517520948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517520948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-517520948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517520948} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:05:23,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-240668617 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-240668617 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-240668617)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-240668617 ~z$r_buff0_thd4~0_In-240668617)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-240668617, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-240668617} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-240668617, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-240668617, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-240668617|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 21:05:23,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In640946529 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In640946529 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In640946529 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In640946529 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite31_Out640946529|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In640946529 |P3Thread1of1ForFork2_#t~ite31_Out640946529|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In640946529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In640946529, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In640946529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In640946529} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In640946529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In640946529, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In640946529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In640946529, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out640946529|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:05:23,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:05:23,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:05:23,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite36_Out1740747701| |ULTIMATE.start_main_#t~ite37_Out1740747701|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1740747701 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1740747701 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite36_Out1740747701| ~z$w_buff1~0_In1740747701)) (and .cse0 (= |ULTIMATE.start_main_#t~ite36_Out1740747701| ~z~0_In1740747701) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1740747701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1740747701, ~z$w_buff1~0=~z$w_buff1~0_In1740747701, ~z~0=~z~0_In1740747701} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1740747701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1740747701, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1740747701|, ~z$w_buff1~0=~z$w_buff1~0_In1740747701, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1740747701|, ~z~0=~z~0_In1740747701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:05:23,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-750256963 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-750256963 256) 0))) (or (and (= ~z$w_buff0_used~0_In-750256963 |ULTIMATE.start_main_#t~ite38_Out-750256963|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-750256963| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-750256963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-750256963} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-750256963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-750256963, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-750256963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:05:23,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1159362027 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1159362027 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1159362027 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1159362027 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1159362027| ~z$w_buff1_used~0_In-1159362027) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1159362027| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1159362027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1159362027, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1159362027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1159362027} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1159362027, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1159362027|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1159362027, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1159362027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1159362027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:05:23,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1955731239 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1955731239 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1955731239| ~z$r_buff0_thd0~0_In1955731239)) (and (= |ULTIMATE.start_main_#t~ite40_Out1955731239| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1955731239, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1955731239} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1955731239, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1955731239|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1955731239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:05:23,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In498128541 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In498128541 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In498128541 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In498128541 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out498128541| ~z$r_buff1_thd0~0_In498128541) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out498128541| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In498128541, ~z$w_buff0_used~0=~z$w_buff0_used~0_In498128541, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In498128541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In498128541} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out498128541|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In498128541, ~z$w_buff0_used~0=~z$w_buff0_used~0_In498128541, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In498128541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In498128541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:05:23,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:05:23,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:05:23 BasicIcfg [2019-12-27 21:05:23,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:05:23,512 INFO L168 Benchmark]: Toolchain (without parser) took 30032.75 ms. Allocated memory was 138.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 101.8 MB in the beginning and 411.4 MB in the end (delta: -309.6 MB). Peak memory consumption was 911.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,513 INFO L168 Benchmark]: CDTParser took 0.15 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.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.91 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 156.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.35 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,515 INFO L168 Benchmark]: Boogie Preprocessor took 38.19 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,515 INFO L168 Benchmark]: RCFGBuilder took 781.68 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 105.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,516 INFO L168 Benchmark]: TraceAbstraction took 28299.52 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 104.5 MB in the beginning and 411.4 MB in the end (delta: -306.9 MB). Peak memory consumption was 850.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:05:23,520 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.15 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.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 838.91 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 156.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.35 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.19 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.68 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 105.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28299.52 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 104.5 MB in the beginning and 411.4 MB in the end (delta: -306.9 MB). Peak memory consumption was 850.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5618 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1762 SDtfs, 2676 SDslu, 3565 SDs, 0 SdLazy, 1470 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31130occurred 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: 11.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 21837 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 36052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...