/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:36:53,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:36:53,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:36:53,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:36:53,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:36:53,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:36:53,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:36:53,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:36:53,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:36:53,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:36:53,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:36:53,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:36:53,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:36:53,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:36:53,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:36:53,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:36:53,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:36:53,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:36:53,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:36:53,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:36:53,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:36:53,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:36:53,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:36:53,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:36:53,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:36:53,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:36:53,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:36:53,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:36:53,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:36:53,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:36:53,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:36:53,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:36:53,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:36:53,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:36:53,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:36:53,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:36:53,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:36:53,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:36:53,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:36:53,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:36:53,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:36:53,186 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-MCR.epf [2019-12-27 16:36:53,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:36:53,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:36:53,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:36:53,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:36:53,201 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:36:53,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:36:53,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:36:53,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:36:53,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:36:53,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:36:53,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:36:53,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:36:53,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:36:53,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:36:53,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:36:53,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:36:53,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:36:53,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:36:53,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:36:53,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:36:53,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:36:53,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:36:53,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:36:53,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:36:53,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:36:53,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:36:53,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:36:53,206 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:36:53,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:36:53,206 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:36:53,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:36:53,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:36:53,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:36:53,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:36:53,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:36:53,498 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:36:53,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2019-12-27 16:36:53,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd3a80a9b/652d9fb5001e465fbd3fa3b6b4e7c5ae/FLAG85ab1b87f [2019-12-27 16:36:54,093 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:36:54,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2019-12-27 16:36:54,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd3a80a9b/652d9fb5001e465fbd3fa3b6b4e7c5ae/FLAG85ab1b87f [2019-12-27 16:36:54,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd3a80a9b/652d9fb5001e465fbd3fa3b6b4e7c5ae [2019-12-27 16:36:54,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:36:54,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:36:54,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:36:54,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:36:54,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:36:54,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:36:54" (1/1) ... [2019-12-27 16:36:54,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fd5ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:54, skipping insertion in model container [2019-12-27 16:36:54,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:36:54" (1/1) ... [2019-12-27 16:36:54,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:36:54,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:36:55,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:36:55,125 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:36:55,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:36:55,262 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:36:55,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55 WrapperNode [2019-12-27 16:36:55,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:36:55,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:36:55,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:36:55,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:36:55,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:36:55,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:36:55,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:36:55,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:36:55,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (1/1) ... [2019-12-27 16:36:55,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:36:55,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:36:55,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:36:55,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:36:55,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (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 16:36:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:36:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:36:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:36:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:36:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:36:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:36:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:36:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:36:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:36:55,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:36:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:36:55,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:36:55,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:36:55,486 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 16:36:56,468 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:36:56,468 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:36:56,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:36:56 BoogieIcfgContainer [2019-12-27 16:36:56,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:36:56,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:36:56,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:36:56,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:36:56,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:36:54" (1/3) ... [2019-12-27 16:36:56,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f7de20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:36:56, skipping insertion in model container [2019-12-27 16:36:56,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:55" (2/3) ... [2019-12-27 16:36:56,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f7de20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:36:56, skipping insertion in model container [2019-12-27 16:36:56,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:36:56" (3/3) ... [2019-12-27 16:36:56,481 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.oepc.i [2019-12-27 16:36:56,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:36:56,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:36:56,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:36:56,497 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:36:56,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,539 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,552 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,552 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,552 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,584 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,587 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,592 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,593 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:56,607 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:36:56,625 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:36:56,625 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:36:56,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:36:56,625 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:36:56,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:36:56,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:36:56,626 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:36:56,626 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:36:56,644 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-27 16:36:56,646 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 16:36:56,781 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 16:36:56,782 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:36:56,803 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 16:36:56,838 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-27 16:36:56,949 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-27 16:36:56,949 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:36:56,968 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 16:36:57,014 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-27 16:36:57,016 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:37:02,625 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 16:37:02,775 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:37:02,903 INFO L206 etLargeBlockEncoding]: Checked pairs total: 165402 [2019-12-27 16:37:02,904 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-27 16:37:02,907 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 143 transitions [2019-12-27 16:37:07,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 57466 states. [2019-12-27 16:37:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57466 states. [2019-12-27 16:37:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:37:07,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:07,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:07,895 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 16:37:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash -953839885, now seen corresponding path program 1 times [2019-12-27 16:37:07,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:07,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275910937] [2019-12-27 16:37:07,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:08,144 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 16:37:08,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275910937] [2019-12-27 16:37:08,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:08,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:37:08,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686749216] [2019-12-27 16:37:08,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:08,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:08,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:37:08,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:08,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:08,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:08,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:08,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:08,183 INFO L87 Difference]: Start difference. First operand 57466 states. Second operand 3 states. [2019-12-27 16:37:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:09,076 INFO L93 Difference]: Finished difference Result 57370 states and 231250 transitions. [2019-12-27 16:37:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:09,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:37:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:09,582 INFO L225 Difference]: With dead ends: 57370 [2019-12-27 16:37:09,583 INFO L226 Difference]: Without dead ends: 56226 [2019-12-27 16:37:09,584 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 16:37:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56226 states. [2019-12-27 16:37:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56226 to 56226. [2019-12-27 16:37:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56226 states. [2019-12-27 16:37:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56226 states to 56226 states and 226882 transitions. [2019-12-27 16:37:16,323 INFO L78 Accepts]: Start accepts. Automaton has 56226 states and 226882 transitions. Word has length 7 [2019-12-27 16:37:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:16,324 INFO L462 AbstractCegarLoop]: Abstraction has 56226 states and 226882 transitions. [2019-12-27 16:37:16,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 56226 states and 226882 transitions. [2019-12-27 16:37:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:37:16,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:16,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:16,337 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 16:37:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash 749632042, now seen corresponding path program 1 times [2019-12-27 16:37:16,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:16,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676547288] [2019-12-27 16:37:16,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:16,497 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 16:37:16,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676547288] [2019-12-27 16:37:16,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:16,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:16,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856847746] [2019-12-27 16:37:16,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:16,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:16,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 16:37:16,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:16,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:37:16,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:37:16,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:16,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:37:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:16,555 INFO L87 Difference]: Start difference. First operand 56226 states and 226882 transitions. Second operand 5 states. [2019-12-27 16:37:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:17,542 INFO L93 Difference]: Finished difference Result 90514 states and 350820 transitions. [2019-12-27 16:37:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:17,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 16:37:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:18,572 INFO L225 Difference]: With dead ends: 90514 [2019-12-27 16:37:18,573 INFO L226 Difference]: Without dead ends: 90500 [2019-12-27 16:37:18,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90500 states. [2019-12-27 16:37:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90500 to 87886. [2019-12-27 16:37:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87886 states. [2019-12-27 16:37:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87886 states to 87886 states and 342542 transitions. [2019-12-27 16:37:22,485 INFO L78 Accepts]: Start accepts. Automaton has 87886 states and 342542 transitions. Word has length 13 [2019-12-27 16:37:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:22,485 INFO L462 AbstractCegarLoop]: Abstraction has 87886 states and 342542 transitions. [2019-12-27 16:37:22,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:37:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 87886 states and 342542 transitions. [2019-12-27 16:37:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:37:22,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:22,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:22,487 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 16:37:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1969493490, now seen corresponding path program 1 times [2019-12-27 16:37:22,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:22,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753623262] [2019-12-27 16:37:22,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:22,547 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 16:37:22,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753623262] [2019-12-27 16:37:22,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:22,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:22,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452208560] [2019-12-27 16:37:22,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:22,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:22,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:37:22,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:22,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:22,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:22,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:22,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:22,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:22,552 INFO L87 Difference]: Start difference. First operand 87886 states and 342542 transitions. Second operand 3 states. [2019-12-27 16:37:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:23,437 INFO L93 Difference]: Finished difference Result 48011 states and 163167 transitions. [2019-12-27 16:37:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:23,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:37:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:23,572 INFO L225 Difference]: With dead ends: 48011 [2019-12-27 16:37:23,572 INFO L226 Difference]: Without dead ends: 48011 [2019-12-27 16:37:23,573 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 16:37:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48011 states. [2019-12-27 16:37:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48011 to 48011. [2019-12-27 16:37:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-12-27 16:37:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 163167 transitions. [2019-12-27 16:37:25,409 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 163167 transitions. Word has length 13 [2019-12-27 16:37:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:25,410 INFO L462 AbstractCegarLoop]: Abstraction has 48011 states and 163167 transitions. [2019-12-27 16:37:25,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 163167 transitions. [2019-12-27 16:37:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:37:25,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:25,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:25,412 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 16:37:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash 802741009, now seen corresponding path program 1 times [2019-12-27 16:37:25,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:25,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102594739] [2019-12-27 16:37:25,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:25,460 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 16:37:25,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102594739] [2019-12-27 16:37:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:25,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:37:25,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580996699] [2019-12-27 16:37:25,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:25,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:25,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 16:37:25,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:25,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:25,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:37:25,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:25,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:37:25,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:37:25,466 INFO L87 Difference]: Start difference. First operand 48011 states and 163167 transitions. Second operand 4 states. [2019-12-27 16:37:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:25,501 INFO L93 Difference]: Finished difference Result 5081 states and 12972 transitions. [2019-12-27 16:37:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:37:25,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:37:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:25,510 INFO L225 Difference]: With dead ends: 5081 [2019-12-27 16:37:25,510 INFO L226 Difference]: Without dead ends: 5081 [2019-12-27 16:37:25,510 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 16:37:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-12-27 16:37:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2019-12-27 16:37:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-12-27 16:37:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 12972 transitions. [2019-12-27 16:37:25,581 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 12972 transitions. Word has length 14 [2019-12-27 16:37:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:25,581 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 12972 transitions. [2019-12-27 16:37:25,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:37:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 12972 transitions. [2019-12-27 16:37:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:37:25,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:25,585 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 16:37:25,586 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 16:37:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1593078696, now seen corresponding path program 1 times [2019-12-27 16:37:25,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:25,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053131363] [2019-12-27 16:37:25,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:25,657 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 16:37:25,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053131363] [2019-12-27 16:37:25,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:25,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:37:25,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842658208] [2019-12-27 16:37:25,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:25,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:25,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 16:37:25,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:25,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:37:25,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:37:25,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:25,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:37:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:25,697 INFO L87 Difference]: Start difference. First operand 5081 states and 12972 transitions. Second operand 6 states. [2019-12-27 16:37:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:25,736 INFO L93 Difference]: Finished difference Result 1979 states and 5224 transitions. [2019-12-27 16:37:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:25,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 16:37:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:25,740 INFO L225 Difference]: With dead ends: 1979 [2019-12-27 16:37:25,740 INFO L226 Difference]: Without dead ends: 1979 [2019-12-27 16:37:25,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-27 16:37:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1881. [2019-12-27 16:37:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 16:37:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4993 transitions. [2019-12-27 16:37:25,771 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4993 transitions. Word has length 26 [2019-12-27 16:37:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:25,771 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4993 transitions. [2019-12-27 16:37:25,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:37:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4993 transitions. [2019-12-27 16:37:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 16:37:25,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:25,778 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 16:37:25,778 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 16:37:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 76160980, now seen corresponding path program 1 times [2019-12-27 16:37:25,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:25,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592803458] [2019-12-27 16:37:25,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:25,970 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 16:37:25,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592803458] [2019-12-27 16:37:25,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:25,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:37:25,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719305114] [2019-12-27 16:37:25,972 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:25,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:26,955 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 348 transitions. [2019-12-27 16:37:26,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:27,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:37:27,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:37:27,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:37:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:37:27,020 INFO L87 Difference]: Start difference. First operand 1881 states and 4993 transitions. Second operand 8 states. [2019-12-27 16:37:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:28,194 INFO L93 Difference]: Finished difference Result 4164 states and 10620 transitions. [2019-12-27 16:37:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:37:28,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-27 16:37:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:28,202 INFO L225 Difference]: With dead ends: 4164 [2019-12-27 16:37:28,202 INFO L226 Difference]: Without dead ends: 4164 [2019-12-27 16:37:28,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:37:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2019-12-27 16:37:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 2373. [2019-12-27 16:37:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2373 states. [2019-12-27 16:37:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 6251 transitions. [2019-12-27 16:37:28,241 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 6251 transitions. Word has length 71 [2019-12-27 16:37:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:28,241 INFO L462 AbstractCegarLoop]: Abstraction has 2373 states and 6251 transitions. [2019-12-27 16:37:28,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:37:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 6251 transitions. [2019-12-27 16:37:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 16:37:28,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:28,248 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 16:37:28,248 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 16:37:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash -789175518, now seen corresponding path program 2 times [2019-12-27 16:37:28,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:28,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435466312] [2019-12-27 16:37:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:37:28,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435466312] [2019-12-27 16:37:28,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:28,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:37:28,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1396889879] [2019-12-27 16:37:28,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:28,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:28,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 210 transitions. [2019-12-27 16:37:28,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:28,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:37:28,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:37:28,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:37:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:28,610 INFO L87 Difference]: Start difference. First operand 2373 states and 6251 transitions. Second operand 9 states. [2019-12-27 16:37:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:30,253 INFO L93 Difference]: Finished difference Result 4101 states and 10456 transitions. [2019-12-27 16:37:30,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:37:30,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-12-27 16:37:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:30,263 INFO L225 Difference]: With dead ends: 4101 [2019-12-27 16:37:30,264 INFO L226 Difference]: Without dead ends: 4101 [2019-12-27 16:37:30,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:37:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2019-12-27 16:37:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 2443. [2019-12-27 16:37:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2019-12-27 16:37:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 6416 transitions. [2019-12-27 16:37:30,325 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 6416 transitions. Word has length 71 [2019-12-27 16:37:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:30,326 INFO L462 AbstractCegarLoop]: Abstraction has 2443 states and 6416 transitions. [2019-12-27 16:37:30,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:37:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 6416 transitions. [2019-12-27 16:37:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 16:37:30,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:30,337 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 16:37:30,337 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 16:37:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash 920625250, now seen corresponding path program 3 times [2019-12-27 16:37:30,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:30,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266507673] [2019-12-27 16:37:30,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:30,539 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 16:37:30,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266507673] [2019-12-27 16:37:30,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:30,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:37:30,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [780898643] [2019-12-27 16:37:30,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:30,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:30,664 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 187 transitions. [2019-12-27 16:37:30,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:30,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:37:30,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:37:30,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:37:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:37:30,695 INFO L87 Difference]: Start difference. First operand 2443 states and 6416 transitions. Second operand 7 states. [2019-12-27 16:37:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:31,365 INFO L93 Difference]: Finished difference Result 4409 states and 11341 transitions. [2019-12-27 16:37:31,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:37:31,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-27 16:37:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:31,373 INFO L225 Difference]: With dead ends: 4409 [2019-12-27 16:37:31,373 INFO L226 Difference]: Without dead ends: 4409 [2019-12-27 16:37:31,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2019-12-27 16:37:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 2737. [2019-12-27 16:37:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2019-12-27 16:37:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 7083 transitions. [2019-12-27 16:37:31,414 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 7083 transitions. Word has length 71 [2019-12-27 16:37:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:31,414 INFO L462 AbstractCegarLoop]: Abstraction has 2737 states and 7083 transitions. [2019-12-27 16:37:31,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:37:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 7083 transitions. [2019-12-27 16:37:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 16:37:31,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:31,420 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 16:37:31,421 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 16:37:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1439498402, now seen corresponding path program 1 times [2019-12-27 16:37:31,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:31,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821265237] [2019-12-27 16:37:31,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:31,520 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 16:37:31,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821265237] [2019-12-27 16:37:31,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:31,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:31,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480279616] [2019-12-27 16:37:31,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:31,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:31,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 159 transitions. [2019-12-27 16:37:31,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:31,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:31,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:31,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:31,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:31,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:31,638 INFO L87 Difference]: Start difference. First operand 2737 states and 7083 transitions. Second operand 3 states. [2019-12-27 16:37:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:31,682 INFO L93 Difference]: Finished difference Result 2736 states and 7081 transitions. [2019-12-27 16:37:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:31,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-27 16:37:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:31,687 INFO L225 Difference]: With dead ends: 2736 [2019-12-27 16:37:31,687 INFO L226 Difference]: Without dead ends: 2736 [2019-12-27 16:37:31,687 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 16:37:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-12-27 16:37:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2487. [2019-12-27 16:37:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2019-12-27 16:37:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 6501 transitions. [2019-12-27 16:37:31,720 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 6501 transitions. Word has length 72 [2019-12-27 16:37:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:31,720 INFO L462 AbstractCegarLoop]: Abstraction has 2487 states and 6501 transitions. [2019-12-27 16:37:31,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 6501 transitions. [2019-12-27 16:37:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 16:37:31,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:31,726 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 16:37:31,726 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 16:37:31,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:31,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2080066259, now seen corresponding path program 1 times [2019-12-27 16:37:31,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:31,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126131994] [2019-12-27 16:37:31,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:31,845 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 16:37:31,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126131994] [2019-12-27 16:37:31,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:31,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:37:31,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1187400394] [2019-12-27 16:37:31,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:31,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:32,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 291 transitions. [2019-12-27 16:37:32,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:32,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:37:32,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:37:32,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:37:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:37:32,152 INFO L87 Difference]: Start difference. First operand 2487 states and 6501 transitions. Second operand 7 states. [2019-12-27 16:37:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:32,850 INFO L93 Difference]: Finished difference Result 3092 states and 7985 transitions. [2019-12-27 16:37:32,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:37:32,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-27 16:37:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:32,856 INFO L225 Difference]: With dead ends: 3092 [2019-12-27 16:37:32,856 INFO L226 Difference]: Without dead ends: 3092 [2019-12-27 16:37:32,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:37:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2019-12-27 16:37:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2529. [2019-12-27 16:37:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2529 states. [2019-12-27 16:37:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 6600 transitions. [2019-12-27 16:37:32,886 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 6600 transitions. Word has length 72 [2019-12-27 16:37:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:32,886 INFO L462 AbstractCegarLoop]: Abstraction has 2529 states and 6600 transitions. [2019-12-27 16:37:32,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:37:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 6600 transitions. [2019-12-27 16:37:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 16:37:32,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:32,890 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 16:37:32,891 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 16:37:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -298102113, now seen corresponding path program 1 times [2019-12-27 16:37:32,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:32,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84237041] [2019-12-27 16:37:32,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:32,970 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 16:37:32,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84237041] [2019-12-27 16:37:32,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:32,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:32,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240363167] [2019-12-27 16:37:32,972 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:32,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:33,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 213 transitions. [2019-12-27 16:37:33,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:33,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:37:33,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:37:33,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:37:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:37:33,121 INFO L87 Difference]: Start difference. First operand 2529 states and 6600 transitions. Second operand 4 states. [2019-12-27 16:37:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:33,211 INFO L93 Difference]: Finished difference Result 2874 states and 7256 transitions. [2019-12-27 16:37:33,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:33,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-27 16:37:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:33,216 INFO L225 Difference]: With dead ends: 2874 [2019-12-27 16:37:33,217 INFO L226 Difference]: Without dead ends: 2874 [2019-12-27 16:37:33,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 16:37:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-12-27 16:37:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2341. [2019-12-27 16:37:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2019-12-27 16:37:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5990 transitions. [2019-12-27 16:37:33,255 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5990 transitions. Word has length 73 [2019-12-27 16:37:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:33,255 INFO L462 AbstractCegarLoop]: Abstraction has 2341 states and 5990 transitions. [2019-12-27 16:37:33,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:37:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5990 transitions. [2019-12-27 16:37:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 16:37:33,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:33,260 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 16:37:33,260 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 16:37:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1480966909, now seen corresponding path program 1 times [2019-12-27 16:37:33,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:33,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732201504] [2019-12-27 16:37:33,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:33,520 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 16:37:33,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732201504] [2019-12-27 16:37:33,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:33,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:37:33,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623907897] [2019-12-27 16:37:33,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:33,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:33,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 293 transitions. [2019-12-27 16:37:33,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:33,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:37:33,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:37:33,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:37:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:37:33,805 INFO L87 Difference]: Start difference. First operand 2341 states and 5990 transitions. Second operand 10 states. [2019-12-27 16:37:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:34,696 INFO L93 Difference]: Finished difference Result 4371 states and 11189 transitions. [2019-12-27 16:37:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:37:34,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-27 16:37:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:34,703 INFO L225 Difference]: With dead ends: 4371 [2019-12-27 16:37:34,704 INFO L226 Difference]: Without dead ends: 4371 [2019-12-27 16:37:34,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:37:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-12-27 16:37:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 3061. [2019-12-27 16:37:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-12-27 16:37:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 7918 transitions. [2019-12-27 16:37:34,744 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 7918 transitions. Word has length 73 [2019-12-27 16:37:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:34,744 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 7918 transitions. [2019-12-27 16:37:34,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:37:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 7918 transitions. [2019-12-27 16:37:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 16:37:34,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:34,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:34,748 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 16:37:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:34,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1787574207, now seen corresponding path program 2 times [2019-12-27 16:37:34,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:34,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755079354] [2019-12-27 16:37:34,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:34,937 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 16:37:34,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755079354] [2019-12-27 16:37:34,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:34,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:37:34,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285403943] [2019-12-27 16:37:34,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:34,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:35,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 297 transitions. [2019-12-27 16:37:35,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:35,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:37:35,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:37:35,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:37:35,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:37:35,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:37:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:35,254 INFO L87 Difference]: Start difference. First operand 3061 states and 7918 transitions. Second operand 9 states. [2019-12-27 16:37:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:35,730 INFO L93 Difference]: Finished difference Result 5236 states and 13417 transitions. [2019-12-27 16:37:35,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:37:35,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-27 16:37:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:35,740 INFO L225 Difference]: With dead ends: 5236 [2019-12-27 16:37:35,741 INFO L226 Difference]: Without dead ends: 5236 [2019-12-27 16:37:35,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:37:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2019-12-27 16:37:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 3711. [2019-12-27 16:37:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3711 states. [2019-12-27 16:37:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 9615 transitions. [2019-12-27 16:37:35,840 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 9615 transitions. Word has length 73 [2019-12-27 16:37:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:35,840 INFO L462 AbstractCegarLoop]: Abstraction has 3711 states and 9615 transitions. [2019-12-27 16:37:35,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:37:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 9615 transitions. [2019-12-27 16:37:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 16:37:35,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:35,850 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 16:37:35,851 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 16:37:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:35,851 INFO L82 PathProgramCache]: Analyzing trace with hash 109680953, now seen corresponding path program 3 times [2019-12-27 16:37:35,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:35,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113431893] [2019-12-27 16:37:35,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:37:36,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113431893] [2019-12-27 16:37:36,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:36,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:37:36,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138942159] [2019-12-27 16:37:36,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:36,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:36,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 300 transitions. [2019-12-27 16:37:36,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:37:36,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:37:36,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:37:36,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:37:36,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:37:36,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:37:36,715 INFO L87 Difference]: Start difference. First operand 3711 states and 9615 transitions. Second operand 12 states. [2019-12-27 16:37:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:37,927 INFO L93 Difference]: Finished difference Result 6574 states and 16828 transitions. [2019-12-27 16:37:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:37:37,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-12-27 16:37:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:37,940 INFO L225 Difference]: With dead ends: 6574 [2019-12-27 16:37:37,940 INFO L226 Difference]: Without dead ends: 6574 [2019-12-27 16:37:37,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:37:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6574 states. [2019-12-27 16:37:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6574 to 3075. [2019-12-27 16:37:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3075 states. [2019-12-27 16:37:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 7951 transitions. [2019-12-27 16:37:38,046 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 7951 transitions. Word has length 73 [2019-12-27 16:37:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:38,046 INFO L462 AbstractCegarLoop]: Abstraction has 3075 states and 7951 transitions. [2019-12-27 16:37:38,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:37:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 7951 transitions. [2019-12-27 16:37:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:37:38,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:38,055 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 16:37:38,056 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 16:37:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash 95378273, now seen corresponding path program 1 times [2019-12-27 16:37:38,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:38,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582304772] [2019-12-27 16:37:38,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:37:38,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582304772] [2019-12-27 16:37:38,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:38,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:37:38,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210169573] [2019-12-27 16:37:38,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:38,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:38,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 163 transitions. [2019-12-27 16:37:38,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:38,476 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:38,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:37:38,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:37:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:38,477 INFO L87 Difference]: Start difference. First operand 3075 states and 7951 transitions. Second operand 6 states. [2019-12-27 16:37:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:38,622 INFO L93 Difference]: Finished difference Result 4912 states and 11931 transitions. [2019-12-27 16:37:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:37:38,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-27 16:37:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:38,626 INFO L225 Difference]: With dead ends: 4912 [2019-12-27 16:37:38,626 INFO L226 Difference]: Without dead ends: 2058 [2019-12-27 16:37:38,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2019-12-27 16:37:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1745. [2019-12-27 16:37:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-12-27 16:37:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 3782 transitions. [2019-12-27 16:37:38,655 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 3782 transitions. Word has length 74 [2019-12-27 16:37:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:38,655 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 3782 transitions. [2019-12-27 16:37:38,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:37:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3782 transitions. [2019-12-27 16:37:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:37:38,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:38,659 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 16:37:38,659 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 16:37:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1817677093, now seen corresponding path program 2 times [2019-12-27 16:37:38,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:38,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166968177] [2019-12-27 16:37:38,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:38,825 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 16:37:38,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166968177] [2019-12-27 16:37:38,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:38,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:37:38,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832623073] [2019-12-27 16:37:38,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:38,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:38,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-27 16:37:38,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:38,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:37:38,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:37:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:38,945 INFO L87 Difference]: Start difference. First operand 1745 states and 3782 transitions. Second operand 5 states. [2019-12-27 16:37:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:39,024 INFO L93 Difference]: Finished difference Result 2138 states and 4579 transitions. [2019-12-27 16:37:39,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:39,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 16:37:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:39,025 INFO L225 Difference]: With dead ends: 2138 [2019-12-27 16:37:39,025 INFO L226 Difference]: Without dead ends: 306 [2019-12-27 16:37:39,026 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 16:37:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-27 16:37:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 282. [2019-12-27 16:37:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-27 16:37:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 466 transitions. [2019-12-27 16:37:39,030 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 466 transitions. Word has length 74 [2019-12-27 16:37:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:39,030 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 466 transitions. [2019-12-27 16:37:39,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:37:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 466 transitions. [2019-12-27 16:37:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:37:39,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:39,031 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 16:37:39,032 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 16:37:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -398575509, now seen corresponding path program 3 times [2019-12-27 16:37:39,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:39,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12548836] [2019-12-27 16:37:39,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:39,397 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 16:37:39,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12548836] [2019-12-27 16:37:39,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:39,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:37:39,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252432760] [2019-12-27 16:37:39,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:39,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:39,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 171 transitions. [2019-12-27 16:37:39,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:39,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:37:39,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:37:39,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:39,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:37:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:37:39,660 INFO L87 Difference]: Start difference. First operand 282 states and 466 transitions. Second operand 16 states. [2019-12-27 16:37:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:41,809 INFO L93 Difference]: Finished difference Result 869 states and 1510 transitions. [2019-12-27 16:37:41,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 16:37:41,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-27 16:37:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:41,811 INFO L225 Difference]: With dead ends: 869 [2019-12-27 16:37:41,811 INFO L226 Difference]: Without dead ends: 831 [2019-12-27 16:37:41,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=265, Invalid=1295, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 16:37:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-12-27 16:37:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 419. [2019-12-27 16:37:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-27 16:37:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 709 transitions. [2019-12-27 16:37:41,819 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 709 transitions. Word has length 74 [2019-12-27 16:37:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:41,819 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 709 transitions. [2019-12-27 16:37:41,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:37:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 709 transitions. [2019-12-27 16:37:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:37:41,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:41,821 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 16:37:41,821 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 16:37:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 346406315, now seen corresponding path program 4 times [2019-12-27 16:37:41,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:41,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060055129] [2019-12-27 16:37:41,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:42,232 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 16:37:42,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060055129] [2019-12-27 16:37:42,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:42,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 16:37:42,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165984993] [2019-12-27 16:37:42,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:42,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:42,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 165 transitions. [2019-12-27 16:37:42,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:42,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:37:42,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:37:42,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:37:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:37:42,465 INFO L87 Difference]: Start difference. First operand 419 states and 709 transitions. Second operand 16 states. [2019-12-27 16:37:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:43,811 INFO L93 Difference]: Finished difference Result 872 states and 1512 transitions. [2019-12-27 16:37:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:37:43,811 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-27 16:37:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:43,813 INFO L225 Difference]: With dead ends: 872 [2019-12-27 16:37:43,813 INFO L226 Difference]: Without dead ends: 834 [2019-12-27 16:37:43,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:37:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-12-27 16:37:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 445. [2019-12-27 16:37:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-27 16:37:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 758 transitions. [2019-12-27 16:37:43,820 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 758 transitions. Word has length 74 [2019-12-27 16:37:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:43,820 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 758 transitions. [2019-12-27 16:37:43,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:37:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 758 transitions. [2019-12-27 16:37:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:37:43,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:43,821 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 16:37:43,822 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 16:37:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1501626897, now seen corresponding path program 5 times [2019-12-27 16:37:43,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:43,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716572114] [2019-12-27 16:37:43,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:44,020 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 16:37:44,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716572114] [2019-12-27 16:37:44,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:44,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:37:44,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1477782983] [2019-12-27 16:37:44,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:44,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:44,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 199 transitions. [2019-12-27 16:37:44,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:44,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:37:44,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:37:44,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:37:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:37:44,226 INFO L87 Difference]: Start difference. First operand 445 states and 758 transitions. Second operand 11 states. [2019-12-27 16:37:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:44,522 INFO L93 Difference]: Finished difference Result 609 states and 1024 transitions. [2019-12-27 16:37:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:37:44,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-27 16:37:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:44,524 INFO L225 Difference]: With dead ends: 609 [2019-12-27 16:37:44,524 INFO L226 Difference]: Without dead ends: 571 [2019-12-27 16:37:44,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:37:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-27 16:37:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 390. [2019-12-27 16:37:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-27 16:37:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 651 transitions. [2019-12-27 16:37:44,530 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 651 transitions. Word has length 74 [2019-12-27 16:37:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:44,530 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 651 transitions. [2019-12-27 16:37:44,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:37:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 651 transitions. [2019-12-27 16:37:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:37:44,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:44,532 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 16:37:44,532 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 16:37:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2034928915, now seen corresponding path program 6 times [2019-12-27 16:37:44,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:44,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176134742] [2019-12-27 16:37:44,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:37:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:37:44,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:37:44,717 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:37:44,723 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) (= 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_~#t763~0.base_27|) (= 0 v_~y$w_buff0~0_180) (= v_~main$tmp_guard1~0_34 0) (< 0 |v_#StackHeapBarrier_17|) (= 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_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t763~0.base_27| 1)) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y~0_276 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t763~0.base_27| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t763~0.base_27|) 0) (= v_~z~0_23 0) (= v_~weak$$choice2~0_236 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t763~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t763~0.base_27|) |v_ULTIMATE.start_main_~#t763~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_5| 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) (= |v_ULTIMATE.start_main_~#t763~0.offset_21| 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_~#t763~0.base=|v_ULTIMATE.start_main_~#t763~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, ULTIMATE.start_main_~#t764~0.offset=|v_ULTIMATE.start_main_~#t764~0.offset_16|, ~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_~#t764~0.base=|v_ULTIMATE.start_main_~#t764~0.base_19|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_~#t765~0.base=|v_ULTIMATE.start_main_~#t765~0.base_18|, 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|, ~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|, ~__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, ~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|, ULTIMATE.start_main_~#t765~0.offset=|v_ULTIMATE.start_main_~#t765~0.offset_15|, ~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|, ~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_~#t763~0.offset=|v_ULTIMATE.start_main_~#t763~0.offset_21|, 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|, ~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_~#t763~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, ULTIMATE.start_main_~#t764~0.offset, ~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_~#t764~0.base, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_~#t765~0.base, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t765~0.offset, ~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, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t763~0.offset, 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, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:37:44,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L818-1-->L820: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t764~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t764~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t764~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t764~0.base_11|) |v_ULTIMATE.start_main_~#t764~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t764~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t764~0.base_11| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t764~0.base_11|)) (= |v_ULTIMATE.start_main_~#t764~0.offset_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_~#t764~0.offset=|v_ULTIMATE.start_main_~#t764~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|, ULTIMATE.start_main_~#t764~0.base=|v_ULTIMATE.start_main_~#t764~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t764~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t764~0.base, #length] because there is no mapped edge [2019-12-27 16:37:44,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t765~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t765~0.base_12|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t765~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t765~0.base_12|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t765~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t765~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t765~0.base_12|) |v_ULTIMATE.start_main_~#t765~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t765~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t765~0.offset=|v_ULTIMATE.start_main_~#t765~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t765~0.base=|v_ULTIMATE.start_main_~#t765~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t765~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t765~0.base] because there is no mapped edge [2019-12-27 16:37:44,729 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 16:37:44,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1832899620 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-1832899620| |P2Thread1of1ForFork1_#t~ite12_Out-1832899620|)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1832899620 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-1832899620| ~y$w_buff1~0_In-1832899620) .cse2) (and (not .cse0) .cse2 (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_Out-1832899620| ~y$w_buff0~0_In-1832899620)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1832899620, ~y$w_buff1~0=~y$w_buff1~0_In-1832899620, ~y$w_buff0~0=~y$w_buff0~0_In-1832899620, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1832899620} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1832899620, ~y$w_buff1~0=~y$w_buff1~0_In-1832899620, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1832899620|, ~y$w_buff0~0=~y$w_buff0~0_In-1832899620, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1832899620, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1832899620|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:37:44,738 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 16:37:44,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1063364725 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite31_Out-1063364725| ~y~0_In-1063364725)) (and (= ~y$mem_tmp~0_In-1063364725 |P2Thread1of1ForFork1_#t~ite31_Out-1063364725|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1063364725, ~y$flush_delayed~0=~y$flush_delayed~0_In-1063364725, ~y~0=~y~0_In-1063364725} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1063364725, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out-1063364725|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1063364725, ~y~0=~y~0_In-1063364725} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:37:44,741 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 16:37:44,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1986941167 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1986941167 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1986941167|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1986941167 |P2Thread1of1ForFork1_#t~ite34_Out-1986941167|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1986941167, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1986941167} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1986941167, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1986941167|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1986941167} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:37:44,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1586057981 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1586057981 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite4_Out1586057981| |P1Thread1of1ForFork0_#t~ite3_Out1586057981|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1586057981 |P1Thread1of1ForFork0_#t~ite3_Out1586057981|) .cse2) (and (= |P1Thread1of1ForFork0_#t~ite3_Out1586057981| ~y~0_In1586057981) (or .cse0 .cse1) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1586057981, ~y$w_buff1~0=~y$w_buff1~0_In1586057981, ~y~0=~y~0_In1586057981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586057981} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1586057981, ~y$w_buff1~0=~y$w_buff1~0_In1586057981, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1586057981|, ~y~0=~y~0_In1586057981, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1586057981|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586057981} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 16:37:44,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2098801330 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2098801330 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out2098801330| 0)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out2098801330| ~y$w_buff0_used~0_In2098801330) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2098801330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2098801330} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2098801330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2098801330, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out2098801330|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:37:44,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1443083470 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1443083470 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1443083470 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1443083470 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1443083470 |P1Thread1of1ForFork0_#t~ite6_Out1443083470|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out1443083470|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1443083470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1443083470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1443083470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1443083470} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1443083470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1443083470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1443083470, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1443083470|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1443083470} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:37:44,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2006914412 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2006914412 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-2006914412 |P1Thread1of1ForFork0_#t~ite7_Out-2006914412|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite7_Out-2006914412| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006914412, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2006914412} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006914412, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2006914412, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-2006914412|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 16:37:44,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In196433456 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In196433456 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In196433456 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In196433456 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite8_Out196433456| ~y$r_buff1_thd2~0_In196433456)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out196433456| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In196433456, ~y$w_buff0_used~0=~y$w_buff0_used~0_In196433456, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In196433456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In196433456} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In196433456, ~y$w_buff0_used~0=~y$w_buff0_used~0_In196433456, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In196433456, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out196433456|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In196433456} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:37:44,749 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 16:37:44,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1051593257 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1051593257 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1051593257 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1051593257 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1051593257| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite35_Out-1051593257| ~y$w_buff1_used~0_In-1051593257)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1051593257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1051593257, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1051593257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1051593257} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1051593257|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1051593257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1051593257, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1051593257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1051593257} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:37:44,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1381899243 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1381899243 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out1381899243) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out1381899243 ~y$r_buff0_thd3~0_In1381899243) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1381899243, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1381899243} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1381899243|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381899243, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1381899243} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:37:44,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1012004815 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1012004815 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1012004815 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1012004815 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1012004815| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite37_Out1012004815| ~y$r_buff1_thd3~0_In1012004815) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1012004815, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1012004815, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1012004815, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1012004815} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1012004815, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1012004815|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1012004815, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1012004815, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1012004815} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:37:44,751 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 16:37:44,751 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 16:37:44,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1104844425 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1104844425 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1104844425 |ULTIMATE.start_main_#t~ite41_Out1104844425|)) (and (= ~y~0_In1104844425 |ULTIMATE.start_main_#t~ite41_Out1104844425|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1104844425, ~y~0=~y~0_In1104844425, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1104844425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1104844425} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1104844425|, ~y$w_buff1~0=~y$w_buff1~0_In1104844425, ~y~0=~y~0_In1104844425, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1104844425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1104844425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:37:44,752 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 16:37:44,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-362125885 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-362125885 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-362125885 |ULTIMATE.start_main_#t~ite43_Out-362125885|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-362125885|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-362125885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-362125885} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-362125885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-362125885, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-362125885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:37:44,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In182268012 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In182268012 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In182268012 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In182268012 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out182268012| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out182268012| ~y$w_buff1_used~0_In182268012) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In182268012, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In182268012, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In182268012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In182268012} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In182268012, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In182268012, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In182268012, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out182268012|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In182268012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:37:44,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1425193213 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1425193213 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1425193213| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1425193213| ~y$r_buff0_thd0~0_In1425193213) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1425193213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1425193213} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1425193213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1425193213, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1425193213|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:37:44,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In316067568 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In316067568 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In316067568 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In316067568 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In316067568 |ULTIMATE.start_main_#t~ite46_Out316067568|)) (and (= |ULTIMATE.start_main_#t~ite46_Out316067568| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In316067568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In316067568, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In316067568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In316067568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In316067568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In316067568, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out316067568|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In316067568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In316067568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:37:44,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1896057510 256)))) (or (and (= |ULTIMATE.start_main_#t~ite69_Out-1896057510| ~y$mem_tmp~0_In-1896057510) (not .cse0)) (and (= ~y~0_In-1896057510 |ULTIMATE.start_main_#t~ite69_Out-1896057510|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1896057510, ~y$flush_delayed~0=~y$flush_delayed~0_In-1896057510, ~y~0=~y~0_In-1896057510} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1896057510, ~y$flush_delayed~0=~y$flush_delayed~0_In-1896057510, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1896057510|, ~y~0=~y~0_In-1896057510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-27 16:37:44,767 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 16:37:44,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:37:44 BasicIcfg [2019-12-27 16:37:44,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:37:44,951 INFO L168 Benchmark]: Toolchain (without parser) took 50499.24 ms. Allocated memory was 146.8 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 103.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 632.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,952 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.99 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 154.3 MB in the end (delta: -51.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.02 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,953 INFO L168 Benchmark]: Boogie Preprocessor took 43.80 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,955 INFO L168 Benchmark]: RCFGBuilder took 1089.34 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 148.4 MB in the beginning and 201.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,956 INFO L168 Benchmark]: TraceAbstraction took 48476.73 ms. Allocated memory was 234.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 201.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 642.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:37:44,961 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.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.99 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 154.3 MB in the end (delta: -51.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.02 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.80 ms. Allocated memory is still 203.9 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1089.34 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 148.4 MB in the beginning and 201.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48476.73 ms. Allocated memory was 234.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 201.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 642.0 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.8s, 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(&t763, ((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(&t764, ((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(&t765, ((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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3673 SDtfs, 4870 SDslu, 11733 SDs, 0 SdLazy, 8381 SolverSat, 493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 109 SyntacticMatches, 55 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 4.1s 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: 13.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 16831 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1073 ConstructedInterpolants, 0 QuantifiedInterpolants, 298418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...