/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:50:19,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:50:19,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:50:19,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:50:19,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:50:19,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:50:19,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:50:19,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:50:19,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:50:19,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:50:19,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:50:19,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:50:19,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:50:19,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:50:19,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:50:19,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:50:19,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:50:19,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:50:19,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:50:19,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:50:19,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:50:19,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:50:19,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:50:19,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:50:19,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:50:19,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:50:19,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:50:19,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:50:19,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:50:19,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:50:19,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:50:19,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:50:19,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:50:19,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:50:19,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:50:19,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:50:19,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:50:19,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:50:19,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:50:19,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:50:19,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:50:19,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:50:19,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:50:19,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:50:19,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:50:19,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:50:19,272 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:50:19,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:50:19,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:50:19,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:50:19,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:50:19,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:50:19,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:50:19,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:50:19,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:50:19,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:50:19,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:50:19,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:50:19,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:50:19,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:50:19,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:50:19,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:50:19,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:50:19,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:50:19,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:50:19,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:50:19,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:50:19,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:50:19,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:50:19,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:50:19,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:50:19,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:50:19,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:50:19,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:50:19,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:50:19,556 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:50:19,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-27 01:50:19,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308b2f394/9bfa1c019ebd497c9bc1c69b2da05b6d/FLAG83c9fa269 [2019-12-27 01:50:20,230 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:50:20,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-27 01:50:20,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308b2f394/9bfa1c019ebd497c9bc1c69b2da05b6d/FLAG83c9fa269 [2019-12-27 01:50:20,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308b2f394/9bfa1c019ebd497c9bc1c69b2da05b6d [2019-12-27 01:50:20,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:50:20,469 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:50:20,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:50:20,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:50:20,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:50:20,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:50:20" (1/1) ... [2019-12-27 01:50:20,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b0946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:20, skipping insertion in model container [2019-12-27 01:50:20,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:50:20" (1/1) ... [2019-12-27 01:50:20,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:50:20,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:50:21,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:50:21,076 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:50:21,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:50:21,232 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:50:21,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21 WrapperNode [2019-12-27 01:50:21,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:50:21,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:50:21,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:50:21,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:50:21,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:50:21,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:50:21,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:50:21,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:50:21,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... [2019-12-27 01:50:21,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:50:21,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:50:21,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:50:21,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:50:21,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:50:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:50:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:50:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:50:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:50:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:50:21,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:50:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:50:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:50:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:50:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:50:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:50:21,417 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:50:22,160 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:50:22,161 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:50:22,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:50:22 BoogieIcfgContainer [2019-12-27 01:50:22,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:50:22,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:50:22,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:50:22,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:50:22,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:50:20" (1/3) ... [2019-12-27 01:50:22,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9b7e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:50:22, skipping insertion in model container [2019-12-27 01:50:22,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:21" (2/3) ... [2019-12-27 01:50:22,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9b7e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:50:22, skipping insertion in model container [2019-12-27 01:50:22,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:50:22" (3/3) ... [2019-12-27 01:50:22,171 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-12-27 01:50:22,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:50:22,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:50:22,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:50:22,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:50:22,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,251 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:22,329 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:50:22,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:50:22,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:50:22,348 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:50:22,348 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:50:22,348 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:50:22,348 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:50:22,348 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:50:22,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:50:22,365 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 01:50:22,367 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 01:50:22,453 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 01:50:22,454 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:50:22,468 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:50:22,487 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 01:50:22,533 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 01:50:22,533 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:50:22,539 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:50:22,554 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 01:50:22,555 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:50:27,628 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 01:50:27,806 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-27 01:50:27,806 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 01:50:27,812 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-27 01:50:28,349 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 01:50:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 01:50:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:50:28,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:28,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:50:28,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-27 01:50:28,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:28,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724468556] [2019-12-27 01:50:28,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:28,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724468556] [2019-12-27 01:50:28,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:28,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:50:28,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484558416] [2019-12-27 01:50:28,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:28,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:28,601 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 01:50:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:28,856 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-27 01:50:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:28,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:50:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:28,938 INFO L225 Difference]: With dead ends: 8468 [2019-12-27 01:50:28,939 INFO L226 Difference]: Without dead ends: 7976 [2019-12-27 01:50:28,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-27 01:50:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-27 01:50:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-27 01:50:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-27 01:50:29,449 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-27 01:50:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:29,450 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-27 01:50:29,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-27 01:50:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:50:29,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:29,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:29,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:29,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-27 01:50:29,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:29,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966991208] [2019-12-27 01:50:29,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:29,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966991208] [2019-12-27 01:50:29,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:29,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:50:29,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508745933] [2019-12-27 01:50:29,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:50:29,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:50:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:29,581 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-27 01:50:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:29,642 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-27 01:50:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:50:29,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:50:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:29,652 INFO L225 Difference]: With dead ends: 1834 [2019-12-27 01:50:29,652 INFO L226 Difference]: Without dead ends: 1342 [2019-12-27 01:50:29,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-27 01:50:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-27 01:50:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-27 01:50:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-27 01:50:29,702 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-27 01:50:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:29,703 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-27 01:50:29,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:50:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-27 01:50:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:50:29,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:29,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:29,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-27 01:50:29,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:29,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249661252] [2019-12-27 01:50:29,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:29,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249661252] [2019-12-27 01:50:29,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:29,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:29,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176849380] [2019-12-27 01:50:29,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:50:29,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:29,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:50:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:29,877 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-27 01:50:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:30,087 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-27 01:50:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:50:30,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:50:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:30,097 INFO L225 Difference]: With dead ends: 1673 [2019-12-27 01:50:30,097 INFO L226 Difference]: Without dead ends: 1673 [2019-12-27 01:50:30,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-27 01:50:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-27 01:50:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-27 01:50:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-27 01:50:30,136 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-27 01:50:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:30,137 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-27 01:50:30,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:50:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-27 01:50:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:50:30,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:30,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:30,140 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-27 01:50:30,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:30,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101892873] [2019-12-27 01:50:30,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:30,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101892873] [2019-12-27 01:50:30,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:30,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:50:30,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113136465] [2019-12-27 01:50:30,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:50:30,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:50:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:50:30,290 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-27 01:50:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:30,992 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-27 01:50:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:50:30,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 01:50:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:31,017 INFO L225 Difference]: With dead ends: 4481 [2019-12-27 01:50:31,018 INFO L226 Difference]: Without dead ends: 4446 [2019-12-27 01:50:31,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:50:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-27 01:50:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-27 01:50:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-27 01:50:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-27 01:50:31,175 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-27 01:50:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:31,176 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-27 01:50:31,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:50:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-27 01:50:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:50:31,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:31,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:31,180 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-27 01:50:31,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:31,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195750483] [2019-12-27 01:50:31,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:31,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195750483] [2019-12-27 01:50:31,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:31,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:50:31,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649562831] [2019-12-27 01:50:31,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:31,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:31,292 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 3 states. [2019-12-27 01:50:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:31,311 INFO L93 Difference]: Finished difference Result 2168 states and 4907 transitions. [2019-12-27 01:50:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:31,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 01:50:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:31,323 INFO L225 Difference]: With dead ends: 2168 [2019-12-27 01:50:31,324 INFO L226 Difference]: Without dead ends: 2168 [2019-12-27 01:50:31,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-12-27 01:50:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2019-12-27 01:50:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-27 01:50:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-27 01:50:31,369 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 26 [2019-12-27 01:50:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:31,370 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-27 01:50:31,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-27 01:50:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:50:31,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:31,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:31,373 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-27 01:50:31,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:31,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645831708] [2019-12-27 01:50:31,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:31,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645831708] [2019-12-27 01:50:31,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:31,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:50:31,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238351602] [2019-12-27 01:50:31,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:50:31,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:50:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:50:31,495 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-27 01:50:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:31,598 INFO L93 Difference]: Finished difference Result 3175 states and 6989 transitions. [2019-12-27 01:50:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:50:31,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 01:50:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:31,608 INFO L225 Difference]: With dead ends: 3175 [2019-12-27 01:50:31,609 INFO L226 Difference]: Without dead ends: 3175 [2019-12-27 01:50:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2019-12-27 01:50:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2232. [2019-12-27 01:50:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-12-27 01:50:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 4979 transitions. [2019-12-27 01:50:31,664 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 4979 transitions. Word has length 26 [2019-12-27 01:50:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:31,665 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 4979 transitions. [2019-12-27 01:50:31,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:50:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 4979 transitions. [2019-12-27 01:50:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:50:31,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:31,668 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] [2019-12-27 01:50:31,668 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-27 01:50:31,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:31,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701203610] [2019-12-27 01:50:31,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:31,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701203610] [2019-12-27 01:50:31,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:31,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:31,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483344512] [2019-12-27 01:50:31,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:31,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:31,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:31,718 INFO L87 Difference]: Start difference. First operand 2232 states and 4979 transitions. Second operand 3 states. [2019-12-27 01:50:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:31,743 INFO L93 Difference]: Finished difference Result 3498 states and 7914 transitions. [2019-12-27 01:50:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:31,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:50:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:31,749 INFO L225 Difference]: With dead ends: 3498 [2019-12-27 01:50:31,749 INFO L226 Difference]: Without dead ends: 1625 [2019-12-27 01:50:31,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-12-27 01:50:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1605. [2019-12-27 01:50:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-12-27 01:50:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 3571 transitions. [2019-12-27 01:50:31,783 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 3571 transitions. Word has length 27 [2019-12-27 01:50:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:31,783 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 3571 transitions. [2019-12-27 01:50:31,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 3571 transitions. [2019-12-27 01:50:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:50:31,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:31,786 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] [2019-12-27 01:50:31,786 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-27 01:50:31,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:31,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554473942] [2019-12-27 01:50:31,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:31,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554473942] [2019-12-27 01:50:31,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:31,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:50:31,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132213950] [2019-12-27 01:50:31,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:50:31,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:31,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:50:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:31,864 INFO L87 Difference]: Start difference. First operand 1605 states and 3571 transitions. Second operand 5 states. [2019-12-27 01:50:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:32,326 INFO L93 Difference]: Finished difference Result 2492 states and 5414 transitions. [2019-12-27 01:50:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:50:32,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:50:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:32,333 INFO L225 Difference]: With dead ends: 2492 [2019-12-27 01:50:32,333 INFO L226 Difference]: Without dead ends: 2492 [2019-12-27 01:50:32,334 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-27 01:50:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2019-12-27 01:50:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2281. [2019-12-27 01:50:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-12-27 01:50:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5003 transitions. [2019-12-27 01:50:32,383 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5003 transitions. Word has length 27 [2019-12-27 01:50:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:32,384 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 5003 transitions. [2019-12-27 01:50:32,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:50:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5003 transitions. [2019-12-27 01:50:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:50:32,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:32,388 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] [2019-12-27 01:50:32,388 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1981838884, now seen corresponding path program 1 times [2019-12-27 01:50:32,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:32,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678292795] [2019-12-27 01:50:32,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:32,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678292795] [2019-12-27 01:50:32,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:32,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:50:32,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848018009] [2019-12-27 01:50:32,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:50:32,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:50:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:50:32,503 INFO L87 Difference]: Start difference. First operand 2281 states and 5003 transitions. Second operand 6 states. [2019-12-27 01:50:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:33,119 INFO L93 Difference]: Finished difference Result 4123 states and 8675 transitions. [2019-12-27 01:50:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:50:33,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:50:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:33,142 INFO L225 Difference]: With dead ends: 4123 [2019-12-27 01:50:33,142 INFO L226 Difference]: Without dead ends: 4094 [2019-12-27 01:50:33,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:50:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2019-12-27 01:50:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 2534. [2019-12-27 01:50:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-27 01:50:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 5513 transitions. [2019-12-27 01:50:33,208 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 5513 transitions. Word has length 27 [2019-12-27 01:50:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:33,209 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 5513 transitions. [2019-12-27 01:50:33,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:50:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 5513 transitions. [2019-12-27 01:50:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:50:33,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:33,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:33,213 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:33,214 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-27 01:50:33,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:33,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443120693] [2019-12-27 01:50:33,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:33,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443120693] [2019-12-27 01:50:33,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:33,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:50:33,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483970028] [2019-12-27 01:50:33,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:50:33,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:50:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:33,332 INFO L87 Difference]: Start difference. First operand 2534 states and 5513 transitions. Second operand 5 states. [2019-12-27 01:50:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:33,384 INFO L93 Difference]: Finished difference Result 1557 states and 3200 transitions. [2019-12-27 01:50:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:50:33,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:50:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:33,387 INFO L225 Difference]: With dead ends: 1557 [2019-12-27 01:50:33,387 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 01:50:33,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 01:50:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1205. [2019-12-27 01:50:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-12-27 01:50:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2552 transitions. [2019-12-27 01:50:33,412 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2552 transitions. Word has length 28 [2019-12-27 01:50:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:33,412 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 2552 transitions. [2019-12-27 01:50:33,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:50:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2552 transitions. [2019-12-27 01:50:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:50:33,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:33,417 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] [2019-12-27 01:50:33,417 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-27 01:50:33,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:33,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753428880] [2019-12-27 01:50:33,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:33,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753428880] [2019-12-27 01:50:33,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:33,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:50:33,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574546946] [2019-12-27 01:50:33,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:50:33,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:33,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:50:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:33,556 INFO L87 Difference]: Start difference. First operand 1205 states and 2552 transitions. Second operand 7 states. [2019-12-27 01:50:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:33,740 INFO L93 Difference]: Finished difference Result 2141 states and 4422 transitions. [2019-12-27 01:50:33,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:50:33,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 01:50:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:33,746 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 01:50:33,746 INFO L226 Difference]: Without dead ends: 1428 [2019-12-27 01:50:33,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:50:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-27 01:50:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1210. [2019-12-27 01:50:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-27 01:50:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2537 transitions. [2019-12-27 01:50:33,795 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2537 transitions. Word has length 51 [2019-12-27 01:50:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:33,796 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 2537 transitions. [2019-12-27 01:50:33,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:50:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2537 transitions. [2019-12-27 01:50:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:50:33,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:33,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:33,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-27 01:50:33,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:33,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68224132] [2019-12-27 01:50:33,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:33,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68224132] [2019-12-27 01:50:33,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:33,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:50:33,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999842575] [2019-12-27 01:50:33,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:50:33,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:50:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:50:33,942 INFO L87 Difference]: Start difference. First operand 1210 states and 2537 transitions. Second operand 7 states. [2019-12-27 01:50:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:35,130 INFO L93 Difference]: Finished difference Result 2002 states and 4090 transitions. [2019-12-27 01:50:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:50:35,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 01:50:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:35,136 INFO L225 Difference]: With dead ends: 2002 [2019-12-27 01:50:35,136 INFO L226 Difference]: Without dead ends: 2002 [2019-12-27 01:50:35,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:50:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-12-27 01:50:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1222. [2019-12-27 01:50:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 01:50:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2571 transitions. [2019-12-27 01:50:35,166 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2571 transitions. Word has length 51 [2019-12-27 01:50:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:35,166 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2571 transitions. [2019-12-27 01:50:35,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:50:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2571 transitions. [2019-12-27 01:50:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:50:35,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:35,170 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] [2019-12-27 01:50:35,170 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1259363204, now seen corresponding path program 3 times [2019-12-27 01:50:35,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:35,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310447635] [2019-12-27 01:50:35,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:35,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310447635] [2019-12-27 01:50:35,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:35,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:50:35,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930081004] [2019-12-27 01:50:35,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:50:35,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:35,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:50:35,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:50:35,293 INFO L87 Difference]: Start difference. First operand 1222 states and 2571 transitions. Second operand 5 states. [2019-12-27 01:50:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:35,541 INFO L93 Difference]: Finished difference Result 1351 states and 2804 transitions. [2019-12-27 01:50:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:50:35,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 01:50:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:35,544 INFO L225 Difference]: With dead ends: 1351 [2019-12-27 01:50:35,545 INFO L226 Difference]: Without dead ends: 1351 [2019-12-27 01:50:35,547 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-27 01:50:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-12-27 01:50:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1230. [2019-12-27 01:50:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 01:50:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2588 transitions. [2019-12-27 01:50:35,574 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2588 transitions. Word has length 51 [2019-12-27 01:50:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:35,574 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2588 transitions. [2019-12-27 01:50:35,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:50:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2588 transitions. [2019-12-27 01:50:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:50:35,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:35,578 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] [2019-12-27 01:50:35,578 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash -878142292, now seen corresponding path program 4 times [2019-12-27 01:50:35,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:35,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219505504] [2019-12-27 01:50:35,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:35,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219505504] [2019-12-27 01:50:35,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:35,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:50:35,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971890203] [2019-12-27 01:50:35,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:50:35,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:50:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:35,703 INFO L87 Difference]: Start difference. First operand 1230 states and 2588 transitions. Second operand 3 states. [2019-12-27 01:50:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:35,718 INFO L93 Difference]: Finished difference Result 1229 states and 2586 transitions. [2019-12-27 01:50:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:35,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 01:50:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:35,721 INFO L225 Difference]: With dead ends: 1229 [2019-12-27 01:50:35,722 INFO L226 Difference]: Without dead ends: 1229 [2019-12-27 01:50:35,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:50:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-27 01:50:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1044. [2019-12-27 01:50:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-12-27 01:50:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2239 transitions. [2019-12-27 01:50:35,743 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2239 transitions. Word has length 51 [2019-12-27 01:50:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:35,745 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 2239 transitions. [2019-12-27 01:50:35,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:50:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2239 transitions. [2019-12-27 01:50:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 01:50:35,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:35,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:35,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 1 times [2019-12-27 01:50:35,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:35,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145221725] [2019-12-27 01:50:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:50:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:50:35,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145221725] [2019-12-27 01:50:35,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:50:35,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:50:35,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700475690] [2019-12-27 01:50:35,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:50:35,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:50:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:50:35,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:35,849 INFO L87 Difference]: Start difference. First operand 1044 states and 2239 transitions. Second operand 4 states. [2019-12-27 01:50:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:50:35,912 INFO L93 Difference]: Finished difference Result 1184 states and 2515 transitions. [2019-12-27 01:50:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:50:35,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 01:50:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:50:35,915 INFO L225 Difference]: With dead ends: 1184 [2019-12-27 01:50:35,916 INFO L226 Difference]: Without dead ends: 1184 [2019-12-27 01:50:35,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:50:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-27 01:50:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1000. [2019-12-27 01:50:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-27 01:50:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 2133 transitions. [2019-12-27 01:50:35,934 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 2133 transitions. Word has length 52 [2019-12-27 01:50:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:50:35,935 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 2133 transitions. [2019-12-27 01:50:35,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:50:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 2133 transitions. [2019-12-27 01:50:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:50:35,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:50:35,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:50:35,938 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:50:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:50:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-27 01:50:35,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:50:35,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546026742] [2019-12-27 01:50:35,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:50:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:50:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:50:36,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:50:36,082 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:50:36,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29| 1) |v_#valid_52|) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= v_~y$mem_tmp~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29|) 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29|) |v_ULTIMATE.start_main_~#t593~0.offset_20| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_29|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t593~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= |v_ULTIMATE.start_main_~#t593~0.offset_20| 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_20|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:50:36,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 01:50:36,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:50:36,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2045731868 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2045731868 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2045731868 |P0Thread1of1ForFork0_#t~ite5_Out-2045731868|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2045731868|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2045731868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2045731868} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2045731868|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2045731868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2045731868} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 01:50:36,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In190864508 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In190864508 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In190864508 256)) .cse0) (= (mod ~y$w_buff0_used~0_In190864508 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In190864508 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite15_Out190864508| |P1Thread1of1ForFork1_#t~ite14_Out190864508|) (= |P1Thread1of1ForFork1_#t~ite14_Out190864508| ~y$w_buff0~0_In190864508) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out190864508| ~y$w_buff0~0_In190864508) (= |P1Thread1of1ForFork1_#t~ite14_In190864508| |P1Thread1of1ForFork1_#t~ite14_Out190864508|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In190864508, ~y$w_buff0_used~0=~y$w_buff0_used~0_In190864508, ~y$w_buff0~0=~y$w_buff0~0_In190864508, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190864508, ~weak$$choice2~0=~weak$$choice2~0_In190864508, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In190864508|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In190864508} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In190864508, ~y$w_buff0_used~0=~y$w_buff0_used~0_In190864508, ~y$w_buff0~0=~y$w_buff0~0_In190864508, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190864508, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out190864508|, ~weak$$choice2~0=~weak$$choice2~0_In190864508, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out190864508|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In190864508} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 01:50:36,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-712539634 256)))) (or (and (= ~y$w_buff1~0_In-712539634 |P1Thread1of1ForFork1_#t~ite17_Out-712539634|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-712539634 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-712539634 256) 0)) (= (mod ~y$w_buff0_used~0_In-712539634 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-712539634 256))))) (= |P1Thread1of1ForFork1_#t~ite18_Out-712539634| |P1Thread1of1ForFork1_#t~ite17_Out-712539634|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite18_Out-712539634| ~y$w_buff1~0_In-712539634) (= |P1Thread1of1ForFork1_#t~ite17_In-712539634| |P1Thread1of1ForFork1_#t~ite17_Out-712539634|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-712539634, ~y$w_buff1~0=~y$w_buff1~0_In-712539634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-712539634, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-712539634, ~weak$$choice2~0=~weak$$choice2~0_In-712539634, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-712539634|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-712539634} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-712539634, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-712539634|, ~y$w_buff1~0=~y$w_buff1~0_In-712539634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-712539634, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-712539634, ~weak$$choice2~0=~weak$$choice2~0_In-712539634, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-712539634|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-712539634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 01:50:36,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1073835914 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1073835914 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1073835914 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1073835914 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1073835914|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1073835914| ~y$w_buff1_used~0_In-1073835914) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1073835914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073835914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1073835914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073835914} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1073835914|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1073835914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073835914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1073835914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073835914} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 01:50:36,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In913824614 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In913824614 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out913824614 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out913824614 ~y$r_buff0_thd1~0_In913824614) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In913824614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In913824614} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In913824614, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out913824614|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out913824614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:50:36,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-497175791 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-497175791 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-497175791 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-497175791 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-497175791| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-497175791| ~y$r_buff1_thd1~0_In-497175791) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-497175791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-497175791, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-497175791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497175791} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-497175791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-497175791, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-497175791|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-497175791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497175791} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:50:36,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-401875703 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-401875703| |P1Thread1of1ForFork1_#t~ite20_Out-401875703|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-401875703 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-401875703 256)) (and (= (mod ~y$r_buff1_thd2~0_In-401875703 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-401875703 256))))) (= ~y$w_buff0_used~0_In-401875703 |P1Thread1of1ForFork1_#t~ite20_Out-401875703|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out-401875703| ~y$w_buff0_used~0_In-401875703) (= |P1Thread1of1ForFork1_#t~ite20_In-401875703| |P1Thread1of1ForFork1_#t~ite20_Out-401875703|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-401875703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-401875703, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-401875703|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-401875703, ~weak$$choice2~0=~weak$$choice2~0_In-401875703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-401875703} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-401875703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-401875703, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-401875703|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-401875703, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-401875703|, ~weak$$choice2~0=~weak$$choice2~0_In-401875703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-401875703} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 01:50:36,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 01:50:36,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-749138896 256)))) (or (and (= ~y$r_buff1_thd2~0_In-749138896 |P1Thread1of1ForFork1_#t~ite30_Out-749138896|) (= |P1Thread1of1ForFork1_#t~ite29_In-749138896| |P1Thread1of1ForFork1_#t~ite29_Out-749138896|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-749138896 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-749138896 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-749138896 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-749138896 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-749138896| ~y$r_buff1_thd2~0_In-749138896) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-749138896| |P1Thread1of1ForFork1_#t~ite30_Out-749138896|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-749138896, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-749138896|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-749138896, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-749138896, ~weak$$choice2~0=~weak$$choice2~0_In-749138896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-749138896} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-749138896, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-749138896|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-749138896|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-749138896, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-749138896, ~weak$$choice2~0=~weak$$choice2~0_In-749138896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-749138896} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 01:50:36,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:50:36,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 01:50:36,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1107002988 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1107002988 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1107002988| ~y~0_In-1107002988)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1107002988| ~y$w_buff1~0_In-1107002988)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107002988, ~y$w_buff1~0=~y$w_buff1~0_In-1107002988, ~y~0=~y~0_In-1107002988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107002988} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107002988, ~y$w_buff1~0=~y$w_buff1~0_In-1107002988, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1107002988|, ~y~0=~y~0_In-1107002988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107002988} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 01:50:36,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 01:50:36,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2119571770 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2119571770 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out2119571770| ~y$w_buff0_used~0_In2119571770) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2119571770| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2119571770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2119571770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2119571770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2119571770, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2119571770|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:50:36,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1757220330 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1757220330 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1757220330 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1757220330 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1757220330| ~y$w_buff1_used~0_In-1757220330)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1757220330|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1757220330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1757220330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1757220330, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1757220330} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1757220330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1757220330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1757220330, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1757220330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1757220330} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:50:36,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1794044762 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1794044762 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1794044762| ~y$r_buff0_thd2~0_In-1794044762) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1794044762| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1794044762, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1794044762} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1794044762, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1794044762, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1794044762|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:50:36,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2062065771 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2062065771 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2062065771 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2062065771 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-2062065771|)) (and (= ~y$r_buff1_thd2~0_In-2062065771 |P1Thread1of1ForFork1_#t~ite37_Out-2062065771|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2062065771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2062065771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2062065771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2062065771} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2062065771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2062065771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2062065771, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2062065771|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2062065771} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:50:36,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:50:36,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 01:50:36,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1040147446 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1040147446 256) 0))) (or (and (= ~y~0_In-1040147446 |ULTIMATE.start_main_#t~ite40_Out-1040147446|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-1040147446 |ULTIMATE.start_main_#t~ite40_Out-1040147446|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1040147446, ~y~0=~y~0_In-1040147446, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1040147446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1040147446} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1040147446|, ~y$w_buff1~0=~y$w_buff1~0_In-1040147446, ~y~0=~y~0_In-1040147446, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1040147446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1040147446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 01:50:36,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 01:50:36,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1448494405 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1448494405 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1448494405 |ULTIMATE.start_main_#t~ite42_Out-1448494405|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1448494405|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1448494405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1448494405} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1448494405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1448494405, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1448494405|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:50:36,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-160368390 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-160368390 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-160368390 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-160368390 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-160368390| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-160368390| ~y$w_buff1_used~0_In-160368390)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-160368390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-160368390, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-160368390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160368390} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-160368390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-160368390, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-160368390|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-160368390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160368390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:50:36,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1551973486 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1551973486 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1551973486| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1551973486| ~y$r_buff0_thd0~0_In-1551973486)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1551973486, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1551973486} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1551973486, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1551973486, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1551973486|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:50:36,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1580127717 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1580127717 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1580127717 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1580127717 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1580127717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out1580127717| ~y$r_buff1_thd0~0_In1580127717) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1580127717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580127717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580127717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580127717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1580127717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580127717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580127717, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1580127717|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580127717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:50:36,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:50:36,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:50:36 BasicIcfg [2019-12-27 01:50:36,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:50:36,203 INFO L168 Benchmark]: Toolchain (without parser) took 15732.10 ms. Allocated memory was 137.4 MB in the beginning and 492.8 MB in the end (delta: 355.5 MB). Free memory was 99.6 MB in the beginning and 144.5 MB in the end (delta: -44.9 MB). Peak memory consumption was 310.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,203 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.76 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.4 MB in the beginning and 155.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.86 ms. Allocated memory is still 200.8 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,210 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,211 INFO L168 Benchmark]: RCFGBuilder took 813.27 ms. Allocated memory is still 200.8 MB. Free memory was 150.6 MB in the beginning and 106.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,214 INFO L168 Benchmark]: TraceAbstraction took 14035.64 ms. Allocated memory was 200.8 MB in the beginning and 492.8 MB in the end (delta: 292.0 MB). Free memory was 105.9 MB in the beginning and 144.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 253.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:50:36,222 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.76 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.4 MB in the beginning and 155.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.86 ms. Allocated memory is still 200.8 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 200.8 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.27 ms. Allocated memory is still 200.8 MB. Free memory was 150.6 MB in the beginning and 106.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14035.64 ms. Allocated memory was 200.8 MB in the beginning and 492.8 MB in the end (delta: 292.0 MB). Free memory was 105.9 MB in the beginning and 144.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 253.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1878 SDtfs, 2251 SDslu, 3515 SDs, 0 SdLazy, 2443 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 6658 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 84807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...