/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:52:44,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:52:44,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:52:44,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:52:44,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:52:44,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:52:44,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:52:44,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:52:44,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:52:44,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:52:44,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:52:44,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:52:44,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:52:44,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:52:44,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:52:44,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:52:44,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:52:44,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:52:44,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:52:44,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:52:44,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:52:44,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:52:44,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:52:44,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:52:44,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:52:44,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:52:44,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:52:44,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:52:44,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:52:44,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:52:44,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:52:44,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:52:44,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:52:44,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:52:44,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:52:44,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:52:44,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:52:44,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:52:44,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:52:44,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:52:44,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:52:44,137 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.epf [2019-12-18 21:52:44,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:52:44,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:52:44,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:52:44,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:52:44,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:52:44,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:52:44,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:52:44,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:52:44,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:52:44,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:52:44,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:52:44,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:52:44,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:52:44,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:52:44,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:52:44,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:52:44,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:52:44,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:52:44,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:52:44,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:52:44,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:52:44,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:52:44,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:52:44,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:52:44,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:52:44,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:52:44,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:52:44,157 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:52:44,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:52:44,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:52:44,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:52:44,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:52:44,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:52:44,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:52:44,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:52:44,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2019-12-18 21:52:44,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa919c98/6e4d0bed6969480285ef90a33aa8c251/FLAG1e52f3193 [2019-12-18 21:52:45,153 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:52:45,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2019-12-18 21:52:45,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa919c98/6e4d0bed6969480285ef90a33aa8c251/FLAG1e52f3193 [2019-12-18 21:52:45,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa919c98/6e4d0bed6969480285ef90a33aa8c251 [2019-12-18 21:52:45,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:52:45,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:52:45,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:45,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:52:45,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:52:45,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:45" (1/1) ... [2019-12-18 21:52:45,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b73b4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:45, skipping insertion in model container [2019-12-18 21:52:45,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:45" (1/1) ... [2019-12-18 21:52:45,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:52:45,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:52:46,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:46,067 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:52:46,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:46,246 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:52:46,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46 WrapperNode [2019-12-18 21:52:46,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:46,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:46,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:52:46,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:52:46,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:46,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:52:46,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:52:46,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:52:46,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (1/1) ... [2019-12-18 21:52:46,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:52:46,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:52:46,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:52:46,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:52:46,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (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-18 21:52:46,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:52:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:52:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:52:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:52:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:52:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:52:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:52:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:52:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:52:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:52:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:52:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:52:46,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:52:46,443 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:52:47,196 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:52:47,196 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:52:47,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:47 BoogieIcfgContainer [2019-12-18 21:52:47,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:52:47,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:52:47,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:52:47,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:52:47,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:52:45" (1/3) ... [2019-12-18 21:52:47,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3faafc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:47, skipping insertion in model container [2019-12-18 21:52:47,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:46" (2/3) ... [2019-12-18 21:52:47,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3faafc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:47, skipping insertion in model container [2019-12-18 21:52:47,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:47" (3/3) ... [2019-12-18 21:52:47,207 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt.i [2019-12-18 21:52:47,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:52:47,218 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:52:47,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:52:47,227 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:52:47,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,266 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,289 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,291 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,291 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,303 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,303 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:47,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:52:47,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:52:47,359 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:52:47,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:52:47,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:52:47,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:52:47,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:52:47,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:52:47,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:52:47,377 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 21:52:47,379 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 21:52:47,459 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 21:52:47,460 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:47,474 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:52:47,495 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 21:52:47,554 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 21:52:47,555 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:47,563 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:52:47,579 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:52:47,580 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:52:50,962 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:52:51,075 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:52:51,093 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-18 21:52:51,093 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 21:52:51,097 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-18 21:52:52,258 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-18 21:52:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-18 21:52:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:52:52,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:52,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:52,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-18 21:52:52,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:52,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392466348] [2019-12-18 21:52:52,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:52,524 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-18 21:52:52,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392466348] [2019-12-18 21:52:52,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:52,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:52:52,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231522302] [2019-12-18 21:52:52,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:52,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:52,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:52,550 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-18 21:52:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:52,945 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-18 21:52:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:52,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:52:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:53,115 INFO L225 Difference]: With dead ends: 18414 [2019-12-18 21:52:53,115 INFO L226 Difference]: Without dead ends: 18050 [2019-12-18 21:52:53,117 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-18 21:52:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-18 21:52:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-18 21:52:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-18 21:52:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-18 21:52:54,734 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-18 21:52:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:54,735 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-18 21:52:54,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-18 21:52:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:52:54,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:54,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:54,748 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-18 21:52:54,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:54,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451113181] [2019-12-18 21:52:54,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:54,915 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-18 21:52:54,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451113181] [2019-12-18 21:52:54,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465175301] [2019-12-18 21:52:54,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:54,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:54,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:54,922 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 4 states. [2019-12-18 21:52:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:55,365 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-18 21:52:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:55,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:52:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:55,483 INFO L225 Difference]: With dead ends: 28066 [2019-12-18 21:52:55,483 INFO L226 Difference]: Without dead ends: 28052 [2019-12-18 21:52:55,484 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-18 21:52:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-18 21:52:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-18 21:52:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-18 21:52:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-18 21:52:57,609 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-18 21:52:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:57,610 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-18 21:52:57,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-18 21:52:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:52:57,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:57,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:57,614 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-18 21:52:57,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:57,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705545573] [2019-12-18 21:52:57,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:57,674 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-18 21:52:57,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705545573] [2019-12-18 21:52:57,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:57,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:57,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722881852] [2019-12-18 21:52:57,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:57,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:57,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:57,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:57,677 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-18 21:52:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:57,744 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-18 21:52:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:57,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:52:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:57,781 INFO L225 Difference]: With dead ends: 14452 [2019-12-18 21:52:57,782 INFO L226 Difference]: Without dead ends: 14452 [2019-12-18 21:52:57,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-18 21:52:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-18 21:52:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-18 21:52:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-18 21:52:58,162 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-18 21:52:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:58,163 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-18 21:52:58,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-18 21:52:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:52:58,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:58,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:58,165 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-18 21:52:58,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:58,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358290428] [2019-12-18 21:52:58,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:58,467 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-18 21:52:58,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358290428] [2019-12-18 21:52:58,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:58,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:58,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913186870] [2019-12-18 21:52:58,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:58,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:58,470 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 4 states. [2019-12-18 21:52:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:58,501 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-18 21:52:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:52:58,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:52:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:58,506 INFO L225 Difference]: With dead ends: 2114 [2019-12-18 21:52:58,507 INFO L226 Difference]: Without dead ends: 2114 [2019-12-18 21:52:58,507 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-18 21:52:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-18 21:52:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-18 21:52:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-18 21:52:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-18 21:52:58,549 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-18 21:52:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:58,549 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-18 21:52:58,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:52:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-18 21:52:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:52:58,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:58,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:58,552 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-18 21:52:58,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:58,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952759959] [2019-12-18 21:52:58,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:52:58,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952759959] [2019-12-18 21:52:58,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:58,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:52:58,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202953978] [2019-12-18 21:52:58,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:58,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:58,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:58,695 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 5 states. [2019-12-18 21:52:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:58,729 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-18 21:52:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:52:58,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:52:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:58,732 INFO L225 Difference]: With dead ends: 699 [2019-12-18 21:52:58,732 INFO L226 Difference]: Without dead ends: 655 [2019-12-18 21:52:58,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-18 21:52:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-18 21:52:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 21:52:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-18 21:52:58,748 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-18 21:52:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:58,749 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-18 21:52:58,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-18 21:52:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:58,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:58,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:58,754 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:58,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:58,755 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-18 21:52:58,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:58,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605596205] [2019-12-18 21:52:58,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:58,869 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-18 21:52:58,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605596205] [2019-12-18 21:52:58,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:58,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:52:58,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657093441] [2019-12-18 21:52:58,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:58,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:58,872 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-18 21:52:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:58,921 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-18 21:52:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:58,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:52:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:58,924 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:52:58,924 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:52:58,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:52:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:52:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:52:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-18 21:52:58,942 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-18 21:52:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:58,943 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-18 21:52:58,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-18 21:52:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:58,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:58,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:58,945 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:58,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-18 21:52:58,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:58,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334533211] [2019-12-18 21:52:58,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:59,116 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-18 21:52:59,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334533211] [2019-12-18 21:52:59,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:59,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:52:59,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494295810] [2019-12-18 21:52:59,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:52:59,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:52:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:52:59,119 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-18 21:52:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:59,371 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-18 21:52:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:52:59,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:52:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:59,375 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:52:59,376 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:52:59,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:52:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:52:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:52:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:52:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-18 21:52:59,392 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-18 21:52:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:59,393 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-18 21:52:59,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:52:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-18 21:52:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:59,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:59,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:59,396 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-18 21:52:59,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:59,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458120403] [2019-12-18 21:52:59,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:59,534 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-18 21:52:59,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458120403] [2019-12-18 21:52:59,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:59,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:52:59,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087966122] [2019-12-18 21:52:59,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:52:59,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:52:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:52:59,536 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 6 states. [2019-12-18 21:52:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:59,914 INFO L93 Difference]: Finished difference Result 1193 states and 2783 transitions. [2019-12-18 21:52:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:52:59,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 21:52:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:59,917 INFO L225 Difference]: With dead ends: 1193 [2019-12-18 21:52:59,917 INFO L226 Difference]: Without dead ends: 1193 [2019-12-18 21:52:59,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:52:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-18 21:52:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 761. [2019-12-18 21:52:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-18 21:52:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-18 21:52:59,933 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-18 21:52:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:59,934 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-18 21:52:59,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:52:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-18 21:52:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:52:59,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:59,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:59,936 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-18 21:52:59,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:59,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840094347] [2019-12-18 21:52:59,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:00,039 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-18 21:53:00,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840094347] [2019-12-18 21:53:00,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:00,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:00,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268777511] [2019-12-18 21:53:00,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:00,042 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 3 states. [2019-12-18 21:53:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:00,088 INFO L93 Difference]: Finished difference Result 760 states and 1798 transitions. [2019-12-18 21:53:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:00,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:53:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:00,091 INFO L225 Difference]: With dead ends: 760 [2019-12-18 21:53:00,091 INFO L226 Difference]: Without dead ends: 760 [2019-12-18 21:53:00,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-18 21:53:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 539. [2019-12-18 21:53:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-18 21:53:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1284 transitions. [2019-12-18 21:53:00,102 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1284 transitions. Word has length 55 [2019-12-18 21:53:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:00,102 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1284 transitions. [2019-12-18 21:53:00,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1284 transitions. [2019-12-18 21:53:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:53:00,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:00,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:00,104 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash -660404610, now seen corresponding path program 1 times [2019-12-18 21:53:00,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:00,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540901945] [2019-12-18 21:53:00,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:00,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540901945] [2019-12-18 21:53:00,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:00,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:53:00,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381470372] [2019-12-18 21:53:00,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:53:00,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:53:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:00,246 INFO L87 Difference]: Start difference. First operand 539 states and 1284 transitions. Second operand 6 states. [2019-12-18 21:53:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:00,357 INFO L93 Difference]: Finished difference Result 910 states and 2076 transitions. [2019-12-18 21:53:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:53:00,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 21:53:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:00,359 INFO L225 Difference]: With dead ends: 910 [2019-12-18 21:53:00,359 INFO L226 Difference]: Without dead ends: 373 [2019-12-18 21:53:00,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:53:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-18 21:53:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 320. [2019-12-18 21:53:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 21:53:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 604 transitions. [2019-12-18 21:53:00,365 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 604 transitions. Word has length 56 [2019-12-18 21:53:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:00,365 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 604 transitions. [2019-12-18 21:53:00,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:53:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 604 transitions. [2019-12-18 21:53:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:53:00,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:00,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:00,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:00,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 172958554, now seen corresponding path program 2 times [2019-12-18 21:53:00,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:00,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705691230] [2019-12-18 21:53:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:00,538 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-18 21:53:00,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705691230] [2019-12-18 21:53:00,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:00,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:00,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284635258] [2019-12-18 21:53:00,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:00,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:00,541 INFO L87 Difference]: Start difference. First operand 320 states and 604 transitions. Second operand 3 states. [2019-12-18 21:53:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:00,556 INFO L93 Difference]: Finished difference Result 306 states and 560 transitions. [2019-12-18 21:53:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:00,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:53:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:00,557 INFO L225 Difference]: With dead ends: 306 [2019-12-18 21:53:00,557 INFO L226 Difference]: Without dead ends: 306 [2019-12-18 21:53:00,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-18 21:53:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 279. [2019-12-18 21:53:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-18 21:53:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-18 21:53:00,563 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 56 [2019-12-18 21:53:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:00,563 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-18 21:53:00,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-18 21:53:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:00,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:00,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:00,564 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 1 times [2019-12-18 21:53:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105619299] [2019-12-18 21:53:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:01,115 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-18 21:53:01,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105619299] [2019-12-18 21:53:01,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:01,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 21:53:01,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251754187] [2019-12-18 21:53:01,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 21:53:01,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 21:53:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:53:01,117 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 19 states. [2019-12-18 21:53:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:02,492 INFO L93 Difference]: Finished difference Result 627 states and 1116 transitions. [2019-12-18 21:53:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:53:02,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 21:53:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:02,493 INFO L225 Difference]: With dead ends: 627 [2019-12-18 21:53:02,494 INFO L226 Difference]: Without dead ends: 595 [2019-12-18 21:53:02,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:53:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-12-18 21:53:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 339. [2019-12-18 21:53:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-18 21:53:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 608 transitions. [2019-12-18 21:53:02,500 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 608 transitions. Word has length 57 [2019-12-18 21:53:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:02,500 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 608 transitions. [2019-12-18 21:53:02,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 21:53:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 608 transitions. [2019-12-18 21:53:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:02,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:02,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:02,502 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -280237799, now seen corresponding path program 2 times [2019-12-18 21:53:02,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:02,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563551792] [2019-12-18 21:53:02,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:02,835 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-18 21:53:02,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563551792] [2019-12-18 21:53:02,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:02,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:53:02,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273820955] [2019-12-18 21:53:02,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:53:02,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:53:02,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:53:02,838 INFO L87 Difference]: Start difference. First operand 339 states and 608 transitions. Second operand 13 states. [2019-12-18 21:53:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:03,488 INFO L93 Difference]: Finished difference Result 545 states and 964 transitions. [2019-12-18 21:53:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:53:03,489 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:53:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:03,490 INFO L225 Difference]: With dead ends: 545 [2019-12-18 21:53:03,490 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 21:53:03,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:53:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 21:53:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 379. [2019-12-18 21:53:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 21:53:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 680 transitions. [2019-12-18 21:53:03,498 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 680 transitions. Word has length 57 [2019-12-18 21:53:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:03,498 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 680 transitions. [2019-12-18 21:53:03,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:53:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 680 transitions. [2019-12-18 21:53:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:03,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:03,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:03,500 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1607584303, now seen corresponding path program 3 times [2019-12-18 21:53:03,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:03,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237172928] [2019-12-18 21:53:03,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:04,267 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-18 21:53:04,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237172928] [2019-12-18 21:53:04,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:04,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 21:53:04,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942138065] [2019-12-18 21:53:04,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 21:53:04,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 21:53:04,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:53:04,269 INFO L87 Difference]: Start difference. First operand 379 states and 680 transitions. Second operand 19 states. [2019-12-18 21:53:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:05,700 INFO L93 Difference]: Finished difference Result 878 states and 1555 transitions. [2019-12-18 21:53:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:53:05,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 21:53:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:05,703 INFO L225 Difference]: With dead ends: 878 [2019-12-18 21:53:05,703 INFO L226 Difference]: Without dead ends: 846 [2019-12-18 21:53:05,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 21:53:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-12-18 21:53:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 413. [2019-12-18 21:53:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-18 21:53:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 744 transitions. [2019-12-18 21:53:05,716 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 744 transitions. Word has length 57 [2019-12-18 21:53:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:05,716 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 744 transitions. [2019-12-18 21:53:05,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 21:53:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 744 transitions. [2019-12-18 21:53:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:05,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:05,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:05,723 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 4 times [2019-12-18 21:53:05,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:05,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334780396] [2019-12-18 21:53:05,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:53:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:53:05,918 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:53:05,918 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:53:05,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1498~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1498~0.base_27|) |v_ULTIMATE.start_main_~#t1498~0.offset_20| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1498~0.base_27|)) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1498~0.base_27| 1)) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= |v_ULTIMATE.start_main_~#t1498~0.offset_20| 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1498~0.base_27| 4) |v_#length_25|) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= v_~y$w_buff1_used~0_63 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1498~0.base_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1499~0.offset=|v_ULTIMATE.start_main_~#t1499~0.offset_20|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1499~0.base=|v_ULTIMATE.start_main_~#t1499~0.base_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_~#t1500~0.offset=|v_ULTIMATE.start_main_~#t1500~0.offset_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t1500~0.base=|v_ULTIMATE.start_main_~#t1500~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1498~0.base=|v_ULTIMATE.start_main_~#t1498~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ULTIMATE.start_main_~#t1498~0.offset=|v_ULTIMATE.start_main_~#t1498~0.offset_20|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t1499~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1499~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1500~0.offset, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1500~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1498~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1498~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:53:05,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t1499~0.offset_11| 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1499~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1499~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1499~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1499~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1499~0.base_13|) |v_ULTIMATE.start_main_~#t1499~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1499~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1499~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1499~0.base=|v_ULTIMATE.start_main_~#t1499~0.base_13|, ULTIMATE.start_main_~#t1499~0.offset=|v_ULTIMATE.start_main_~#t1499~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1499~0.base, ULTIMATE.start_main_~#t1499~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 21:53:05,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1500~0.base_12| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t1500~0.offset_10| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1500~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1500~0.base_12| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1500~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1500~0.base_12|) |v_ULTIMATE.start_main_~#t1500~0.offset_10| 2)) |v_#memory_int_15|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1500~0.base_12| 1) |v_#valid_38|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1500~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1500~0.offset=|v_ULTIMATE.start_main_~#t1500~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1500~0.base=|v_ULTIMATE.start_main_~#t1500~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1500~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1500~0.base] because there is no mapped edge [2019-12-18 21:53:05,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:53:05,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:53:05,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1473287024 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1473287024 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out-1473287024| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1473287024| ~y$w_buff0_used~0_In-1473287024)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1473287024, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1473287024} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1473287024, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1473287024|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1473287024} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:53:05,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1495865104 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1495865104 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1495865104| ~y$w_buff1~0_In-1495865104) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1495865104| ~y~0_In-1495865104)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1495865104, ~y$w_buff1~0=~y$w_buff1~0_In-1495865104, ~y~0=~y~0_In-1495865104, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1495865104} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1495865104, ~y$w_buff1~0=~y$w_buff1~0_In-1495865104, ~y~0=~y~0_In-1495865104, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1495865104|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1495865104} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:53:05,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:53:05,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-858498012 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-858498012 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-858498012| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-858498012 |P1Thread1of1ForFork2_#t~ite5_Out-858498012|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-858498012, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-858498012} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-858498012, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-858498012, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-858498012|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:53:05,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1400372033 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1400372033 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1400372033 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1400372033 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1400372033| ~y$w_buff1_used~0_In-1400372033) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1400372033| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1400372033, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400372033, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1400372033, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400372033} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1400372033, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400372033, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1400372033, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1400372033|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400372033} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:53:05,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1661807909 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1661807909 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1661807909 |P1Thread1of1ForFork2_#t~ite7_Out1661807909|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out1661807909| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1661807909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1661807909} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1661807909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1661807909, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1661807909|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:53:05,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1817828790 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1817828790 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1817828790 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1817828790 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1817828790|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1817828790 |P2Thread1of1ForFork0_#t~ite12_Out1817828790|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1817828790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1817828790, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1817828790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1817828790} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1817828790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1817828790, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1817828790|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1817828790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1817828790} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:53:05,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2139992882 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In2139992882 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2139992882 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In2139992882 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out2139992882| ~y$r_buff1_thd2~0_In2139992882)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out2139992882| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139992882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139992882, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139992882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139992882} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139992882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139992882, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out2139992882|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139992882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139992882} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:53:05,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:53:05,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-89266177 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-89266177 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-89266177 ~y$r_buff0_thd3~0_Out-89266177)) (and (= ~y$r_buff0_thd3~0_Out-89266177 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-89266177, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-89266177} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-89266177, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-89266177, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-89266177|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:53:05,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2090550304 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2090550304 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In2090550304 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2090550304 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out2090550304| ~y$r_buff1_thd3~0_In2090550304) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out2090550304| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2090550304, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2090550304, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2090550304, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2090550304} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out2090550304|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2090550304, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2090550304, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2090550304, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2090550304} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:53:05,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:53:05,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:53:05,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1062076574 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1062076574 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1062076574| ~y~0_In1062076574)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1062076574 |ULTIMATE.start_main_#t~ite18_Out1062076574|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1062076574, ~y~0=~y~0_In1062076574, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1062076574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062076574} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1062076574, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1062076574|, ~y~0=~y~0_In1062076574, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1062076574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062076574} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 21:53:05,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-18 21:53:05,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1163880353 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1163880353 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1163880353| ~y$w_buff0_used~0_In-1163880353)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1163880353| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1163880353, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1163880353} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1163880353, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1163880353, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1163880353|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:53:05,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1005799772 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1005799772 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1005799772 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1005799772 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1005799772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1005799772 |ULTIMATE.start_main_#t~ite21_Out-1005799772|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1005799772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1005799772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1005799772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1005799772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1005799772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1005799772, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1005799772|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1005799772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1005799772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:53:05,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1520838092 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1520838092 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out1520838092|)) (and (= |ULTIMATE.start_main_#t~ite22_Out1520838092| ~y$r_buff0_thd0~0_In1520838092) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1520838092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1520838092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1520838092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1520838092, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1520838092|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:53:05,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In675609345 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In675609345 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In675609345 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In675609345 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out675609345|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In675609345 |ULTIMATE.start_main_#t~ite23_Out675609345|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In675609345, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In675609345, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In675609345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In675609345} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In675609345, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In675609345, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In675609345, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out675609345|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In675609345} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:53:05,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In404273342 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out404273342| ~y$w_buff0~0_In404273342) (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In404273342| |ULTIMATE.start_main_#t~ite29_Out404273342|)) (and (= |ULTIMATE.start_main_#t~ite30_Out404273342| |ULTIMATE.start_main_#t~ite29_Out404273342|) (= ~y$w_buff0~0_In404273342 |ULTIMATE.start_main_#t~ite29_Out404273342|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In404273342 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In404273342 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In404273342 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In404273342 256) 0))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In404273342, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In404273342|, ~y$w_buff0~0=~y$w_buff0~0_In404273342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In404273342, ~weak$$choice2~0=~weak$$choice2~0_In404273342, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In404273342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In404273342} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out404273342|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In404273342, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out404273342|, ~y$w_buff0~0=~y$w_buff0~0_In404273342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In404273342, ~weak$$choice2~0=~weak$$choice2~0_In404273342, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In404273342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In404273342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:53:05,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:53:05,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:53:05,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:53:06,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:53:06 BasicIcfg [2019-12-18 21:53:06,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:53:06,062 INFO L168 Benchmark]: Toolchain (without parser) took 20590.10 ms. Allocated memory was 139.5 MB in the beginning and 895.0 MB in the end (delta: 755.5 MB). Free memory was 101.7 MB in the beginning and 292.1 MB in the end (delta: -190.3 MB). Peak memory consumption was 565.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,062 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.64 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 157.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 154.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,065 INFO L168 Benchmark]: Boogie Preprocessor took 39.15 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,066 INFO L168 Benchmark]: RCFGBuilder took 841.78 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 105.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,067 INFO L168 Benchmark]: TraceAbstraction took 18860.49 ms. Allocated memory was 203.4 MB in the beginning and 895.0 MB in the end (delta: 691.5 MB). Free memory was 105.2 MB in the beginning and 292.1 MB in the end (delta: -186.9 MB). Peak memory consumption was 504.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:06,070 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.48 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.64 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 157.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 154.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.15 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.78 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 105.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18860.49 ms. Allocated memory was 203.4 MB in the beginning and 895.0 MB in the end (delta: 691.5 MB). Free memory was 105.2 MB in the beginning and 292.1 MB in the end (delta: -186.9 MB). Peak memory consumption was 504.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1446 SDtfs, 1555 SDslu, 4020 SDs, 0 SdLazy, 3218 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4425 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 633 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 149513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...