/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:47:38,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:47:38,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:47:38,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:47:38,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:47:38,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:47:38,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:47:38,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:47:38,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:47:38,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:47:38,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:47:38,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:47:38,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:47:38,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:47:38,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:47:38,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:47:38,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:47:38,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:47:38,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:47:38,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:47:38,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:47:38,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:47:38,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:47:38,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:47:38,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:47:38,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:47:38,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:47:38,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:47:38,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:47:38,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:47:38,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:47:38,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:47:38,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:47:38,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:47:38,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:47:38,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:47:38,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:47:38,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:47:38,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:47:38,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:47:38,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:47:38,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:47:38,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:47:38,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:47:38,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:47:38,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:47:38,361 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:47:38,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:47:38,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:47:38,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:47:38,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:47:38,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:47:38,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:47:38,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:47:38,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:47:38,363 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:47:38,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:47:38,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:47:38,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:47:38,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:47:38,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:47:38,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:47:38,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:47:38,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:47:38,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:47:38,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:47:38,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:47:38,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:47:38,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:47:38,366 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:47:38,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:47:38,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:47:38,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:47:38,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:47:38,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:47:38,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:47:38,662 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:47:38,664 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-27 05:47:38,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4874ec0e9/6c9d5e1f808240af8142b366bf7bcec9/FLAG2d4a9af5d [2019-12-27 05:47:39,314 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:47:39,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-27 05:47:39,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4874ec0e9/6c9d5e1f808240af8142b366bf7bcec9/FLAG2d4a9af5d [2019-12-27 05:47:39,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4874ec0e9/6c9d5e1f808240af8142b366bf7bcec9 [2019-12-27 05:47:39,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:47:39,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:47:39,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:47:39,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:47:39,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:47:39,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:47:39" (1/1) ... [2019-12-27 05:47:39,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:39, skipping insertion in model container [2019-12-27 05:47:39,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:47:39" (1/1) ... [2019-12-27 05:47:39,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:47:39,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:47:40,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:47:40,134 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:47:40,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:47:40,295 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:47:40,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40 WrapperNode [2019-12-27 05:47:40,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:47:40,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:47:40,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:47:40,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:47:40,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:47:40,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:47:40,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:47:40,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:47:40,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (1/1) ... [2019-12-27 05:47:40,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:47:40,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:47:40,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:47:40,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:47:40,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (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 05:47:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:47:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:47:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:47:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:47:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:47:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:47:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:47:40,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:47:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:47:40,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:47:40,487 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 05:47:40,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 05:47:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:47:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:47:40,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:47:40,490 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 05:47:41,226 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:47:41,227 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:47:41,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:47:41 BoogieIcfgContainer [2019-12-27 05:47:41,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:47:41,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:47:41,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:47:41,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:47:41,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:47:39" (1/3) ... [2019-12-27 05:47:41,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f11e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:47:41, skipping insertion in model container [2019-12-27 05:47:41,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:40" (2/3) ... [2019-12-27 05:47:41,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f11e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:47:41, skipping insertion in model container [2019-12-27 05:47:41,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:47:41" (3/3) ... [2019-12-27 05:47:41,237 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2019-12-27 05:47:41,247 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:47:41,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:47:41,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:47:41,256 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:47:41,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,303 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,326 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,326 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,326 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,327 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,352 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,352 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,361 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,362 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,362 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,363 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,372 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,376 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,377 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:41,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 05:47:41,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:47:41,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:47:41,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:47:41,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:47:41,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:47:41,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:47:41,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:47:41,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:47:41,431 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 05:47:41,433 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 05:47:41,540 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 05:47:41,541 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:47:41,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 05:47:41,585 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 05:47:41,644 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 05:47:41,644 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:47:41,653 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 05:47:41,675 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 05:47:41,676 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:47:44,862 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-27 05:47:45,756 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 05:47:45,905 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 05:47:45,921 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68763 [2019-12-27 05:47:45,922 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 05:47:45,926 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 94 transitions [2019-12-27 05:48:20,842 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 166438 states. [2019-12-27 05:48:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 166438 states. [2019-12-27 05:48:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 05:48:20,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:48:20,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:48:20,852 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:48:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:48:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash 404581936, now seen corresponding path program 1 times [2019-12-27 05:48:20,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:48:20,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506493400] [2019-12-27 05:48:20,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:48:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:48:21,193 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 05:48:21,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506493400] [2019-12-27 05:48:21,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:48:21,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:48:21,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280868852] [2019-12-27 05:48:21,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:48:21,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:48:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:48:21,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:48:21,217 INFO L87 Difference]: Start difference. First operand 166438 states. Second operand 3 states. [2019-12-27 05:48:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:48:27,498 INFO L93 Difference]: Finished difference Result 163218 states and 783804 transitions. [2019-12-27 05:48:27,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:48:27,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 05:48:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:48:28,532 INFO L225 Difference]: With dead ends: 163218 [2019-12-27 05:48:28,532 INFO L226 Difference]: Without dead ends: 153026 [2019-12-27 05:48:28,533 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 05:48:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153026 states. [2019-12-27 05:48:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153026 to 153026. [2019-12-27 05:48:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153026 states. [2019-12-27 05:48:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153026 states to 153026 states and 733880 transitions. [2019-12-27 05:48:40,932 INFO L78 Accepts]: Start accepts. Automaton has 153026 states and 733880 transitions. Word has length 7 [2019-12-27 05:48:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:48:40,933 INFO L462 AbstractCegarLoop]: Abstraction has 153026 states and 733880 transitions. [2019-12-27 05:48:40,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:48:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 153026 states and 733880 transitions. [2019-12-27 05:48:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:48:40,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:48:40,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:48:40,945 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:48:40,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:48:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1448601888, now seen corresponding path program 1 times [2019-12-27 05:48:40,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:48:40,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366391267] [2019-12-27 05:48:40,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:48:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:48:41,014 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 05:48:41,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366391267] [2019-12-27 05:48:41,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:48:41,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:48:41,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631378965] [2019-12-27 05:48:41,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:48:41,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:48:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:48:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:48:41,018 INFO L87 Difference]: Start difference. First operand 153026 states and 733880 transitions. Second operand 3 states. [2019-12-27 05:48:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:48:47,623 INFO L93 Difference]: Finished difference Result 96841 states and 419275 transitions. [2019-12-27 05:48:47,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:48:47,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 05:48:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:48:47,948 INFO L225 Difference]: With dead ends: 96841 [2019-12-27 05:48:47,948 INFO L226 Difference]: Without dead ends: 96841 [2019-12-27 05:48:47,949 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 05:48:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96841 states. [2019-12-27 05:48:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96841 to 96841. [2019-12-27 05:48:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96841 states. [2019-12-27 05:48:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96841 states to 96841 states and 419275 transitions. [2019-12-27 05:48:52,741 INFO L78 Accepts]: Start accepts. Automaton has 96841 states and 419275 transitions. Word has length 15 [2019-12-27 05:48:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:48:52,742 INFO L462 AbstractCegarLoop]: Abstraction has 96841 states and 419275 transitions. [2019-12-27 05:48:52,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:48:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 96841 states and 419275 transitions. [2019-12-27 05:48:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:48:52,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:48:52,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:48:52,745 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:48:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:48:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 576667599, now seen corresponding path program 1 times [2019-12-27 05:48:52,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:48:52,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358725963] [2019-12-27 05:48:52,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:48:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:48:52,826 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 05:48:52,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358725963] [2019-12-27 05:48:52,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:48:52,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:48:52,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594236551] [2019-12-27 05:48:52,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:48:52,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:48:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:48:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:48:52,829 INFO L87 Difference]: Start difference. First operand 96841 states and 419275 transitions. Second operand 4 states. [2019-12-27 05:48:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:48:54,706 INFO L93 Difference]: Finished difference Result 146922 states and 610245 transitions. [2019-12-27 05:48:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:48:54,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 05:48:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:48:55,247 INFO L225 Difference]: With dead ends: 146922 [2019-12-27 05:48:55,247 INFO L226 Difference]: Without dead ends: 146817 [2019-12-27 05:48:55,247 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 05:48:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146817 states. [2019-12-27 05:49:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146817 to 132421. [2019-12-27 05:49:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132421 states. [2019-12-27 05:49:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132421 states to 132421 states and 557528 transitions. [2019-12-27 05:49:07,998 INFO L78 Accepts]: Start accepts. Automaton has 132421 states and 557528 transitions. Word has length 15 [2019-12-27 05:49:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:07,998 INFO L462 AbstractCegarLoop]: Abstraction has 132421 states and 557528 transitions. [2019-12-27 05:49:07,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:49:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 132421 states and 557528 transitions. [2019-12-27 05:49:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:49:08,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:08,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:08,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1043569302, now seen corresponding path program 1 times [2019-12-27 05:49:08,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:08,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072459288] [2019-12-27 05:49:08,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:08,076 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 05:49:08,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072459288] [2019-12-27 05:49:08,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:08,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:49:08,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959928581] [2019-12-27 05:49:08,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:49:08,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:08,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:49:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:49:08,079 INFO L87 Difference]: Start difference. First operand 132421 states and 557528 transitions. Second operand 4 states. [2019-12-27 05:49:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:08,275 INFO L93 Difference]: Finished difference Result 36987 states and 132370 transitions. [2019-12-27 05:49:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:49:08,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:49:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:08,361 INFO L225 Difference]: With dead ends: 36987 [2019-12-27 05:49:08,361 INFO L226 Difference]: Without dead ends: 36987 [2019-12-27 05:49:08,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:49:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36987 states. [2019-12-27 05:49:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36987 to 36987. [2019-12-27 05:49:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36987 states. [2019-12-27 05:49:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36987 states to 36987 states and 132370 transitions. [2019-12-27 05:49:13,687 INFO L78 Accepts]: Start accepts. Automaton has 36987 states and 132370 transitions. Word has length 16 [2019-12-27 05:49:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:13,688 INFO L462 AbstractCegarLoop]: Abstraction has 36987 states and 132370 transitions. [2019-12-27 05:49:13,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:49:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36987 states and 132370 transitions. [2019-12-27 05:49:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:49:13,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:13,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:13,691 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 372623930, now seen corresponding path program 1 times [2019-12-27 05:49:13,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:13,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665161832] [2019-12-27 05:49:13,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:13,806 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 05:49:13,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665161832] [2019-12-27 05:49:13,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:13,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:49:13,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219681869] [2019-12-27 05:49:13,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:49:13,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:13,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:49:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:49:13,808 INFO L87 Difference]: Start difference. First operand 36987 states and 132370 transitions. Second operand 5 states. [2019-12-27 05:49:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:14,285 INFO L93 Difference]: Finished difference Result 54351 states and 190541 transitions. [2019-12-27 05:49:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:49:14,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:49:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:14,392 INFO L225 Difference]: With dead ends: 54351 [2019-12-27 05:49:14,392 INFO L226 Difference]: Without dead ends: 54333 [2019-12-27 05:49:14,392 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 05:49:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54333 states. [2019-12-27 05:49:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54333 to 42478. [2019-12-27 05:49:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42478 states. [2019-12-27 05:49:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42478 states to 42478 states and 151468 transitions. [2019-12-27 05:49:15,256 INFO L78 Accepts]: Start accepts. Automaton has 42478 states and 151468 transitions. Word has length 16 [2019-12-27 05:49:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:15,256 INFO L462 AbstractCegarLoop]: Abstraction has 42478 states and 151468 transitions. [2019-12-27 05:49:15,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:49:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 42478 states and 151468 transitions. [2019-12-27 05:49:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 05:49:15,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:15,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:15,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash -351800871, now seen corresponding path program 1 times [2019-12-27 05:49:15,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:15,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771423321] [2019-12-27 05:49:15,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:15,719 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-27 05:49:15,738 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 05:49:15,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771423321] [2019-12-27 05:49:15,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:15,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:49:15,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301981921] [2019-12-27 05:49:15,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:49:15,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:49:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:49:15,741 INFO L87 Difference]: Start difference. First operand 42478 states and 151468 transitions. Second operand 6 states. [2019-12-27 05:49:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:16,686 INFO L93 Difference]: Finished difference Result 63900 states and 221523 transitions. [2019-12-27 05:49:16,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:49:16,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 05:49:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:16,817 INFO L225 Difference]: With dead ends: 63900 [2019-12-27 05:49:16,817 INFO L226 Difference]: Without dead ends: 63870 [2019-12-27 05:49:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:49:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-27 05:49:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 42427. [2019-12-27 05:49:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42427 states. [2019-12-27 05:49:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42427 states to 42427 states and 150408 transitions. [2019-12-27 05:49:17,747 INFO L78 Accepts]: Start accepts. Automaton has 42427 states and 150408 transitions. Word has length 24 [2019-12-27 05:49:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:17,747 INFO L462 AbstractCegarLoop]: Abstraction has 42427 states and 150408 transitions. [2019-12-27 05:49:17,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:49:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 42427 states and 150408 transitions. [2019-12-27 05:49:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:49:17,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:17,769 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 05:49:17,770 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash -478348385, now seen corresponding path program 1 times [2019-12-27 05:49:17,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:17,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136784836] [2019-12-27 05:49:17,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:17,843 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 05:49:17,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136784836] [2019-12-27 05:49:17,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:17,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:49:17,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607637417] [2019-12-27 05:49:17,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:49:17,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:49:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:49:17,845 INFO L87 Difference]: Start difference. First operand 42427 states and 150408 transitions. Second operand 5 states. [2019-12-27 05:49:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:17,985 INFO L93 Difference]: Finished difference Result 22700 states and 81312 transitions. [2019-12-27 05:49:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:49:17,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:49:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:18,046 INFO L225 Difference]: With dead ends: 22700 [2019-12-27 05:49:18,047 INFO L226 Difference]: Without dead ends: 22700 [2019-12-27 05:49:18,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:49:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22700 states. [2019-12-27 05:49:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22700 to 22364. [2019-12-27 05:49:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22364 states. [2019-12-27 05:49:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22364 states to 22364 states and 80168 transitions. [2019-12-27 05:49:18,820 INFO L78 Accepts]: Start accepts. Automaton has 22364 states and 80168 transitions. Word has length 28 [2019-12-27 05:49:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:18,821 INFO L462 AbstractCegarLoop]: Abstraction has 22364 states and 80168 transitions. [2019-12-27 05:49:18,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:49:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 22364 states and 80168 transitions. [2019-12-27 05:49:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:49:18,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:18,859 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] [2019-12-27 05:49:18,859 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -89817491, now seen corresponding path program 1 times [2019-12-27 05:49:18,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:18,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617786854] [2019-12-27 05:49:18,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:18,943 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 05:49:18,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617786854] [2019-12-27 05:49:18,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:18,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:49:18,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064295118] [2019-12-27 05:49:18,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:49:18,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:49:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:49:18,945 INFO L87 Difference]: Start difference. First operand 22364 states and 80168 transitions. Second operand 3 states. [2019-12-27 05:49:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:19,071 INFO L93 Difference]: Finished difference Result 33735 states and 115366 transitions. [2019-12-27 05:49:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:49:19,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 05:49:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:19,111 INFO L225 Difference]: With dead ends: 33735 [2019-12-27 05:49:19,112 INFO L226 Difference]: Without dead ends: 22811 [2019-12-27 05:49:19,112 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 05:49:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22811 states. [2019-12-27 05:49:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22811 to 22329. [2019-12-27 05:49:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22329 states. [2019-12-27 05:49:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22329 states to 22329 states and 69880 transitions. [2019-12-27 05:49:19,469 INFO L78 Accepts]: Start accepts. Automaton has 22329 states and 69880 transitions. Word has length 42 [2019-12-27 05:49:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:19,469 INFO L462 AbstractCegarLoop]: Abstraction has 22329 states and 69880 transitions. [2019-12-27 05:49:19,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:49:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 22329 states and 69880 transitions. [2019-12-27 05:49:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 05:49:19,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:19,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:19,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:19,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1643728433, now seen corresponding path program 1 times [2019-12-27 05:49:19,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:19,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198951665] [2019-12-27 05:49:19,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:19,585 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 05:49:19,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198951665] [2019-12-27 05:49:19,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:19,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:49:19,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986435956] [2019-12-27 05:49:19,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:49:19,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:19,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:49:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:49:19,588 INFO L87 Difference]: Start difference. First operand 22329 states and 69880 transitions. Second operand 6 states. [2019-12-27 05:49:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:19,714 INFO L93 Difference]: Finished difference Result 21070 states and 66665 transitions. [2019-12-27 05:49:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:49:19,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 05:49:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:19,731 INFO L225 Difference]: With dead ends: 21070 [2019-12-27 05:49:19,731 INFO L226 Difference]: Without dead ends: 10890 [2019-12-27 05:49:19,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:49:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-12-27 05:49:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10414. [2019-12-27 05:49:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-27 05:49:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 32808 transitions. [2019-12-27 05:49:19,911 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 32808 transitions. Word has length 43 [2019-12-27 05:49:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:19,912 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 32808 transitions. [2019-12-27 05:49:19,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:49:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 32808 transitions. [2019-12-27 05:49:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:19,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:19,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:19,925 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash -400777059, now seen corresponding path program 1 times [2019-12-27 05:49:19,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:19,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051612066] [2019-12-27 05:49:19,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:20,005 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 05:49:20,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051612066] [2019-12-27 05:49:20,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:20,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:49:20,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115552352] [2019-12-27 05:49:20,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:49:20,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:20,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:49:20,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:49:20,009 INFO L87 Difference]: Start difference. First operand 10414 states and 32808 transitions. Second operand 4 states. [2019-12-27 05:49:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:20,107 INFO L93 Difference]: Finished difference Result 18914 states and 59584 transitions. [2019-12-27 05:49:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:49:20,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 05:49:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:20,127 INFO L225 Difference]: With dead ends: 18914 [2019-12-27 05:49:20,128 INFO L226 Difference]: Without dead ends: 8811 [2019-12-27 05:49:20,128 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 05:49:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8811 states. [2019-12-27 05:49:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8811 to 8811. [2019-12-27 05:49:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-27 05:49:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 27635 transitions. [2019-12-27 05:49:20,349 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 27635 transitions. Word has length 57 [2019-12-27 05:49:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:20,349 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 27635 transitions. [2019-12-27 05:49:20,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:49:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 27635 transitions. [2019-12-27 05:49:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:20,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:20,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:49:20,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2006827895, now seen corresponding path program 2 times [2019-12-27 05:49:20,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:20,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074316796] [2019-12-27 05:49:20,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:20,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 05:49:20,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074316796] [2019-12-27 05:49:20,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:20,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:49:20,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48871022] [2019-12-27 05:49:20,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:49:20,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:49:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:49:20,503 INFO L87 Difference]: Start difference. First operand 8811 states and 27635 transitions. Second operand 7 states. [2019-12-27 05:49:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:21,052 INFO L93 Difference]: Finished difference Result 23195 states and 72754 transitions. [2019-12-27 05:49:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:49:21,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 05:49:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:21,079 INFO L225 Difference]: With dead ends: 23195 [2019-12-27 05:49:21,079 INFO L226 Difference]: Without dead ends: 17949 [2019-12-27 05:49:21,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:49:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17949 states. [2019-12-27 05:49:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17949 to 10607. [2019-12-27 05:49:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10607 states. [2019-12-27 05:49:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 33546 transitions. [2019-12-27 05:49:21,290 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 33546 transitions. Word has length 57 [2019-12-27 05:49:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:21,291 INFO L462 AbstractCegarLoop]: Abstraction has 10607 states and 33546 transitions. [2019-12-27 05:49:21,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:49:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 33546 transitions. [2019-12-27 05:49:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:21,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:21,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:21,302 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash 716545355, now seen corresponding path program 3 times [2019-12-27 05:49:21,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:21,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823935027] [2019-12-27 05:49:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:21,417 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 05:49:21,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823935027] [2019-12-27 05:49:21,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:21,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:49:21,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132472445] [2019-12-27 05:49:21,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:49:21,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:49:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:49:21,420 INFO L87 Difference]: Start difference. First operand 10607 states and 33546 transitions. Second operand 8 states. [2019-12-27 05:49:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:22,473 INFO L93 Difference]: Finished difference Result 44112 states and 139302 transitions. [2019-12-27 05:49:22,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:49:22,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 05:49:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:22,526 INFO L225 Difference]: With dead ends: 44112 [2019-12-27 05:49:22,527 INFO L226 Difference]: Without dead ends: 31559 [2019-12-27 05:49:22,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:49:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31559 states. [2019-12-27 05:49:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31559 to 13319. [2019-12-27 05:49:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13319 states. [2019-12-27 05:49:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 42674 transitions. [2019-12-27 05:49:22,879 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 42674 transitions. Word has length 57 [2019-12-27 05:49:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:22,879 INFO L462 AbstractCegarLoop]: Abstraction has 13319 states and 42674 transitions. [2019-12-27 05:49:22,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:49:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 42674 transitions. [2019-12-27 05:49:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:22,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:22,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:22,896 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash -747821109, now seen corresponding path program 1 times [2019-12-27 05:49:22,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:22,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730882816] [2019-12-27 05:49:22,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:22,954 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 05:49:22,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730882816] [2019-12-27 05:49:22,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:22,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:49:22,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758920374] [2019-12-27 05:49:22,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:49:22,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:49:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:49:22,956 INFO L87 Difference]: Start difference. First operand 13319 states and 42674 transitions. Second operand 3 states. [2019-12-27 05:49:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:23,065 INFO L93 Difference]: Finished difference Result 18060 states and 57175 transitions. [2019-12-27 05:49:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:49:23,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 05:49:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:23,100 INFO L225 Difference]: With dead ends: 18060 [2019-12-27 05:49:23,100 INFO L226 Difference]: Without dead ends: 18060 [2019-12-27 05:49:23,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:49:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2019-12-27 05:49:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 15832. [2019-12-27 05:49:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15832 states. [2019-12-27 05:49:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15832 states to 15832 states and 50778 transitions. [2019-12-27 05:49:23,409 INFO L78 Accepts]: Start accepts. Automaton has 15832 states and 50778 transitions. Word has length 57 [2019-12-27 05:49:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:23,410 INFO L462 AbstractCegarLoop]: Abstraction has 15832 states and 50778 transitions. [2019-12-27 05:49:23,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:49:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 15832 states and 50778 transitions. [2019-12-27 05:49:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:23,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:23,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:23,436 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -780825525, now seen corresponding path program 4 times [2019-12-27 05:49:23,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:23,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519027529] [2019-12-27 05:49:23,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:23,546 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 05:49:23,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519027529] [2019-12-27 05:49:23,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:23,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:49:23,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66148932] [2019-12-27 05:49:23,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:49:23,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:49:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:49:23,550 INFO L87 Difference]: Start difference. First operand 15832 states and 50778 transitions. Second operand 9 states. [2019-12-27 05:49:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:25,121 INFO L93 Difference]: Finished difference Result 60662 states and 186954 transitions. [2019-12-27 05:49:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:49:25,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 05:49:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:25,211 INFO L225 Difference]: With dead ends: 60662 [2019-12-27 05:49:25,211 INFO L226 Difference]: Without dead ends: 56362 [2019-12-27 05:49:25,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:49:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56362 states. [2019-12-27 05:49:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56362 to 16687. [2019-12-27 05:49:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16687 states. [2019-12-27 05:49:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16687 states to 16687 states and 53640 transitions. [2019-12-27 05:49:25,756 INFO L78 Accepts]: Start accepts. Automaton has 16687 states and 53640 transitions. Word has length 57 [2019-12-27 05:49:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:25,757 INFO L462 AbstractCegarLoop]: Abstraction has 16687 states and 53640 transitions. [2019-12-27 05:49:25,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:49:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 16687 states and 53640 transitions. [2019-12-27 05:49:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:25,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:25,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:25,775 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1562304933, now seen corresponding path program 5 times [2019-12-27 05:49:25,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:25,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160958733] [2019-12-27 05:49:25,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:25,892 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 05:49:25,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160958733] [2019-12-27 05:49:25,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:25,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:49:25,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078812080] [2019-12-27 05:49:25,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:49:25,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:49:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:49:25,893 INFO L87 Difference]: Start difference. First operand 16687 states and 53640 transitions. Second operand 9 states. [2019-12-27 05:49:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:27,199 INFO L93 Difference]: Finished difference Result 48042 states and 147444 transitions. [2019-12-27 05:49:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:49:27,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 05:49:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:27,260 INFO L225 Difference]: With dead ends: 48042 [2019-12-27 05:49:27,260 INFO L226 Difference]: Without dead ends: 41776 [2019-12-27 05:49:27,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:49:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41776 states. [2019-12-27 05:49:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41776 to 15886. [2019-12-27 05:49:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-12-27 05:49:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 51044 transitions. [2019-12-27 05:49:27,722 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 51044 transitions. Word has length 57 [2019-12-27 05:49:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:27,722 INFO L462 AbstractCegarLoop]: Abstraction has 15886 states and 51044 transitions. [2019-12-27 05:49:27,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:49:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 51044 transitions. [2019-12-27 05:49:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:27,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:27,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:27,740 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -414013221, now seen corresponding path program 6 times [2019-12-27 05:49:27,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:27,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065219980] [2019-12-27 05:49:27,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:27,837 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 05:49:27,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065219980] [2019-12-27 05:49:27,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:27,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:49:27,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251218303] [2019-12-27 05:49:27,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:49:27,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:49:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:49:27,842 INFO L87 Difference]: Start difference. First operand 15886 states and 51044 transitions. Second operand 7 states. [2019-12-27 05:49:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:28,270 INFO L93 Difference]: Finished difference Result 32290 states and 101146 transitions. [2019-12-27 05:49:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:49:28,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 05:49:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:28,333 INFO L225 Difference]: With dead ends: 32290 [2019-12-27 05:49:28,333 INFO L226 Difference]: Without dead ends: 27252 [2019-12-27 05:49:28,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:49:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27252 states. [2019-12-27 05:49:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27252 to 16096. [2019-12-27 05:49:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-27 05:49:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 51631 transitions. [2019-12-27 05:49:29,166 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 51631 transitions. Word has length 57 [2019-12-27 05:49:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:29,166 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 51631 transitions. [2019-12-27 05:49:29,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:49:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 51631 transitions. [2019-12-27 05:49:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:29,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:29,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:29,198 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1111165587, now seen corresponding path program 7 times [2019-12-27 05:49:29,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:29,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783565140] [2019-12-27 05:49:29,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:29,285 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 05:49:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783565140] [2019-12-27 05:49:29,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:29,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:49:29,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788845153] [2019-12-27 05:49:29,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:49:29,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:49:29,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:49:29,288 INFO L87 Difference]: Start difference. First operand 16096 states and 51631 transitions. Second operand 5 states. [2019-12-27 05:49:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:29,789 INFO L93 Difference]: Finished difference Result 24102 states and 75006 transitions. [2019-12-27 05:49:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:49:29,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 05:49:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:29,828 INFO L225 Difference]: With dead ends: 24102 [2019-12-27 05:49:29,828 INFO L226 Difference]: Without dead ends: 23976 [2019-12-27 05:49:29,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:49:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23976 states. [2019-12-27 05:49:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23976 to 19024. [2019-12-27 05:49:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19024 states. [2019-12-27 05:49:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19024 states to 19024 states and 60429 transitions. [2019-12-27 05:49:30,163 INFO L78 Accepts]: Start accepts. Automaton has 19024 states and 60429 transitions. Word has length 57 [2019-12-27 05:49:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:30,164 INFO L462 AbstractCegarLoop]: Abstraction has 19024 states and 60429 transitions. [2019-12-27 05:49:30,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:49:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19024 states and 60429 transitions. [2019-12-27 05:49:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:30,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:30,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:30,186 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1189678611, now seen corresponding path program 8 times [2019-12-27 05:49:30,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:30,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211653102] [2019-12-27 05:49:30,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:30,280 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 05:49:30,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211653102] [2019-12-27 05:49:30,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:30,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:49:30,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478223150] [2019-12-27 05:49:30,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:49:30,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:30,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:49:30,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:49:30,285 INFO L87 Difference]: Start difference. First operand 19024 states and 60429 transitions. Second operand 5 states. [2019-12-27 05:49:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:30,790 INFO L93 Difference]: Finished difference Result 25682 states and 80014 transitions. [2019-12-27 05:49:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:49:30,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 05:49:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:30,829 INFO L225 Difference]: With dead ends: 25682 [2019-12-27 05:49:30,829 INFO L226 Difference]: Without dead ends: 25499 [2019-12-27 05:49:30,829 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 05:49:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25499 states. [2019-12-27 05:49:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25499 to 22650. [2019-12-27 05:49:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22650 states. [2019-12-27 05:49:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22650 states to 22650 states and 71520 transitions. [2019-12-27 05:49:31,207 INFO L78 Accepts]: Start accepts. Automaton has 22650 states and 71520 transitions. Word has length 57 [2019-12-27 05:49:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:31,208 INFO L462 AbstractCegarLoop]: Abstraction has 22650 states and 71520 transitions. [2019-12-27 05:49:31,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:49:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 22650 states and 71520 transitions. [2019-12-27 05:49:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:31,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:31,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:31,236 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1103228865, now seen corresponding path program 9 times [2019-12-27 05:49:31,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:31,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402465650] [2019-12-27 05:49:31,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:31,343 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 05:49:31,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402465650] [2019-12-27 05:49:31,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:31,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:49:31,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109852234] [2019-12-27 05:49:31,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:49:31,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:49:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:49:31,345 INFO L87 Difference]: Start difference. First operand 22650 states and 71520 transitions. Second operand 6 states. [2019-12-27 05:49:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:32,226 INFO L93 Difference]: Finished difference Result 28892 states and 89312 transitions. [2019-12-27 05:49:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:49:32,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 05:49:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:32,287 INFO L225 Difference]: With dead ends: 28892 [2019-12-27 05:49:32,287 INFO L226 Difference]: Without dead ends: 28703 [2019-12-27 05:49:32,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:49:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28703 states. [2019-12-27 05:49:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28703 to 23678. [2019-12-27 05:49:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23678 states. [2019-12-27 05:49:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23678 states to 23678 states and 74490 transitions. [2019-12-27 05:49:33,047 INFO L78 Accepts]: Start accepts. Automaton has 23678 states and 74490 transitions. Word has length 57 [2019-12-27 05:49:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 23678 states and 74490 transitions. [2019-12-27 05:49:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:49:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23678 states and 74490 transitions. [2019-12-27 05:49:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:33,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:33,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:33,089 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1047376819, now seen corresponding path program 10 times [2019-12-27 05:49:33,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:33,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764513086] [2019-12-27 05:49:33,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:33,253 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 05:49:33,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764513086] [2019-12-27 05:49:33,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:33,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:49:33,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505196857] [2019-12-27 05:49:33,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:49:33,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:33,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:49:33,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:49:33,255 INFO L87 Difference]: Start difference. First operand 23678 states and 74490 transitions. Second operand 10 states. [2019-12-27 05:49:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:34,957 INFO L93 Difference]: Finished difference Result 35794 states and 108163 transitions. [2019-12-27 05:49:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:49:34,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 05:49:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:35,010 INFO L225 Difference]: With dead ends: 35794 [2019-12-27 05:49:35,010 INFO L226 Difference]: Without dead ends: 35612 [2019-12-27 05:49:35,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:49:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35612 states. [2019-12-27 05:49:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35612 to 23637. [2019-12-27 05:49:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23637 states. [2019-12-27 05:49:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23637 states to 23637 states and 72959 transitions. [2019-12-27 05:49:35,515 INFO L78 Accepts]: Start accepts. Automaton has 23637 states and 72959 transitions. Word has length 57 [2019-12-27 05:49:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:35,515 INFO L462 AbstractCegarLoop]: Abstraction has 23637 states and 72959 transitions. [2019-12-27 05:49:35,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:49:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23637 states and 72959 transitions. [2019-12-27 05:49:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:35,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:35,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:35,543 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2105231561, now seen corresponding path program 11 times [2019-12-27 05:49:35,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:35,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779791536] [2019-12-27 05:49:35,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:35,673 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 05:49:35,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779791536] [2019-12-27 05:49:35,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:35,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:49:35,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670052792] [2019-12-27 05:49:35,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:49:35,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:49:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:49:35,675 INFO L87 Difference]: Start difference. First operand 23637 states and 72959 transitions. Second operand 9 states. [2019-12-27 05:49:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:37,535 INFO L93 Difference]: Finished difference Result 33879 states and 101490 transitions. [2019-12-27 05:49:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:49:37,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 05:49:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:37,583 INFO L225 Difference]: With dead ends: 33879 [2019-12-27 05:49:37,583 INFO L226 Difference]: Without dead ends: 33879 [2019-12-27 05:49:37,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:49:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33879 states. [2019-12-27 05:49:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33879 to 22356. [2019-12-27 05:49:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22356 states. [2019-12-27 05:49:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22356 states to 22356 states and 69036 transitions. [2019-12-27 05:49:38,276 INFO L78 Accepts]: Start accepts. Automaton has 22356 states and 69036 transitions. Word has length 57 [2019-12-27 05:49:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:38,276 INFO L462 AbstractCegarLoop]: Abstraction has 22356 states and 69036 transitions. [2019-12-27 05:49:38,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:49:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22356 states and 69036 transitions. [2019-12-27 05:49:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:38,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:38,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:38,299 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -87684039, now seen corresponding path program 12 times [2019-12-27 05:49:38,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:38,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851221551] [2019-12-27 05:49:38,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:38,391 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 05:49:38,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851221551] [2019-12-27 05:49:38,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:38,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:49:38,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909063247] [2019-12-27 05:49:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:49:38,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:49:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:49:38,395 INFO L87 Difference]: Start difference. First operand 22356 states and 69036 transitions. Second operand 8 states. [2019-12-27 05:49:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:39,506 INFO L93 Difference]: Finished difference Result 39184 states and 118203 transitions. [2019-12-27 05:49:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:49:39,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 05:49:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:39,563 INFO L225 Difference]: With dead ends: 39184 [2019-12-27 05:49:39,564 INFO L226 Difference]: Without dead ends: 39086 [2019-12-27 05:49:39,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:49:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39086 states. [2019-12-27 05:49:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39086 to 21993. [2019-12-27 05:49:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21993 states. [2019-12-27 05:49:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21993 states to 21993 states and 67832 transitions. [2019-12-27 05:49:40,043 INFO L78 Accepts]: Start accepts. Automaton has 21993 states and 67832 transitions. Word has length 57 [2019-12-27 05:49:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:40,043 INFO L462 AbstractCegarLoop]: Abstraction has 21993 states and 67832 transitions. [2019-12-27 05:49:40,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:49:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21993 states and 67832 transitions. [2019-12-27 05:49:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 05:49:40,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:40,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:40,067 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash 769055305, now seen corresponding path program 13 times [2019-12-27 05:49:40,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:40,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653328318] [2019-12-27 05:49:40,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:40,129 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 05:49:40,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653328318] [2019-12-27 05:49:40,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:40,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:49:40,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182646257] [2019-12-27 05:49:40,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:49:40,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:49:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:49:40,131 INFO L87 Difference]: Start difference. First operand 21993 states and 67832 transitions. Second operand 3 states. [2019-12-27 05:49:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:40,207 INFO L93 Difference]: Finished difference Result 16833 states and 51662 transitions. [2019-12-27 05:49:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:49:40,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 05:49:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:40,238 INFO L225 Difference]: With dead ends: 16833 [2019-12-27 05:49:40,238 INFO L226 Difference]: Without dead ends: 16833 [2019-12-27 05:49:40,238 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 05:49:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16833 states. [2019-12-27 05:49:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16833 to 16497. [2019-12-27 05:49:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16497 states. [2019-12-27 05:49:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16497 states to 16497 states and 50632 transitions. [2019-12-27 05:49:40,488 INFO L78 Accepts]: Start accepts. Automaton has 16497 states and 50632 transitions. Word has length 57 [2019-12-27 05:49:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:40,488 INFO L462 AbstractCegarLoop]: Abstraction has 16497 states and 50632 transitions. [2019-12-27 05:49:40,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:49:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 16497 states and 50632 transitions. [2019-12-27 05:49:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 05:49:40,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:40,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:40,505 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:40,505 INFO L82 PathProgramCache]: Analyzing trace with hash 375662312, now seen corresponding path program 1 times [2019-12-27 05:49:40,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:40,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921892929] [2019-12-27 05:49:40,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:49:40,554 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 05:49:40,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921892929] [2019-12-27 05:49:40,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:49:40,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:49:40,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338427144] [2019-12-27 05:49:40,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:49:40,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:49:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:49:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:49:40,556 INFO L87 Difference]: Start difference. First operand 16497 states and 50632 transitions. Second operand 3 states. [2019-12-27 05:49:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:49:40,629 INFO L93 Difference]: Finished difference Result 16497 states and 50630 transitions. [2019-12-27 05:49:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:49:40,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 05:49:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:49:40,660 INFO L225 Difference]: With dead ends: 16497 [2019-12-27 05:49:40,661 INFO L226 Difference]: Without dead ends: 16497 [2019-12-27 05:49:40,661 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 05:49:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-27 05:49:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 15043. [2019-12-27 05:49:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15043 states. [2019-12-27 05:49:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 46622 transitions. [2019-12-27 05:49:40,960 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 46622 transitions. Word has length 58 [2019-12-27 05:49:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:49:40,960 INFO L462 AbstractCegarLoop]: Abstraction has 15043 states and 46622 transitions. [2019-12-27 05:49:40,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:49:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 46622 transitions. [2019-12-27 05:49:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:49:40,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:49:40,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:49:40,977 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:49:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:49:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548287, now seen corresponding path program 1 times [2019-12-27 05:49:40,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:49:40,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898213191] [2019-12-27 05:49:40,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:49:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:49:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:49:41,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:49:41,107 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:49:41,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t605~0.offset_20|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (= v_~y~0_23 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t605~0.base_27|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 v_~y$w_buff1~0_24) (= (store .cse0 |v_ULTIMATE.start_main_~#t605~0.base_27| 1) |v_#valid_71|) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_71 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t605~0.base_27|)) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd3~0_28 0) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t605~0.base_27| 4)) (= v_~x~0_18 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~__unbuffered_p3_EBX~0_15) (= 0 v_~y$w_buff0~0_25) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 v_~y$r_buff1_thd4~0_18) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_27| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_27|) |v_ULTIMATE.start_main_~#t605~0.offset_20| 0)) |v_#memory_int_29|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_27|, ULTIMATE.start_main_~#t605~0.offset=|v_ULTIMATE.start_main_~#t605~0.offset_20|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_20|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_17|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t605~0.base=|v_ULTIMATE.start_main_~#t605~0.base_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_20|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_27|, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t605~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t607~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ULTIMATE.start_main_~#t608~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t605~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t606~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t606~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t608~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:49:41,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t606~0.offset_10|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t606~0.base_12| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t606~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12|) |v_ULTIMATE.start_main_~#t606~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t606~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t606~0.offset, ULTIMATE.start_main_~#t606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:49:41,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L848-1-->L850: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13|) |v_ULTIMATE.start_main_~#t607~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t607~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t607~0.base_13|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t607~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t607~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_13|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t607~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:49:41,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd3~0_17 1) (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_46 v_~y$r_buff1_thd2~0_26) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_11) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 05:49:41,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L850-1-->L852: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t608~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10|) |v_ULTIMATE.start_main_~#t608~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10|)) (= |v_ULTIMATE.start_main_~#t608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t608~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t608~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_10|, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t608~0.offset, ULTIMATE.start_main_~#t608~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:49:41,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~a~0_6) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:49:41,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In463533007 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In463533007 256)))) (or (and (= ~y$w_buff1~0_In463533007 |P3Thread1of1ForFork0_#t~ite32_Out463533007|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In463533007 |P3Thread1of1ForFork0_#t~ite32_Out463533007|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In463533007, ~y$w_buff1~0=~y$w_buff1~0_In463533007, ~y~0=~y~0_In463533007, ~y$w_buff1_used~0=~y$w_buff1_used~0_In463533007} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In463533007, ~y$w_buff1~0=~y$w_buff1~0_In463533007, ~y~0=~y~0_In463533007, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out463533007|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In463533007} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 05:49:41,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_17 |v_P3Thread1of1ForFork0_#t~ite32_8|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_8|} OutVars{~y~0=v_~y~0_17, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_7|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_7|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 05:49:41,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-500044260 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-500044260 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-500044260|)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out-500044260| ~y$w_buff0_used~0_In-500044260) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-500044260, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-500044260} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-500044260, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-500044260, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-500044260|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 05:49:41,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In764302974 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out764302974| ~y$w_buff0~0_In764302974) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In764302974| |P1Thread1of1ForFork2_#t~ite8_Out764302974|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In764302974 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In764302974 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In764302974 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In764302974 256)))) (= |P1Thread1of1ForFork2_#t~ite8_Out764302974| ~y$w_buff0~0_In764302974) (= |P1Thread1of1ForFork2_#t~ite9_Out764302974| |P1Thread1of1ForFork2_#t~ite8_Out764302974|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In764302974, ~y$w_buff0_used~0=~y$w_buff0_used~0_In764302974, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In764302974|, ~y$w_buff0~0=~y$w_buff0~0_In764302974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In764302974, ~weak$$choice2~0=~weak$$choice2~0_In764302974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In764302974} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In764302974, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out764302974|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In764302974, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out764302974|, ~y$w_buff0~0=~y$w_buff0~0_In764302974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In764302974, ~weak$$choice2~0=~weak$$choice2~0_In764302974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In764302974} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 05:49:41,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1537533854 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-1537533854| |P1Thread1of1ForFork2_#t~ite14_Out-1537533854|) (= ~y$w_buff0_used~0_In-1537533854 |P1Thread1of1ForFork2_#t~ite14_Out-1537533854|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1537533854 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1537533854 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1537533854 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1537533854 256)) .cse0))) .cse1) (and (= ~y$w_buff0_used~0_In-1537533854 |P1Thread1of1ForFork2_#t~ite15_Out-1537533854|) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite14_In-1537533854| |P1Thread1of1ForFork2_#t~ite14_Out-1537533854|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1537533854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1537533854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1537533854, ~weak$$choice2~0=~weak$$choice2~0_In-1537533854, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1537533854|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1537533854} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1537533854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1537533854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1537533854, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1537533854|, ~weak$$choice2~0=~weak$$choice2~0_In-1537533854, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1537533854|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1537533854} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 05:49:41,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff0_thd2~0_56) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 05:49:41,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L769-->L769-8: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-2044505109 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-2044505109 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2044505109 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2044505109 256) 0)) (.cse5 (= |P1Thread1of1ForFork2_#t~ite24_Out-2044505109| |P1Thread1of1ForFork2_#t~ite23_Out-2044505109|)) (.cse4 (= (mod ~weak$$choice2~0_In-2044505109 256) 0))) (or (let ((.cse1 (not .cse6))) (and (not .cse0) (or .cse1 (not .cse2)) (or .cse1 (not .cse3)) (= |P1Thread1of1ForFork2_#t~ite22_Out-2044505109| |P1Thread1of1ForFork2_#t~ite23_Out-2044505109|) .cse4 (= |P1Thread1of1ForFork2_#t~ite22_Out-2044505109| 0) .cse5)) (and (or (and (= ~y$r_buff1_thd2~0_In-2044505109 |P1Thread1of1ForFork2_#t~ite23_Out-2044505109|) (or (and .cse2 .cse6) (and .cse6 .cse3) .cse0) .cse4 .cse5) (and (not .cse4) (= |P1Thread1of1ForFork2_#t~ite23_In-2044505109| |P1Thread1of1ForFork2_#t~ite23_Out-2044505109|) (= |P1Thread1of1ForFork2_#t~ite24_Out-2044505109| ~y$r_buff1_thd2~0_In-2044505109))) (= |P1Thread1of1ForFork2_#t~ite22_In-2044505109| |P1Thread1of1ForFork2_#t~ite22_Out-2044505109|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2044505109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2044505109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2044505109, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_In-2044505109|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-2044505109|, ~weak$$choice2~0=~weak$$choice2~0_In-2044505109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2044505109} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2044505109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2044505109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2044505109, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_Out-2044505109|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-2044505109|, ~weak$$choice2~0=~weak$$choice2~0_In-2044505109, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-2044505109|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2044505109} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite22, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 05:49:41,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In-1002797458 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1002797458 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1002797458 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-1002797458 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite35_Out-1002797458| ~y$w_buff1_used~0_In-1002797458)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-1002797458|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1002797458, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1002797458, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1002797458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1002797458} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1002797458, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1002797458, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1002797458, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1002797458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1002797458} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 05:49:41,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 05:49:41,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1906166664 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1906166664 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1906166664 |P2Thread1of1ForFork3_#t~ite28_Out-1906166664|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1906166664|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906166664, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1906166664} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906166664, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1906166664, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1906166664|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 05:49:41,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1698430879 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1698430879 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1698430879 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1698430879 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1698430879 |P2Thread1of1ForFork3_#t~ite29_Out-1698430879|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1698430879|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1698430879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698430879, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1698430879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698430879} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1698430879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698430879, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1698430879, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1698430879|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698430879} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 05:49:41,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-88199484 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-88199484 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-88199484 ~y$r_buff0_thd3~0_Out-88199484)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-88199484 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-88199484, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-88199484} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-88199484|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-88199484, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-88199484} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 05:49:41,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2007070453 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-2007070453 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2007070453 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-2007070453 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-2007070453 |P2Thread1of1ForFork3_#t~ite31_Out-2007070453|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-2007070453|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2007070453, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007070453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2007070453, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007070453} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2007070453, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007070453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2007070453, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-2007070453|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007070453} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 05:49:41,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_16)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 05:49:41,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1172476487 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1172476487 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out1172476487| ~y$r_buff0_thd4~0_In1172476487) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1172476487| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1172476487, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1172476487} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1172476487, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1172476487, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1172476487|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 05:49:41,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-263889274 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-263889274 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-263889274 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In-263889274 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-263889274| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out-263889274| ~y$r_buff1_thd4~0_In-263889274)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-263889274, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-263889274, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-263889274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-263889274} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-263889274, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-263889274, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-263889274, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-263889274|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-263889274} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 05:49:41,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L827-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:49:41,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:49:41,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In311550866 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In311550866 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite43_Out311550866| |ULTIMATE.start_main_#t~ite42_Out311550866|))) (or (and (not .cse0) (= ~y$w_buff1~0_In311550866 |ULTIMATE.start_main_#t~ite42_Out311550866|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~y~0_In311550866 |ULTIMATE.start_main_#t~ite42_Out311550866|) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In311550866, ~y~0=~y~0_In311550866, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In311550866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In311550866} OutVars{~y$w_buff1~0=~y$w_buff1~0_In311550866, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out311550866|, ~y~0=~y~0_In311550866, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out311550866|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In311550866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In311550866} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:49:41,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In707898043 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In707898043 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out707898043|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out707898043| ~y$w_buff0_used~0_In707898043)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In707898043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In707898043} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In707898043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In707898043, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out707898043|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:49:41,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-72789785 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-72789785 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-72789785 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-72789785 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-72789785| ~y$w_buff1_used~0_In-72789785) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-72789785|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-72789785, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-72789785, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-72789785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-72789785} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-72789785, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-72789785, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-72789785, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-72789785|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-72789785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:49:41,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1934745653 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1934745653 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1934745653 |ULTIMATE.start_main_#t~ite46_Out-1934745653|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1934745653|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934745653, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1934745653} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1934745653, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1934745653, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1934745653|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 05:49:41,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In443878647 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In443878647 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In443878647 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In443878647 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out443878647| 0)) (and (= ~y$r_buff1_thd0~0_In443878647 |ULTIMATE.start_main_#t~ite47_Out443878647|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In443878647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In443878647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In443878647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443878647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In443878647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In443878647, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out443878647|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In443878647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443878647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:49:41,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_11 2) (= 2 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 2 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_13| v_~y$r_buff1_thd0~0_17) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:49:41,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:49:41 BasicIcfg [2019-12-27 05:49:41,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:49:41,280 INFO L168 Benchmark]: Toolchain (without parser) took 121697.64 ms. Allocated memory was 143.7 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.7 MB in the beginning and 1.1 GB in the end (delta: -995.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,281 INFO L168 Benchmark]: CDTParser took 1.68 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.62 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.2 MB in the beginning and 153.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.34 ms. Allocated memory is still 200.8 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,289 INFO L168 Benchmark]: Boogie Preprocessor took 54.10 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,290 INFO L168 Benchmark]: RCFGBuilder took 819.27 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 99.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,293 INFO L168 Benchmark]: TraceAbstraction took 120048.28 ms. Allocated memory was 200.8 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.9 MB in the beginning and 1.1 GB in the end (delta: -996.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:49:41,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.68 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.62 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.2 MB in the beginning and 153.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.34 ms. Allocated memory is still 200.8 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.10 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.27 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 99.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120048.28 ms. Allocated memory was 200.8 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.9 MB in the beginning and 1.1 GB in the end (delta: -996.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 7815 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68763 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L852] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 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) [L764] 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)) [L765] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 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)) [L766] 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)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 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)) [L769] 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)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 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 [L861] 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 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4651 SDtfs, 6753 SDslu, 12651 SDs, 0 SdLazy, 7864 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 59 SyntacticMatches, 16 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166438occurred 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: 44.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 208726 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1121 NumberOfCodeBlocks, 1121 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1038 ConstructedInterpolants, 0 QuantifiedInterpolants, 163072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...