/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:07:37,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:07:37,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:07:37,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:07:37,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:07:37,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:07:37,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:07:37,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:07:37,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:07:37,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:07:37,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:07:37,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:07:37,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:07:37,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:07:37,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:07:37,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:07:37,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:07:37,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:07:37,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:07:37,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:07:37,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:07:37,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:07:37,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:07:37,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:07:37,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:07:37,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:07:37,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:07:37,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:07:37,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:07:37,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:07:37,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:07:37,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:07:37,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:07:37,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:07:37,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:07:37,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:07:37,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:07:37,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:07:37,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:07:37,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:07:37,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:07:37,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:07:37,196 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:07:37,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:07:37,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:07:37,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:07:37,200 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:07:37,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:07:37,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:07:37,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:07:37,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:07:37,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:07:37,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:07:37,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:07:37,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:07:37,202 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:07:37,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:07:37,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:07:37,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:07:37,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:07:37,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:07:37,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:07:37,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:07:37,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:07:37,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:07:37,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:07:37,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:07:37,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:07:37,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:07:37,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:07:37,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:07:37,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:07:37,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:07:37,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:07:37,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:07:37,487 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:07:37,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-27 02:07:37,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea20ed4d/fb2c3b6aa725403e8566bd02f6ab84f9/FLAG0c9cb303e [2019-12-27 02:07:38,179 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:07:38,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-27 02:07:38,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea20ed4d/fb2c3b6aa725403e8566bd02f6ab84f9/FLAG0c9cb303e [2019-12-27 02:07:38,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea20ed4d/fb2c3b6aa725403e8566bd02f6ab84f9 [2019-12-27 02:07:38,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:07:38,438 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:07:38,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:07:38,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:07:38,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:07:38,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:07:38" (1/1) ... [2019-12-27 02:07:38,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664997d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:38, skipping insertion in model container [2019-12-27 02:07:38,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:07:38" (1/1) ... [2019-12-27 02:07:38,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:07:38,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:07:39,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:07:39,139 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:07:39,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:07:39,297 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:07:39,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39 WrapperNode [2019-12-27 02:07:39,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:07:39,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:07:39,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:07:39,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:07:39,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:07:39,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:07:39,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:07:39,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:07:39,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (1/1) ... [2019-12-27 02:07:39,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:07:39,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:07:39,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:07:39,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:07:39,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (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 02:07:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:07:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:07:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:07:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:07:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:07:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:07:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:07:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:07:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:07:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:07:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:07:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:07:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:07:39,489 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 02:07:40,390 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:07:40,391 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:07:40,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:07:40 BoogieIcfgContainer [2019-12-27 02:07:40,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:07:40,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:07:40,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:07:40,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:07:40,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:07:38" (1/3) ... [2019-12-27 02:07:40,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53858e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:07:40, skipping insertion in model container [2019-12-27 02:07:40,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:07:39" (2/3) ... [2019-12-27 02:07:40,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53858e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:07:40, skipping insertion in model container [2019-12-27 02:07:40,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:07:40" (3/3) ... [2019-12-27 02:07:40,400 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2019-12-27 02:07:40,411 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:07:40,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:07:40,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:07:40,419 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:07:40,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,462 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,462 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,481 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,481 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,481 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,481 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:07:40,550 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:07:40,571 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:07:40,572 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:07:40,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:07:40,572 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:07:40,572 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:07:40,572 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:07:40,572 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:07:40,573 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:07:40,590 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-27 02:07:40,592 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 02:07:40,724 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 02:07:40,725 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:07:40,746 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 02:07:40,778 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 02:07:40,845 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 02:07:40,845 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:07:40,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 02:07:40,894 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-27 02:07:40,895 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:07:46,083 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 02:07:46,510 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 02:07:46,665 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:07:46,805 INFO L206 etLargeBlockEncoding]: Checked pairs total: 165402 [2019-12-27 02:07:46,806 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-27 02:07:46,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 143 transitions [2019-12-27 02:07:51,601 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 57466 states. [2019-12-27 02:07:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 57466 states. [2019-12-27 02:07:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:07:51,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:51,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:07:51,610 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:07:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash -953839885, now seen corresponding path program 1 times [2019-12-27 02:07:51,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:51,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274594344] [2019-12-27 02:07:51,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:51,910 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 02:07:51,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274594344] [2019-12-27 02:07:51,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:51,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:07:51,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876539382] [2019-12-27 02:07:51,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:07:51,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:07:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:07:51,935 INFO L87 Difference]: Start difference. First operand 57466 states. Second operand 3 states. [2019-12-27 02:07:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:07:54,378 INFO L93 Difference]: Finished difference Result 57370 states and 231250 transitions. [2019-12-27 02:07:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:07:54,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:07:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:07:54,784 INFO L225 Difference]: With dead ends: 57370 [2019-12-27 02:07:54,784 INFO L226 Difference]: Without dead ends: 56226 [2019-12-27 02:07:54,786 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 02:07:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56226 states. [2019-12-27 02:07:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56226 to 56226. [2019-12-27 02:07:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56226 states. [2019-12-27 02:07:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56226 states to 56226 states and 226882 transitions. [2019-12-27 02:07:57,917 INFO L78 Accepts]: Start accepts. Automaton has 56226 states and 226882 transitions. Word has length 7 [2019-12-27 02:07:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:07:57,918 INFO L462 AbstractCegarLoop]: Abstraction has 56226 states and 226882 transitions. [2019-12-27 02:07:57,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:07:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 56226 states and 226882 transitions. [2019-12-27 02:07:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:07:57,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:07:57,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:07:57,931 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:07:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:07:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash 749632042, now seen corresponding path program 1 times [2019-12-27 02:07:57,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:07:57,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710583997] [2019-12-27 02:07:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:07:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:07:58,124 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 02:07:58,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710583997] [2019-12-27 02:07:58,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:07:58,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:07:58,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580340076] [2019-12-27 02:07:58,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:07:58,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:07:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:07:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:07:58,129 INFO L87 Difference]: Start difference. First operand 56226 states and 226882 transitions. Second operand 4 states. [2019-12-27 02:08:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:00,967 INFO L93 Difference]: Finished difference Result 90514 states and 350820 transitions. [2019-12-27 02:08:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:00,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:08:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:01,304 INFO L225 Difference]: With dead ends: 90514 [2019-12-27 02:08:01,304 INFO L226 Difference]: Without dead ends: 90500 [2019-12-27 02:08:01,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90500 states. [2019-12-27 02:08:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90500 to 87886. [2019-12-27 02:08:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87886 states. [2019-12-27 02:08:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87886 states to 87886 states and 342542 transitions. [2019-12-27 02:08:05,492 INFO L78 Accepts]: Start accepts. Automaton has 87886 states and 342542 transitions. Word has length 13 [2019-12-27 02:08:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:05,492 INFO L462 AbstractCegarLoop]: Abstraction has 87886 states and 342542 transitions. [2019-12-27 02:08:05,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:08:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 87886 states and 342542 transitions. [2019-12-27 02:08:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:08:05,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:05,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:05,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:05,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1969493490, now seen corresponding path program 1 times [2019-12-27 02:08:05,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:05,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440506219] [2019-12-27 02:08:05,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:05,537 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 02:08:05,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440506219] [2019-12-27 02:08:05,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:05,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:05,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16429405] [2019-12-27 02:08:05,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:05,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:05,541 INFO L87 Difference]: Start difference. First operand 87886 states and 342542 transitions. Second operand 3 states. [2019-12-27 02:08:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:05,725 INFO L93 Difference]: Finished difference Result 48011 states and 163167 transitions. [2019-12-27 02:08:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:05,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:08:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:05,825 INFO L225 Difference]: With dead ends: 48011 [2019-12-27 02:08:05,825 INFO L226 Difference]: Without dead ends: 48011 [2019-12-27 02:08:05,825 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 02:08:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48011 states. [2019-12-27 02:08:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48011 to 48011. [2019-12-27 02:08:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-12-27 02:08:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 163167 transitions. [2019-12-27 02:08:10,541 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 163167 transitions. Word has length 13 [2019-12-27 02:08:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:10,541 INFO L462 AbstractCegarLoop]: Abstraction has 48011 states and 163167 transitions. [2019-12-27 02:08:10,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 163167 transitions. [2019-12-27 02:08:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:08:10,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:10,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:10,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:10,543 INFO L82 PathProgramCache]: Analyzing trace with hash 802741009, now seen corresponding path program 1 times [2019-12-27 02:08:10,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:10,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823416284] [2019-12-27 02:08:10,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:10,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823416284] [2019-12-27 02:08:10,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:10,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:08:10,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830736063] [2019-12-27 02:08:10,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:08:10,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:08:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:08:10,595 INFO L87 Difference]: Start difference. First operand 48011 states and 163167 transitions. Second operand 4 states. [2019-12-27 02:08:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:10,643 INFO L93 Difference]: Finished difference Result 5081 states and 12972 transitions. [2019-12-27 02:08:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:08:10,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:08:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:10,656 INFO L225 Difference]: With dead ends: 5081 [2019-12-27 02:08:10,656 INFO L226 Difference]: Without dead ends: 5081 [2019-12-27 02:08:10,656 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 02:08:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-12-27 02:08:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2019-12-27 02:08:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-12-27 02:08:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 12972 transitions. [2019-12-27 02:08:10,745 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 12972 transitions. Word has length 14 [2019-12-27 02:08:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:10,745 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 12972 transitions. [2019-12-27 02:08:10,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:08:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 12972 transitions. [2019-12-27 02:08:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:08:10,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:10,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:10,750 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1593078696, now seen corresponding path program 1 times [2019-12-27 02:08:10,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090081060] [2019-12-27 02:08:10,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:10,860 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 02:08:10,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090081060] [2019-12-27 02:08:10,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:10,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:08:10,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83541826] [2019-12-27 02:08:10,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:10,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:10,863 INFO L87 Difference]: Start difference. First operand 5081 states and 12972 transitions. Second operand 5 states. [2019-12-27 02:08:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:10,893 INFO L93 Difference]: Finished difference Result 1979 states and 5224 transitions. [2019-12-27 02:08:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:10,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:08:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:10,898 INFO L225 Difference]: With dead ends: 1979 [2019-12-27 02:08:10,898 INFO L226 Difference]: Without dead ends: 1979 [2019-12-27 02:08:10,898 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 02:08:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-27 02:08:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1881. [2019-12-27 02:08:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 02:08:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4993 transitions. [2019-12-27 02:08:10,929 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4993 transitions. Word has length 26 [2019-12-27 02:08:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:10,930 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4993 transitions. [2019-12-27 02:08:10,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4993 transitions. [2019-12-27 02:08:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 02:08:10,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:10,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:10,936 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:10,937 INFO L82 PathProgramCache]: Analyzing trace with hash 76160980, now seen corresponding path program 1 times [2019-12-27 02:08:10,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:10,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689206336] [2019-12-27 02:08:10,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:11,088 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 02:08:11,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689206336] [2019-12-27 02:08:11,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:11,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:08:11,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245012869] [2019-12-27 02:08:11,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:11,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:11,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:11,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:11,092 INFO L87 Difference]: Start difference. First operand 1881 states and 4993 transitions. Second operand 5 states. [2019-12-27 02:08:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:11,637 INFO L93 Difference]: Finished difference Result 2818 states and 7401 transitions. [2019-12-27 02:08:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:08:11,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 02:08:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:11,642 INFO L225 Difference]: With dead ends: 2818 [2019-12-27 02:08:11,643 INFO L226 Difference]: Without dead ends: 2818 [2019-12-27 02:08:11,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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 02:08:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-27 02:08:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2057. [2019-12-27 02:08:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-12-27 02:08:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 5485 transitions. [2019-12-27 02:08:11,681 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 5485 transitions. Word has length 71 [2019-12-27 02:08:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:11,681 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 5485 transitions. [2019-12-27 02:08:11,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 5485 transitions. [2019-12-27 02:08:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 02:08:11,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:11,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:11,687 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash -789175518, now seen corresponding path program 2 times [2019-12-27 02:08:11,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:11,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250879161] [2019-12-27 02:08:11,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:11,841 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 02:08:11,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250879161] [2019-12-27 02:08:11,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:11,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:08:11,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785640657] [2019-12-27 02:08:11,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:08:11,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:08:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:11,845 INFO L87 Difference]: Start difference. First operand 2057 states and 5485 transitions. Second operand 7 states. [2019-12-27 02:08:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:12,501 INFO L93 Difference]: Finished difference Result 2346 states and 6185 transitions. [2019-12-27 02:08:12,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:08:12,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-27 02:08:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:12,506 INFO L225 Difference]: With dead ends: 2346 [2019-12-27 02:08:12,507 INFO L226 Difference]: Without dead ends: 2346 [2019-12-27 02:08:12,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:08:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-12-27 02:08:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2127. [2019-12-27 02:08:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-27 02:08:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 5650 transitions. [2019-12-27 02:08:12,530 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 5650 transitions. Word has length 71 [2019-12-27 02:08:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:12,531 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 5650 transitions. [2019-12-27 02:08:12,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:08:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 5650 transitions. [2019-12-27 02:08:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 02:08:12,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:12,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:12,537 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash 920625250, now seen corresponding path program 3 times [2019-12-27 02:08:12,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:12,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740370072] [2019-12-27 02:08:12,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:12,710 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 02:08:12,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740370072] [2019-12-27 02:08:12,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:08:12,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400500810] [2019-12-27 02:08:12,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:08:12,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:12,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:08:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:12,712 INFO L87 Difference]: Start difference. First operand 2127 states and 5650 transitions. Second operand 6 states. [2019-12-27 02:08:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:13,236 INFO L93 Difference]: Finished difference Result 3285 states and 8595 transitions. [2019-12-27 02:08:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:08:13,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-27 02:08:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:13,242 INFO L225 Difference]: With dead ends: 3285 [2019-12-27 02:08:13,242 INFO L226 Difference]: Without dead ends: 3285 [2019-12-27 02:08:13,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-12-27 02:08:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2411. [2019-12-27 02:08:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-27 02:08:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6298 transitions. [2019-12-27 02:08:13,274 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6298 transitions. Word has length 71 [2019-12-27 02:08:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:13,274 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 6298 transitions. [2019-12-27 02:08:13,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:08:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6298 transitions. [2019-12-27 02:08:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 02:08:13,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:13,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:13,280 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1439498402, now seen corresponding path program 1 times [2019-12-27 02:08:13,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:13,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578927332] [2019-12-27 02:08:13,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:13,432 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 02:08:13,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578927332] [2019-12-27 02:08:13,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:13,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:08:13,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845932909] [2019-12-27 02:08:13,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:08:13,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:08:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:08:13,434 INFO L87 Difference]: Start difference. First operand 2411 states and 6298 transitions. Second operand 8 states. [2019-12-27 02:08:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:14,304 INFO L93 Difference]: Finished difference Result 4056 states and 10526 transitions. [2019-12-27 02:08:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:08:14,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-27 02:08:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:14,311 INFO L225 Difference]: With dead ends: 4056 [2019-12-27 02:08:14,311 INFO L226 Difference]: Without dead ends: 4056 [2019-12-27 02:08:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:08:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-27 02:08:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2423. [2019-12-27 02:08:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 02:08:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6326 transitions. [2019-12-27 02:08:14,347 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6326 transitions. Word has length 72 [2019-12-27 02:08:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:14,347 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 6326 transitions. [2019-12-27 02:08:14,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:08:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6326 transitions. [2019-12-27 02:08:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 02:08:14,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:14,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:14,353 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash 362991256, now seen corresponding path program 2 times [2019-12-27 02:08:14,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:14,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718214145] [2019-12-27 02:08:14,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:14,473 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 02:08:14,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718214145] [2019-12-27 02:08:14,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:14,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:08:14,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344452360] [2019-12-27 02:08:14,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:08:14,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:08:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:14,475 INFO L87 Difference]: Start difference. First operand 2423 states and 6326 transitions. Second operand 7 states. [2019-12-27 02:08:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:15,355 INFO L93 Difference]: Finished difference Result 4529 states and 11696 transitions. [2019-12-27 02:08:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:08:15,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-27 02:08:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:15,361 INFO L225 Difference]: With dead ends: 4529 [2019-12-27 02:08:15,361 INFO L226 Difference]: Without dead ends: 4529 [2019-12-27 02:08:15,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:08:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-12-27 02:08:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 2513. [2019-12-27 02:08:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-27 02:08:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 6593 transitions. [2019-12-27 02:08:15,401 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 6593 transitions. Word has length 72 [2019-12-27 02:08:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:15,401 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 6593 transitions. [2019-12-27 02:08:15,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:08:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 6593 transitions. [2019-12-27 02:08:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 02:08:15,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:15,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:15,407 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash -697994534, now seen corresponding path program 3 times [2019-12-27 02:08:15,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:15,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646961835] [2019-12-27 02:08:15,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:15,508 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 02:08:15,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646961835] [2019-12-27 02:08:15,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:15,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:08:15,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855503808] [2019-12-27 02:08:15,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:08:15,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:15,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:08:15,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:15,511 INFO L87 Difference]: Start difference. First operand 2513 states and 6593 transitions. Second operand 7 states. [2019-12-27 02:08:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:16,216 INFO L93 Difference]: Finished difference Result 4357 states and 11298 transitions. [2019-12-27 02:08:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:08:16,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-27 02:08:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:16,223 INFO L225 Difference]: With dead ends: 4357 [2019-12-27 02:08:16,223 INFO L226 Difference]: Without dead ends: 4357 [2019-12-27 02:08:16,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:08:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2019-12-27 02:08:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 2495. [2019-12-27 02:08:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2019-12-27 02:08:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 6548 transitions. [2019-12-27 02:08:16,268 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 6548 transitions. Word has length 72 [2019-12-27 02:08:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:16,269 INFO L462 AbstractCegarLoop]: Abstraction has 2495 states and 6548 transitions. [2019-12-27 02:08:16,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:08:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 6548 transitions. [2019-12-27 02:08:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 02:08:16,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:16,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:16,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2080066259, now seen corresponding path program 1 times [2019-12-27 02:08:16,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:16,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589176256] [2019-12-27 02:08:16,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:16,358 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 02:08:16,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589176256] [2019-12-27 02:08:16,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:16,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:08:16,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467957901] [2019-12-27 02:08:16,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:08:16,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:08:16,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:16,360 INFO L87 Difference]: Start difference. First operand 2495 states and 6548 transitions. Second operand 6 states. [2019-12-27 02:08:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:16,891 INFO L93 Difference]: Finished difference Result 3310 states and 8595 transitions. [2019-12-27 02:08:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:08:16,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-27 02:08:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:16,897 INFO L225 Difference]: With dead ends: 3310 [2019-12-27 02:08:16,898 INFO L226 Difference]: Without dead ends: 3310 [2019-12-27 02:08:16,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 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 02:08:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-27 02:08:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 2691. [2019-12-27 02:08:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-12-27 02:08:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 7052 transitions. [2019-12-27 02:08:16,926 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 7052 transitions. Word has length 72 [2019-12-27 02:08:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:16,927 INFO L462 AbstractCegarLoop]: Abstraction has 2691 states and 7052 transitions. [2019-12-27 02:08:16,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:08:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 7052 transitions. [2019-12-27 02:08:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 02:08:16,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:16,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:16,932 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1499063086, now seen corresponding path program 1 times [2019-12-27 02:08:16,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:16,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259437262] [2019-12-27 02:08:16,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:17,047 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 02:08:17,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259437262] [2019-12-27 02:08:17,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:17,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:08:17,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864360184] [2019-12-27 02:08:17,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:08:17,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:08:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:17,053 INFO L87 Difference]: Start difference. First operand 2691 states and 7052 transitions. Second operand 7 states. [2019-12-27 02:08:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:17,621 INFO L93 Difference]: Finished difference Result 3423 states and 8847 transitions. [2019-12-27 02:08:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:08:17,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-27 02:08:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:17,626 INFO L225 Difference]: With dead ends: 3423 [2019-12-27 02:08:17,626 INFO L226 Difference]: Without dead ends: 3423 [2019-12-27 02:08:17,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:08:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2019-12-27 02:08:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 2523. [2019-12-27 02:08:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-12-27 02:08:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 6614 transitions. [2019-12-27 02:08:17,659 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 6614 transitions. Word has length 72 [2019-12-27 02:08:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:17,659 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 6614 transitions. [2019-12-27 02:08:17,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:08:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 6614 transitions. [2019-12-27 02:08:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:17,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:17,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:17,665 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash -298102113, now seen corresponding path program 1 times [2019-12-27 02:08:17,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:17,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938630866] [2019-12-27 02:08:17,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:08:17,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938630866] [2019-12-27 02:08:17,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:17,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:17,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067668361] [2019-12-27 02:08:17,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:17,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:17,737 INFO L87 Difference]: Start difference. First operand 2523 states and 6614 transitions. Second operand 3 states. [2019-12-27 02:08:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:17,758 INFO L93 Difference]: Finished difference Result 2291 states and 5860 transitions. [2019-12-27 02:08:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:17,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-27 02:08:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:17,761 INFO L225 Difference]: With dead ends: 2291 [2019-12-27 02:08:17,762 INFO L226 Difference]: Without dead ends: 2291 [2019-12-27 02:08:17,763 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 02:08:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-12-27 02:08:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-12-27 02:08:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-27 02:08:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 5860 transitions. [2019-12-27 02:08:17,801 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 5860 transitions. Word has length 73 [2019-12-27 02:08:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:17,802 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 5860 transitions. [2019-12-27 02:08:17,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 5860 transitions. [2019-12-27 02:08:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:17,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:17,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:17,806 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -393402248, now seen corresponding path program 1 times [2019-12-27 02:08:17,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:17,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51258062] [2019-12-27 02:08:17,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:17,893 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 02:08:17,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51258062] [2019-12-27 02:08:17,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:17,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:08:17,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202718317] [2019-12-27 02:08:17,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:08:17,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:17,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:08:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:08:17,895 INFO L87 Difference]: Start difference. First operand 2291 states and 5860 transitions. Second operand 3 states. [2019-12-27 02:08:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:17,935 INFO L93 Difference]: Finished difference Result 2290 states and 5858 transitions. [2019-12-27 02:08:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:08:17,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-27 02:08:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:17,939 INFO L225 Difference]: With dead ends: 2290 [2019-12-27 02:08:17,939 INFO L226 Difference]: Without dead ends: 2290 [2019-12-27 02:08:17,940 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 02:08:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-12-27 02:08:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2025. [2019-12-27 02:08:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-12-27 02:08:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5244 transitions. [2019-12-27 02:08:17,963 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5244 transitions. Word has length 73 [2019-12-27 02:08:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:17,964 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 5244 transitions. [2019-12-27 02:08:17,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:08:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5244 transitions. [2019-12-27 02:08:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:17,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:17,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:17,967 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1480966909, now seen corresponding path program 1 times [2019-12-27 02:08:17,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:17,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636206841] [2019-12-27 02:08:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:18,223 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 02:08:18,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636206841] [2019-12-27 02:08:18,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:18,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:08:18,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353784060] [2019-12-27 02:08:18,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:08:18,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:18,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:08:18,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:08:18,225 INFO L87 Difference]: Start difference. First operand 2025 states and 5244 transitions. Second operand 10 states. [2019-12-27 02:08:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:19,367 INFO L93 Difference]: Finished difference Result 3937 states and 10260 transitions. [2019-12-27 02:08:19,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:08:19,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-27 02:08:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:19,374 INFO L225 Difference]: With dead ends: 3937 [2019-12-27 02:08:19,374 INFO L226 Difference]: Without dead ends: 3937 [2019-12-27 02:08:19,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:08:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2019-12-27 02:08:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 2753. [2019-12-27 02:08:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2753 states. [2019-12-27 02:08:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 7272 transitions. [2019-12-27 02:08:19,422 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 7272 transitions. Word has length 73 [2019-12-27 02:08:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:19,422 INFO L462 AbstractCegarLoop]: Abstraction has 2753 states and 7272 transitions. [2019-12-27 02:08:19,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:08:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 7272 transitions. [2019-12-27 02:08:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:19,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:19,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:19,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1787574207, now seen corresponding path program 2 times [2019-12-27 02:08:19,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:19,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078518964] [2019-12-27 02:08:19,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:19,576 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 02:08:19,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078518964] [2019-12-27 02:08:19,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:19,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:08:19,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157880820] [2019-12-27 02:08:19,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:08:19,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:08:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:19,580 INFO L87 Difference]: Start difference. First operand 2753 states and 7272 transitions. Second operand 7 states. [2019-12-27 02:08:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:20,037 INFO L93 Difference]: Finished difference Result 4748 states and 12397 transitions. [2019-12-27 02:08:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:08:20,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-27 02:08:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:20,045 INFO L225 Difference]: With dead ends: 4748 [2019-12-27 02:08:20,045 INFO L226 Difference]: Without dead ends: 4748 [2019-12-27 02:08:20,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:08:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-12-27 02:08:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 3269. [2019-12-27 02:08:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-27 02:08:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8628 transitions. [2019-12-27 02:08:20,088 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8628 transitions. Word has length 73 [2019-12-27 02:08:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:20,089 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8628 transitions. [2019-12-27 02:08:20,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:08:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8628 transitions. [2019-12-27 02:08:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:20,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:20,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:20,094 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash 109680953, now seen corresponding path program 3 times [2019-12-27 02:08:20,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:20,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596822898] [2019-12-27 02:08:20,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:20,344 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 02:08:20,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596822898] [2019-12-27 02:08:20,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:20,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:08:20,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638542149] [2019-12-27 02:08:20,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:08:20,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:08:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:08:20,346 INFO L87 Difference]: Start difference. First operand 3269 states and 8628 transitions. Second operand 10 states. [2019-12-27 02:08:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:21,418 INFO L93 Difference]: Finished difference Result 6109 states and 15990 transitions. [2019-12-27 02:08:21,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:08:21,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-27 02:08:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:21,428 INFO L225 Difference]: With dead ends: 6109 [2019-12-27 02:08:21,428 INFO L226 Difference]: Without dead ends: 6109 [2019-12-27 02:08:21,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:08:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2019-12-27 02:08:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 3185. [2019-12-27 02:08:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3185 states. [2019-12-27 02:08:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 8400 transitions. [2019-12-27 02:08:21,478 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 8400 transitions. Word has length 73 [2019-12-27 02:08:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:21,479 INFO L462 AbstractCegarLoop]: Abstraction has 3185 states and 8400 transitions. [2019-12-27 02:08:21,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:08:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 8400 transitions. [2019-12-27 02:08:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:21,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:21,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:21,484 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1267108309, now seen corresponding path program 4 times [2019-12-27 02:08:21,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:21,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627175308] [2019-12-27 02:08:21,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:21,624 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 02:08:21,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627175308] [2019-12-27 02:08:21,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:21,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:08:21,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698849482] [2019-12-27 02:08:21,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:08:21,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:08:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:21,626 INFO L87 Difference]: Start difference. First operand 3185 states and 8400 transitions. Second operand 6 states. [2019-12-27 02:08:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:21,904 INFO L93 Difference]: Finished difference Result 3639 states and 9577 transitions. [2019-12-27 02:08:21,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:08:21,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-27 02:08:21,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:21,910 INFO L225 Difference]: With dead ends: 3639 [2019-12-27 02:08:21,911 INFO L226 Difference]: Without dead ends: 3639 [2019-12-27 02:08:21,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:08:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2019-12-27 02:08:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3185. [2019-12-27 02:08:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3185 states. [2019-12-27 02:08:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 8336 transitions. [2019-12-27 02:08:21,949 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 8336 transitions. Word has length 73 [2019-12-27 02:08:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:21,950 INFO L462 AbstractCegarLoop]: Abstraction has 3185 states and 8336 transitions. [2019-12-27 02:08:21,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:08:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 8336 transitions. [2019-12-27 02:08:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 02:08:21,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:21,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:21,956 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1431998849, now seen corresponding path program 5 times [2019-12-27 02:08:21,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:21,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117698771] [2019-12-27 02:08:21,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:22,157 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 02:08:22,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117698771] [2019-12-27 02:08:22,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:22,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:08:22,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631631995] [2019-12-27 02:08:22,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:08:22,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:22,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:08:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:08:22,159 INFO L87 Difference]: Start difference. First operand 3185 states and 8336 transitions. Second operand 9 states. [2019-12-27 02:08:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:22,958 INFO L93 Difference]: Finished difference Result 4924 states and 12741 transitions. [2019-12-27 02:08:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:08:22,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-27 02:08:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:22,968 INFO L225 Difference]: With dead ends: 4924 [2019-12-27 02:08:22,968 INFO L226 Difference]: Without dead ends: 4924 [2019-12-27 02:08:22,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:08:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2019-12-27 02:08:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 2737. [2019-12-27 02:08:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2019-12-27 02:08:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 7172 transitions. [2019-12-27 02:08:23,054 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 7172 transitions. Word has length 73 [2019-12-27 02:08:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:23,054 INFO L462 AbstractCegarLoop]: Abstraction has 2737 states and 7172 transitions. [2019-12-27 02:08:23,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:08:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 7172 transitions. [2019-12-27 02:08:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:08:23,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:23,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:23,061 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 95378273, now seen corresponding path program 1 times [2019-12-27 02:08:23,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:23,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407311436] [2019-12-27 02:08:23,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:23,942 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 02:08:23,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407311436] [2019-12-27 02:08:23,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:23,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:08:23,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516117564] [2019-12-27 02:08:23,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:23,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:23,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:23,945 INFO L87 Difference]: Start difference. First operand 2737 states and 7172 transitions. Second operand 5 states. [2019-12-27 02:08:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:23,987 INFO L93 Difference]: Finished difference Result 2961 states and 7576 transitions. [2019-12-27 02:08:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:23,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 02:08:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:23,991 INFO L225 Difference]: With dead ends: 2961 [2019-12-27 02:08:23,991 INFO L226 Difference]: Without dead ends: 1572 [2019-12-27 02:08:23,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:08:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-12-27 02:08:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2019-12-27 02:08:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-27 02:08:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3471 transitions. [2019-12-27 02:08:24,017 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3471 transitions. Word has length 74 [2019-12-27 02:08:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:24,017 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3471 transitions. [2019-12-27 02:08:24,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3471 transitions. [2019-12-27 02:08:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:08:24,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:24,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:24,021 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1817677093, now seen corresponding path program 2 times [2019-12-27 02:08:24,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:24,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859288198] [2019-12-27 02:08:24,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:24,151 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 02:08:24,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859288198] [2019-12-27 02:08:24,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:24,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:08:24,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744247012] [2019-12-27 02:08:24,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:08:24,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:08:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:08:24,160 INFO L87 Difference]: Start difference. First operand 1572 states and 3471 transitions. Second operand 5 states. [2019-12-27 02:08:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:24,263 INFO L93 Difference]: Finished difference Result 1948 states and 4251 transitions. [2019-12-27 02:08:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:08:24,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 02:08:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:24,265 INFO L225 Difference]: With dead ends: 1948 [2019-12-27 02:08:24,265 INFO L226 Difference]: Without dead ends: 295 [2019-12-27 02:08:24,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:08:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-27 02:08:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 271. [2019-12-27 02:08:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-27 02:08:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 458 transitions. [2019-12-27 02:08:24,272 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 458 transitions. Word has length 74 [2019-12-27 02:08:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:24,272 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 458 transitions. [2019-12-27 02:08:24,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:08:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 458 transitions. [2019-12-27 02:08:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:08:24,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:24,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:24,275 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash -398575509, now seen corresponding path program 3 times [2019-12-27 02:08:24,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:24,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841603204] [2019-12-27 02:08:24,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:24,747 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 02:08:24,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841603204] [2019-12-27 02:08:24,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:24,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:08:24,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983673460] [2019-12-27 02:08:24,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:08:24,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:24,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:08:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:08:24,753 INFO L87 Difference]: Start difference. First operand 271 states and 458 transitions. Second operand 15 states. [2019-12-27 02:08:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:25,723 INFO L93 Difference]: Finished difference Result 574 states and 1006 transitions. [2019-12-27 02:08:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:08:25,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2019-12-27 02:08:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:25,725 INFO L225 Difference]: With dead ends: 574 [2019-12-27 02:08:25,726 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 02:08:25,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:08:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 02:08:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 420. [2019-12-27 02:08:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-27 02:08:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 722 transitions. [2019-12-27 02:08:25,732 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 722 transitions. Word has length 74 [2019-12-27 02:08:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:25,733 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 722 transitions. [2019-12-27 02:08:25,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:08:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 722 transitions. [2019-12-27 02:08:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:08:25,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:25,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:25,734 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 346406315, now seen corresponding path program 4 times [2019-12-27 02:08:25,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:25,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977681185] [2019-12-27 02:08:25,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:08:25,929 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 02:08:25,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977681185] [2019-12-27 02:08:25,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:08:25,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:08:25,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742063095] [2019-12-27 02:08:25,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:08:25,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:08:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:08:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:08:25,932 INFO L87 Difference]: Start difference. First operand 420 states and 722 transitions. Second operand 11 states. [2019-12-27 02:08:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:08:26,238 INFO L93 Difference]: Finished difference Result 576 states and 980 transitions. [2019-12-27 02:08:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:08:26,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-27 02:08:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:08:26,240 INFO L225 Difference]: With dead ends: 576 [2019-12-27 02:08:26,240 INFO L226 Difference]: Without dead ends: 546 [2019-12-27 02:08:26,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:08:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-27 02:08:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 379. [2019-12-27 02:08:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 02:08:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 643 transitions. [2019-12-27 02:08:26,249 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 643 transitions. Word has length 74 [2019-12-27 02:08:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:08:26,250 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 643 transitions. [2019-12-27 02:08:26,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:08:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 643 transitions. [2019-12-27 02:08:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:08:26,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:08:26,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:08:26,252 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:08:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:08:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2034928915, now seen corresponding path program 5 times [2019-12-27 02:08:26,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:08:26,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745023752] [2019-12-27 02:08:26,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:08:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:08:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:08:26,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:08:26,413 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:08:26,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~y$r_buff1_thd1~0_137 0) (= v_~y$flush_delayed~0_201 0) (= v_~y$r_buff1_thd0~0_323 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27|) |v_ULTIMATE.start_main_~#t766~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd2~0_124) (= v_~y$w_buff1_used~0_443 0) (= 0 v_~y$r_buff1_thd3~0_282) (= 0 v_~y$r_buff0_thd3~0_461) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t766~0.base_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27| 1) |v_#valid_61|) (= 0 v_~y$w_buff0~0_180) (= v_~main$tmp_guard1~0_34 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t766~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd2~0_202) (= v_~y$r_buff0_thd0~0_357 0) (= v_~y$r_buff0_thd1~0_62 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= |v_ULTIMATE.start_main_~#t766~0.offset_21| 0) (= v_~y~0_276 0) (= v_~z~0_23 0) (= v_~weak$$choice2~0_236 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_5| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27|) 0) (= v_~y$mem_tmp~0_174 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_86) (= 0 v_~__unbuffered_p2_EAX~0_30) (= v_~x~0_36 0) (= v_~y$w_buff0_used~0_864 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t766~0.base=|v_ULTIMATE.start_main_~#t766~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_27|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_65|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_25|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_52|, ~y$mem_tmp~0=v_~y$mem_tmp~0_174, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_201, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_53|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_122|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_29|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t766~0.offset=|v_ULTIMATE.start_main_~#t766~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_323, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_864, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_53|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_55|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_75|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_38|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_137, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_46|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_461, ~y~0=v_~y~0_276, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_25|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_36|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_39|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_58|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_84|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_202, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_35|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_43|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_19|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t766~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t767~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t766~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t768~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t768~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t767~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:08:26,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L818-1-->L820: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t767~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t767~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t767~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11|) |v_ULTIMATE.start_main_~#t767~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t767~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_17|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t767~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t767~0.base] because there is no mapped edge [2019-12-27 02:08:26,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t768~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t768~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12|) |v_ULTIMATE.start_main_~#t768~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t768~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_12|, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t768~0.base, ULTIMATE.start_main_~#t768~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 02:08:26,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= 1 v_~y$r_buff0_thd3~0_204) (= v_~weak$$choice2~0_87 v_~y$flush_delayed~0_53) (= |v_P2Thread1of1ForFork1_#t~nondet10_46| v_~weak$$choice2~0_87) (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_57) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= |v_P2Thread1of1ForFork1_#t~nondet9_46| v_~weak$$choice0~0_41) (= v_~y$r_buff0_thd3~0_205 v_~y$r_buff1_thd3~0_107) (= v_~y~0_105 v_~y$mem_tmp~0_43) (= v_~y$r_buff0_thd0~0_153 v_~y$r_buff1_thd0~0_106) (= v_~y$r_buff0_thd1~0_24 v_~y$r_buff1_thd1~0_24)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_46|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_46|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_105, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_45|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_45|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_57, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_107, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_204, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~y~0=v_~y~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:08:26,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In2018710388 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2018710388 256))) (.cse1 (= |P2Thread1of1ForFork1_#t~ite12_Out2018710388| |P2Thread1of1ForFork1_#t~ite11_Out2018710388|))) (or (and (not .cse0) .cse1 (= ~y$w_buff0~0_In2018710388 |P2Thread1of1ForFork1_#t~ite11_Out2018710388|) (not .cse2)) (and (or .cse0 .cse2) (= ~y$w_buff1~0_In2018710388 |P2Thread1of1ForFork1_#t~ite11_Out2018710388|) .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2018710388, ~y$w_buff1~0=~y$w_buff1~0_In2018710388, ~y$w_buff0~0=~y$w_buff0~0_In2018710388, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2018710388} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2018710388, ~y$w_buff1~0=~y$w_buff1~0_In2018710388, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out2018710388|, ~y$w_buff0~0=~y$w_buff0~0_In2018710388, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2018710388, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out2018710388|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:08:26,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_81 256) 0)) (= v_~y$r_buff0_thd3~0_181 v_~y$r_buff0_thd3~0_180)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_13|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_12|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:08:26,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1846799155 256)))) (or (and (= ~y$mem_tmp~0_In-1846799155 |P2Thread1of1ForFork1_#t~ite31_Out-1846799155|) (not .cse0)) (and (= ~y~0_In-1846799155 |P2Thread1of1ForFork1_#t~ite31_Out-1846799155|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1846799155, ~y$flush_delayed~0=~y$flush_delayed~0_In-1846799155, ~y~0=~y~0_In-1846799155} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1846799155, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out-1846799155|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1846799155, ~y~0=~y~0_In-1846799155} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:08:26,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_19 1) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~z~0=v_~z~0_19, ~x~0=v_~x~0_21, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 02:08:26,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In712970502 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In712970502 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out712970502| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In712970502 |P2Thread1of1ForFork1_#t~ite34_Out712970502|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In712970502, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In712970502} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In712970502, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out712970502|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In712970502} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:08:26,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1594711441| |P1Thread1of1ForFork0_#t~ite3_Out-1594711441|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1594711441 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1594711441 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-1594711441 |P1Thread1of1ForFork0_#t~ite3_Out-1594711441|)) (and (= ~y~0_In-1594711441 |P1Thread1of1ForFork0_#t~ite3_Out-1594711441|) .cse0 (or .cse2 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1594711441, ~y$w_buff1~0=~y$w_buff1~0_In-1594711441, ~y~0=~y~0_In-1594711441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594711441} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1594711441, ~y$w_buff1~0=~y$w_buff1~0_In-1594711441, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1594711441|, ~y~0=~y~0_In-1594711441, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1594711441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594711441} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 02:08:26,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1150178619 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1150178619 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1150178619|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1150178619 |P1Thread1of1ForFork0_#t~ite5_Out1150178619|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1150178619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1150178619} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1150178619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1150178619, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1150178619|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:08:26,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In2111013903 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In2111013903 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2111013903 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2111013903 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out2111013903|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite6_Out2111013903| ~y$w_buff1_used~0_In2111013903)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2111013903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2111013903, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2111013903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111013903} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2111013903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2111013903, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2111013903, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out2111013903|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2111013903} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:08:26,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-851468288 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-851468288 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-851468288| ~y$r_buff0_thd2~0_In-851468288)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-851468288|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-851468288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-851468288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-851468288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-851468288, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-851468288|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 02:08:26,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-909031476 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-909031476 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-909031476 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-909031476 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-909031476 |P1Thread1of1ForFork0_#t~ite8_Out-909031476|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out-909031476| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-909031476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-909031476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-909031476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-909031476} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-909031476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-909031476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-909031476, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-909031476|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-909031476} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:08:26,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_75 |v_P1Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_75, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_27|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 02:08:26,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2143661782 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In2143661782 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2143661782 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In2143661782 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2143661782 |P2Thread1of1ForFork1_#t~ite35_Out2143661782|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2143661782|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2143661782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2143661782, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2143661782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2143661782} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2143661782|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2143661782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2143661782, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2143661782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2143661782} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:08:26,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1559306795 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1559306795 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1559306795 ~y$r_buff0_thd3~0_In1559306795)) (and (= ~y$r_buff0_thd3~0_Out1559306795 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1559306795, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1559306795} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1559306795|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1559306795, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1559306795} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:08:26,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2142163358 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In2142163358 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In2142163358 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In2142163358 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out2142163358| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out2142163358| ~y$r_buff1_thd3~0_In2142163358) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2142163358, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142163358, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2142163358, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142163358} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2142163358, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2142163358|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2142163358, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2142163358, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142163358} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:08:26,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_34| v_~y$r_buff1_thd3~0_143) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 02:08:26,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:08:26,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In708020511 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In708020511 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out708020511| ~y$w_buff1~0_In708020511) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out708020511| ~y~0_In708020511) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In708020511, ~y~0=~y~0_In708020511, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708020511, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708020511} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out708020511|, ~y$w_buff1~0=~y$w_buff1~0_In708020511, ~y~0=~y~0_In708020511, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708020511, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708020511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:08:26,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_57 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:08:26,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In623123138 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In623123138 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out623123138| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out623123138| ~y$w_buff0_used~0_In623123138)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In623123138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In623123138} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In623123138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In623123138, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out623123138|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:08:26,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-570908671 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-570908671 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-570908671 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-570908671 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-570908671| ~y$w_buff1_used~0_In-570908671) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-570908671|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-570908671, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-570908671, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-570908671, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-570908671} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-570908671, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-570908671, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-570908671, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-570908671|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-570908671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:08:26,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-74718434 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-74718434 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-74718434|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-74718434 |ULTIMATE.start_main_#t~ite45_Out-74718434|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-74718434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-74718434} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-74718434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-74718434, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-74718434|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:08:26,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-638195263 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-638195263 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-638195263 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-638195263 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-638195263|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-638195263 |ULTIMATE.start_main_#t~ite46_Out-638195263|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-638195263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638195263, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-638195263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638195263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-638195263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-638195263, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-638195263|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-638195263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638195263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 02:08:26,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1115921359 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite69_Out1115921359| ~y~0_In1115921359) .cse0) (and (= ~y$mem_tmp~0_In1115921359 |ULTIMATE.start_main_#t~ite69_Out1115921359|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1115921359, ~y$flush_delayed~0=~y$flush_delayed~0_In1115921359, ~y~0=~y~0_In1115921359} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1115921359, ~y$flush_delayed~0=~y$flush_delayed~0_In1115921359, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1115921359|, ~y~0=~y~0_In1115921359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-27 02:08:26,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_265 |v_ULTIMATE.start_main_#t~ite69_41|) (= v_~y$flush_delayed~0_194 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_40|, ~y~0=v_~y~0_265, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:08:26,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:08:26 BasicIcfg [2019-12-27 02:08:26,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:08:26,558 INFO L168 Benchmark]: Toolchain (without parser) took 48121.03 ms. Allocated memory was 146.8 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 102.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 575.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:26,558 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:08:26,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.74 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 156.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:26,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.64 ms. Allocated memory is still 204.5 MB. Free memory was 156.5 MB in the beginning and 152.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:26,560 INFO L168 Benchmark]: Boogie Preprocessor took 43.53 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:26,560 INFO L168 Benchmark]: RCFGBuilder took 981.97 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 150.1 MB in the beginning and 203.5 MB in the end (delta: -53.4 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:26,561 INFO L168 Benchmark]: TraceAbstraction took 46163.13 ms. Allocated memory was 234.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 203.5 MB in the beginning and 1.1 GB in the end (delta: -923.8 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:08:26,563 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.74 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 156.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.64 ms. Allocated memory is still 204.5 MB. Free memory was 156.5 MB in the beginning and 152.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.53 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 151.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 981.97 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 150.1 MB in the beginning and 203.5 MB in the end (delta: -53.4 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46163.13 ms. Allocated memory was 234.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 203.5 MB in the beginning and 1.1 GB in the end (delta: -923.8 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 205 ProgramPointsBefore, 120 ProgramPointsAfterwards, 257 TransitionsBefore, 143 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 56 ConcurrentYvCompositions, 33 ChoiceCompositions, 9380 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 65 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 165402 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 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) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 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 [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.8s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4815 SDtfs, 5320 SDslu, 13551 SDs, 0 SdLazy, 8016 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 98 SyntacticMatches, 39 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87886occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 20404 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1429 ConstructedInterpolants, 0 QuantifiedInterpolants, 348695 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...