/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:53:46,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:53:46,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:53:46,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:53:46,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:53:46,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:53:46,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:53:46,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:53:46,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:53:46,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:53:46,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:53:46,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:53:46,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:53:46,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:53:46,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:53:46,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:53:46,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:53:46,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:53:46,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:53:46,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:53:46,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:53:46,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:53:46,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:53:46,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:53:46,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:53:46,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:53:46,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:53:46,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:53:46,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:53:46,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:53:46,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:53:46,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:53:46,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:53:46,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:53:46,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:53:46,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:53:46,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:53:46,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:53:46,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:53:46,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:53:46,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:53:46,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:53:46,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:53:46,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:53:46,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:53:46,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:53:46,296 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:53:46,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:53:46,297 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:53:46,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:53:46,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:53:46,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:53:46,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:53:46,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:53:46,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:53:46,300 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:53:46,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:53:46,300 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:53:46,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:53:46,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:53:46,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:53:46,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:53:46,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:53:46,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:53:46,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:53:46,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:53:46,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:53:46,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:53:46,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:53:46,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:53:46,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:53:46,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:53:46,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:53:46,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:53:46,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:53:46,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:53:46,647 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:53:46,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.oepc.i [2019-12-26 21:53:46,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a724fdf6b/7f1a4a19362b46b3bce3073ed67aff2f/FLAG3f675105c [2019-12-26 21:53:47,249 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:53:47,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_pso.oepc.i [2019-12-26 21:53:47,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a724fdf6b/7f1a4a19362b46b3bce3073ed67aff2f/FLAG3f675105c [2019-12-26 21:53:47,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a724fdf6b/7f1a4a19362b46b3bce3073ed67aff2f [2019-12-26 21:53:47,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:53:47,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:53:47,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:53:47,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:53:47,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:53:47,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:53:47" (1/1) ... [2019-12-26 21:53:47,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1477f632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:47, skipping insertion in model container [2019-12-26 21:53:47,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:53:47" (1/1) ... [2019-12-26 21:53:47,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:53:47,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:53:48,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:53:48,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:53:48,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:53:48,353 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:53:48,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48 WrapperNode [2019-12-26 21:53:48,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:53:48,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:53:48,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:53:48,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:53:48,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:53:48,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:53:48,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:53:48,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:53:48,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (1/1) ... [2019-12-26 21:53:48,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:53:48,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:53:48,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:53:48,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:53:48,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (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-26 21:53:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:53:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:53:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:53:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:53:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:53:48,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:53:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:53:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:53:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:53:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:53:48,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:53:48,566 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:53:49,271 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:53:49,272 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:53:49,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:53:49 BoogieIcfgContainer [2019-12-26 21:53:49,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:53:49,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:53:49,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:53:49,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:53:49,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:53:47" (1/3) ... [2019-12-26 21:53:49,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6387ffbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:53:49, skipping insertion in model container [2019-12-26 21:53:49,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:53:48" (2/3) ... [2019-12-26 21:53:49,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6387ffbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:53:49, skipping insertion in model container [2019-12-26 21:53:49,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:53:49" (3/3) ... [2019-12-26 21:53:49,283 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.oepc.i [2019-12-26 21:53:49,294 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:53:49,294 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:53:49,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:53:49,304 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:53:49,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:53:49,428 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 21:53:49,451 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:53:49,451 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:53:49,452 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:53:49,452 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:53:49,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:53:49,452 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:53:49,452 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:53:49,452 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:53:49,474 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 21:53:49,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 21:53:49,577 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 21:53:49,578 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:53:49,595 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:53:49,614 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 21:53:49,699 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 21:53:49,699 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:53:49,709 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:53:49,726 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 21:53:49,727 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:53:54,672 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 21:53:54,809 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-26 21:53:54,809 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 21:53:54,813 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-26 21:53:55,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-26 21:53:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-26 21:53:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:53:55,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:53:55,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:53:55,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:53:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:53:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-26 21:53:55,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:53:55,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694917601] [2019-12-26 21:53:55,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:53:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:53:55,498 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-26 21:53:55,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694917601] [2019-12-26 21:53:55,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:53:55,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:53:55,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264735283] [2019-12-26 21:53:55,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:53:55,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:53:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:53:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:53:55,525 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-26 21:53:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:53:55,852 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-26 21:53:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:53:55,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:53:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:53:55,942 INFO L225 Difference]: With dead ends: 8468 [2019-12-26 21:53:55,943 INFO L226 Difference]: Without dead ends: 7976 [2019-12-26 21:53:55,944 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-26 21:53:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-26 21:53:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-26 21:53:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-26 21:53:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-26 21:53:56,526 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-26 21:53:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:53:56,527 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-26 21:53:56,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:53:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-26 21:53:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:53:56,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:53:56,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:53:56,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:53:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:53:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-26 21:53:56,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:53:56,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244011769] [2019-12-26 21:53:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:53:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:53:56,751 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-26 21:53:56,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244011769] [2019-12-26 21:53:56,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:53:56,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:53:56,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137079042] [2019-12-26 21:53:56,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:53:56,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:53:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:53:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:53:56,758 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-26 21:53:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:53:57,213 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-26 21:53:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:53:57,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:53:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:53:57,299 INFO L225 Difference]: With dead ends: 12178 [2019-12-26 21:53:57,300 INFO L226 Difference]: Without dead ends: 12171 [2019-12-26 21:53:57,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:53:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-26 21:53:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-26 21:53:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-26 21:53:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-26 21:53:58,409 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-26 21:53:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:53:58,410 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-26 21:53:58,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:53:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-26 21:53:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:53:58,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:53:58,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:53:58,415 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:53:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:53:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-26 21:53:58,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:53:58,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282627263] [2019-12-26 21:53:58,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:53:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:53:58,513 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-26 21:53:58,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282627263] [2019-12-26 21:53:58,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:53:58,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:53:58,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453706119] [2019-12-26 21:53:58,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:53:58,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:53:58,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:53:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:53:58,515 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-26 21:53:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:53:58,760 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-26 21:53:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:53:58,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:53:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:53:58,809 INFO L225 Difference]: With dead ends: 13366 [2019-12-26 21:53:58,810 INFO L226 Difference]: Without dead ends: 13366 [2019-12-26 21:53:58,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:53:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-26 21:53:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-26 21:53:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-26 21:53:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-26 21:53:59,281 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-26 21:53:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:53:59,282 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-26 21:53:59,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:53:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-26 21:53:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:53:59,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:53:59,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:53:59,287 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:53:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:53:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-26 21:53:59,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:53:59,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449897920] [2019-12-26 21:53:59,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:53:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:53:59,331 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-26 21:53:59,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449897920] [2019-12-26 21:53:59,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:53:59,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:53:59,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421662439] [2019-12-26 21:53:59,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:53:59,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:53:59,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:53:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:53:59,333 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-26 21:53:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:53:59,402 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-26 21:53:59,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:53:59,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:53:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:53:59,441 INFO L225 Difference]: With dead ends: 11853 [2019-12-26 21:53:59,441 INFO L226 Difference]: Without dead ends: 11853 [2019-12-26 21:53:59,442 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-26 21:53:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-26 21:53:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-26 21:53:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-26 21:53:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-26 21:53:59,763 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-26 21:53:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:53:59,763 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-26 21:53:59,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:53:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-26 21:53:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 21:53:59,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:53:59,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:53:59,769 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:53:59,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:53:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-26 21:53:59,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:53:59,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414116762] [2019-12-26 21:53:59,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:53:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:53:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:53:59,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414116762] [2019-12-26 21:53:59,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:53:59,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:53:59,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463744944] [2019-12-26 21:53:59,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:53:59,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:53:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:53:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:53:59,843 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 4 states. [2019-12-26 21:53:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:53:59,879 INFO L93 Difference]: Finished difference Result 2296 states and 5756 transitions. [2019-12-26 21:53:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:53:59,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 21:53:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:53:59,884 INFO L225 Difference]: With dead ends: 2296 [2019-12-26 21:53:59,884 INFO L226 Difference]: Without dead ends: 1624 [2019-12-26 21:53:59,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:53:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-26 21:53:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1608. [2019-12-26 21:53:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-12-26 21:53:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 3603 transitions. [2019-12-26 21:53:59,916 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 3603 transitions. Word has length 17 [2019-12-26 21:53:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:53:59,916 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 3603 transitions. [2019-12-26 21:53:59,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:53:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 3603 transitions. [2019-12-26 21:53:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:53:59,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:53:59,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:53:59,920 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:53:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:53:59,920 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-26 21:53:59,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:53:59,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113695495] [2019-12-26 21:53:59,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:53:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:00,158 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-26 21:54:00,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113695495] [2019-12-26 21:54:00,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:00,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:00,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336433150] [2019-12-26 21:54:00,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:00,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:00,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:00,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:00,163 INFO L87 Difference]: Start difference. First operand 1608 states and 3603 transitions. Second operand 6 states. [2019-12-26 21:54:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:00,707 INFO L93 Difference]: Finished difference Result 4480 states and 9903 transitions. [2019-12-26 21:54:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:54:00,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 21:54:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:00,719 INFO L225 Difference]: With dead ends: 4480 [2019-12-26 21:54:00,719 INFO L226 Difference]: Without dead ends: 4445 [2019-12-26 21:54:00,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2019-12-26 21:54:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 2168. [2019-12-26 21:54:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-26 21:54:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-26 21:54:00,775 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 25 [2019-12-26 21:54:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:00,775 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-26 21:54:00,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-26 21:54:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:54:00,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:00,779 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-26 21:54:00,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-26 21:54:00,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:00,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223897551] [2019-12-26 21:54:00,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:54:00,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223897551] [2019-12-26 21:54:00,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:00,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:00,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869247238] [2019-12-26 21:54:00,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:54:00,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:54:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:00,862 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-26 21:54:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:01,438 INFO L93 Difference]: Finished difference Result 4358 states and 9517 transitions. [2019-12-26 21:54:01,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:54:01,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-26 21:54:01,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:01,449 INFO L225 Difference]: With dead ends: 4358 [2019-12-26 21:54:01,449 INFO L226 Difference]: Without dead ends: 4329 [2019-12-26 21:54:01,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-26 21:54:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 2043. [2019-12-26 21:54:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-12-26 21:54:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 4651 transitions. [2019-12-26 21:54:01,500 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 4651 transitions. Word has length 26 [2019-12-26 21:54:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:01,501 INFO L462 AbstractCegarLoop]: Abstraction has 2043 states and 4651 transitions. [2019-12-26 21:54:01,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:54:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 4651 transitions. [2019-12-26 21:54:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:54:01,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:01,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:01,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-26 21:54:01,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:01,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179847933] [2019-12-26 21:54:01,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:54:01,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179847933] [2019-12-26 21:54:01,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:01,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:01,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671729086] [2019-12-26 21:54:01,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:01,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:01,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:01,557 INFO L87 Difference]: Start difference. First operand 2043 states and 4651 transitions. Second operand 3 states. [2019-12-26 21:54:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:01,576 INFO L93 Difference]: Finished difference Result 3738 states and 8517 transitions. [2019-12-26 21:54:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:01,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:54:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:01,582 INFO L225 Difference]: With dead ends: 3738 [2019-12-26 21:54:01,583 INFO L226 Difference]: Without dead ends: 1966 [2019-12-26 21:54:01,583 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-26 21:54:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-26 21:54:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1950. [2019-12-26 21:54:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-26 21:54:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4342 transitions. [2019-12-26 21:54:01,617 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4342 transitions. Word has length 27 [2019-12-26 21:54:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:01,619 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4342 transitions. [2019-12-26 21:54:01,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4342 transitions. [2019-12-26 21:54:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:54:01,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:01,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:01,623 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-26 21:54:01,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:01,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879512108] [2019-12-26 21:54:01,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:01,770 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-26 21:54:01,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879512108] [2019-12-26 21:54:01,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:01,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:54:01,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289622467] [2019-12-26 21:54:01,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:54:01,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:54:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:01,774 INFO L87 Difference]: Start difference. First operand 1950 states and 4342 transitions. Second operand 5 states. [2019-12-26 21:54:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:02,251 INFO L93 Difference]: Finished difference Result 2942 states and 6436 transitions. [2019-12-26 21:54:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:54:02,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:54:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:02,256 INFO L225 Difference]: With dead ends: 2942 [2019-12-26 21:54:02,256 INFO L226 Difference]: Without dead ends: 2942 [2019-12-26 21:54:02,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:54:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2019-12-26 21:54:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2507. [2019-12-26 21:54:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-12-26 21:54:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 5550 transitions. [2019-12-26 21:54:02,300 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 5550 transitions. Word has length 27 [2019-12-26 21:54:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:02,300 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 5550 transitions. [2019-12-26 21:54:02,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:54:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 5550 transitions. [2019-12-26 21:54:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:54:02,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:02,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:02,306 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-26 21:54:02,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:02,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131306504] [2019-12-26 21:54:02,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:02,382 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-26 21:54:02,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131306504] [2019-12-26 21:54:02,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:02,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:54:02,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707359566] [2019-12-26 21:54:02,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:54:02,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:54:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:54:02,384 INFO L87 Difference]: Start difference. First operand 2507 states and 5550 transitions. Second operand 5 states. [2019-12-26 21:54:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:02,438 INFO L93 Difference]: Finished difference Result 1526 states and 3206 transitions. [2019-12-26 21:54:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:54:02,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:54:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:02,441 INFO L225 Difference]: With dead ends: 1526 [2019-12-26 21:54:02,441 INFO L226 Difference]: Without dead ends: 1282 [2019-12-26 21:54:02,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-12-26 21:54:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1187. [2019-12-26 21:54:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-12-26 21:54:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2573 transitions. [2019-12-26 21:54:02,460 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2573 transitions. Word has length 28 [2019-12-26 21:54:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:02,460 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2573 transitions. [2019-12-26 21:54:02,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:54:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2573 transitions. [2019-12-26 21:54:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:54:02,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:02,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:02,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-26 21:54:02,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:02,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159507218] [2019-12-26 21:54:02,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:02,649 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-26 21:54:02,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159507218] [2019-12-26 21:54:02,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:02,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:54:02,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528965179] [2019-12-26 21:54:02,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:54:02,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:54:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:02,652 INFO L87 Difference]: Start difference. First operand 1187 states and 2573 transitions. Second operand 7 states. [2019-12-26 21:54:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:02,905 INFO L93 Difference]: Finished difference Result 2079 states and 4404 transitions. [2019-12-26 21:54:02,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:54:02,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 21:54:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:02,908 INFO L225 Difference]: With dead ends: 2079 [2019-12-26 21:54:02,909 INFO L226 Difference]: Without dead ends: 1402 [2019-12-26 21:54:02,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:54:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-26 21:54:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1193. [2019-12-26 21:54:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-26 21:54:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2562 transitions. [2019-12-26 21:54:02,931 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2562 transitions. Word has length 51 [2019-12-26 21:54:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:02,933 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2562 transitions. [2019-12-26 21:54:02,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:54:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2562 transitions. [2019-12-26 21:54:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:54:02,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:02,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:02,937 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-26 21:54:02,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:02,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218581919] [2019-12-26 21:54:02,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:03,040 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-26 21:54:03,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218581919] [2019-12-26 21:54:03,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:03,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:03,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046179318] [2019-12-26 21:54:03,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:03,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:03,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:03,043 INFO L87 Difference]: Start difference. First operand 1193 states and 2562 transitions. Second operand 3 states. [2019-12-26 21:54:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:03,094 INFO L93 Difference]: Finished difference Result 1560 states and 3313 transitions. [2019-12-26 21:54:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:03,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 21:54:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:03,097 INFO L225 Difference]: With dead ends: 1560 [2019-12-26 21:54:03,097 INFO L226 Difference]: Without dead ends: 1560 [2019-12-26 21:54:03,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2019-12-26 21:54:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1241. [2019-12-26 21:54:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-26 21:54:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2674 transitions. [2019-12-26 21:54:03,120 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2674 transitions. Word has length 51 [2019-12-26 21:54:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:03,120 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2674 transitions. [2019-12-26 21:54:03,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2674 transitions. [2019-12-26 21:54:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:03,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:03,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:03,123 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1232036927, now seen corresponding path program 1 times [2019-12-26 21:54:03,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:03,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490931227] [2019-12-26 21:54:03,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:03,242 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-26 21:54:03,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490931227] [2019-12-26 21:54:03,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:03,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:54:03,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800077162] [2019-12-26 21:54:03,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:54:03,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:54:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:54:03,244 INFO L87 Difference]: Start difference. First operand 1241 states and 2674 transitions. Second operand 8 states. [2019-12-26 21:54:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:04,717 INFO L93 Difference]: Finished difference Result 2619 states and 5414 transitions. [2019-12-26 21:54:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:54:04,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-26 21:54:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:04,721 INFO L225 Difference]: With dead ends: 2619 [2019-12-26 21:54:04,721 INFO L226 Difference]: Without dead ends: 2619 [2019-12-26 21:54:04,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-12-26 21:54:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2019-12-26 21:54:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 1259. [2019-12-26 21:54:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2019-12-26 21:54:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2696 transitions. [2019-12-26 21:54:04,750 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2696 transitions. Word has length 52 [2019-12-26 21:54:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:04,750 INFO L462 AbstractCegarLoop]: Abstraction has 1259 states and 2696 transitions. [2019-12-26 21:54:04,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:54:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2696 transitions. [2019-12-26 21:54:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:04,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:04,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:04,754 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash -448501738, now seen corresponding path program 1 times [2019-12-26 21:54:04,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:04,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797607909] [2019-12-26 21:54:04,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:04,864 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-26 21:54:04,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797607909] [2019-12-26 21:54:04,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:04,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:54:04,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909519977] [2019-12-26 21:54:04,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:54:04,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:54:04,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:54:04,867 INFO L87 Difference]: Start difference. First operand 1259 states and 2696 transitions. Second operand 7 states. [2019-12-26 21:54:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:05,889 INFO L93 Difference]: Finished difference Result 2242 states and 4589 transitions. [2019-12-26 21:54:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:54:05,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 21:54:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:05,893 INFO L225 Difference]: With dead ends: 2242 [2019-12-26 21:54:05,893 INFO L226 Difference]: Without dead ends: 2242 [2019-12-26 21:54:05,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:54:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-26 21:54:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1280. [2019-12-26 21:54:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-12-26 21:54:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2742 transitions. [2019-12-26 21:54:05,919 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2742 transitions. Word has length 52 [2019-12-26 21:54:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:05,920 INFO L462 AbstractCegarLoop]: Abstraction has 1280 states and 2742 transitions. [2019-12-26 21:54:05,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:54:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2742 transitions. [2019-12-26 21:54:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:54:05,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:05,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:05,923 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1247011877, now seen corresponding path program 2 times [2019-12-26 21:54:05,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:05,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460042878] [2019-12-26 21:54:05,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:54:05,988 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-26 21:54:05,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460042878] [2019-12-26 21:54:05,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:54:05,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:54:05,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184704393] [2019-12-26 21:54:05,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:54:05,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:54:05,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:54:05,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:54:05,990 INFO L87 Difference]: Start difference. First operand 1280 states and 2742 transitions. Second operand 3 states. [2019-12-26 21:54:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:54:06,007 INFO L93 Difference]: Finished difference Result 1279 states and 2740 transitions. [2019-12-26 21:54:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:54:06,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 21:54:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:54:06,009 INFO L225 Difference]: With dead ends: 1279 [2019-12-26 21:54:06,009 INFO L226 Difference]: Without dead ends: 1279 [2019-12-26 21:54:06,010 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-26 21:54:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-12-26 21:54:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 878. [2019-12-26 21:54:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-26 21:54:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1910 transitions. [2019-12-26 21:54:06,026 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1910 transitions. Word has length 52 [2019-12-26 21:54:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:54:06,026 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1910 transitions. [2019-12-26 21:54:06,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:54:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1910 transitions. [2019-12-26 21:54:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:54:06,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:54:06,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:54:06,029 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:54:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:54:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-26 21:54:06,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:54:06,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621659905] [2019-12-26 21:54:06,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:54:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:54:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:54:06,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:54:06,191 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:54:06,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= |v_ULTIMATE.start_main_~#t589~0.offset_20| 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t589~0.base_29| 4)) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t589~0.base_29|) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29|) |v_ULTIMATE.start_main_~#t589~0.offset_20| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_14|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t589~0.base=|v_ULTIMATE.start_main_~#t589~0.base_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t589~0.offset=|v_ULTIMATE.start_main_~#t589~0.offset_20|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t590~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t590~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t589~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t589~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:54:06,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12|) |v_ULTIMATE.start_main_~#t590~0.offset_10| 1)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t590~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t590~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t590~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t590~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_10|, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t590~0.offset, ULTIMATE.start_main_~#t590~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 21:54:06,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 21:54:06,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1172310563 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1172310563 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1172310563| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1172310563| ~y$w_buff0_used~0_In-1172310563) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1172310563, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1172310563} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1172310563|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1172310563, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1172310563} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 21:54:06,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-458128381 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-458128381| |P1Thread1of1ForFork1_#t~ite14_Out-458128381|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-458128381| ~y$w_buff0~0_In-458128381)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-458128381 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-458128381 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-458128381 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-458128381 256) 0))) (= ~y$w_buff0~0_In-458128381 |P1Thread1of1ForFork1_#t~ite14_Out-458128381|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-458128381| |P1Thread1of1ForFork1_#t~ite14_Out-458128381|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458128381, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458128381, ~y$w_buff0~0=~y$w_buff0~0_In-458128381, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458128381, ~weak$$choice2~0=~weak$$choice2~0_In-458128381, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-458128381|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458128381} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458128381, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458128381, ~y$w_buff0~0=~y$w_buff0~0_In-458128381, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458128381, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-458128381|, ~weak$$choice2~0=~weak$$choice2~0_In-458128381, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-458128381|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458128381} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 21:54:06,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1181981059 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1181981059 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1181981059 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1181981059 256))) (= 0 (mod ~y$w_buff0_used~0_In-1181981059 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite17_Out-1181981059| ~y$w_buff1~0_In-1181981059) (= |P1Thread1of1ForFork1_#t~ite18_Out-1181981059| |P1Thread1of1ForFork1_#t~ite17_Out-1181981059|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite18_Out-1181981059| ~y$w_buff1~0_In-1181981059) (= |P1Thread1of1ForFork1_#t~ite17_In-1181981059| |P1Thread1of1ForFork1_#t~ite17_Out-1181981059|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1181981059, ~y$w_buff1~0=~y$w_buff1~0_In-1181981059, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1181981059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1181981059, ~weak$$choice2~0=~weak$$choice2~0_In-1181981059, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1181981059|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1181981059} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1181981059, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1181981059|, ~y$w_buff1~0=~y$w_buff1~0_In-1181981059, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1181981059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1181981059, ~weak$$choice2~0=~weak$$choice2~0_In-1181981059, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1181981059|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1181981059} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 21:54:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-988371153 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-988371153 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-988371153 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-988371153 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-988371153| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-988371153| ~y$w_buff1_used~0_In-988371153) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-988371153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-988371153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-988371153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-988371153} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-988371153|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-988371153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-988371153, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-988371153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-988371153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 21:54:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1814549794 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1814549794 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-1814549794) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1814549794 ~y$r_buff0_thd1~0_Out-1814549794)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814549794, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1814549794} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814549794, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1814549794|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1814549794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:54:06,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-879913715 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-879913715 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-879913715 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-879913715 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-879913715| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-879913715| ~y$r_buff1_thd1~0_In-879913715) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-879913715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-879913715, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-879913715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-879913715} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-879913715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-879913715, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-879913715|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-879913715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-879913715} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 21:54:06,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1426457597 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1426457597| ~y$w_buff0_used~0_In1426457597) (= |P1Thread1of1ForFork1_#t~ite20_In1426457597| |P1Thread1of1ForFork1_#t~ite20_Out1426457597|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1426457597| ~y$w_buff0_used~0_In1426457597) (= |P1Thread1of1ForFork1_#t~ite20_Out1426457597| |P1Thread1of1ForFork1_#t~ite21_Out1426457597|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1426457597 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1426457597 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1426457597 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1426457597 256)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1426457597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1426457597, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1426457597|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1426457597, ~weak$$choice2~0=~weak$$choice2~0_In1426457597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1426457597} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1426457597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1426457597, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1426457597|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1426457597, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1426457597|, ~weak$$choice2~0=~weak$$choice2~0_In1426457597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1426457597} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:54:06,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 21:54:06,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-567304802 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-567304802 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-567304802 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-567304802 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-567304802 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out-567304802| |P1Thread1of1ForFork1_#t~ite29_Out-567304802|) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-567304802| ~y$r_buff1_thd2~0_In-567304802)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out-567304802| ~y$r_buff1_thd2~0_In-567304802) (= |P1Thread1of1ForFork1_#t~ite29_In-567304802| |P1Thread1of1ForFork1_#t~ite29_Out-567304802|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-567304802, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-567304802|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-567304802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-567304802, ~weak$$choice2~0=~weak$$choice2~0_In-567304802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567304802} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-567304802, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-567304802|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-567304802|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-567304802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-567304802, ~weak$$choice2~0=~weak$$choice2~0_In-567304802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567304802} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 21:54:06,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:54:06,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 21:54:06,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1588492670 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1588492670 256)))) (or (and (= ~y~0_In1588492670 |P1Thread1of1ForFork1_#t~ite32_Out1588492670|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1588492670| ~y$w_buff1~0_In1588492670) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1588492670, ~y$w_buff1~0=~y$w_buff1~0_In1588492670, ~y~0=~y~0_In1588492670, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1588492670} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1588492670, ~y$w_buff1~0=~y$w_buff1~0_In1588492670, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1588492670|, ~y~0=~y~0_In1588492670, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1588492670} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 21:54:06,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 21:54:06,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In887222475 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In887222475 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out887222475| ~y$w_buff0_used~0_In887222475) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out887222475| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In887222475, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In887222475} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In887222475, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In887222475, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out887222475|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 21:54:06,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In933673521 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In933673521 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In933673521 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In933673521 256) 0))) (or (and (= ~y$w_buff1_used~0_In933673521 |P1Thread1of1ForFork1_#t~ite35_Out933673521|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out933673521|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In933673521, ~y$w_buff0_used~0=~y$w_buff0_used~0_In933673521, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In933673521, ~y$w_buff1_used~0=~y$w_buff1_used~0_In933673521} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In933673521, ~y$w_buff0_used~0=~y$w_buff0_used~0_In933673521, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In933673521, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out933673521|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In933673521} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 21:54:06,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In747817131 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In747817131 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out747817131|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In747817131 |P1Thread1of1ForFork1_#t~ite36_Out747817131|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In747817131, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In747817131} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In747817131, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In747817131, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out747817131|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 21:54:06,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In641144739 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In641144739 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In641144739 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In641144739 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out641144739|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In641144739 |P1Thread1of1ForFork1_#t~ite37_Out641144739|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In641144739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641144739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641144739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641144739} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In641144739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641144739, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641144739, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out641144739|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641144739} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:54:06,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:54:06,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:54:06,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-331877471 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-331877471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-331877471| ~y$w_buff1~0_In-331877471) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-331877471| ~y~0_In-331877471)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-331877471, ~y~0=~y~0_In-331877471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-331877471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-331877471} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-331877471|, ~y$w_buff1~0=~y$w_buff1~0_In-331877471, ~y~0=~y~0_In-331877471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-331877471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-331877471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 21:54:06,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 21:54:06,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-817291266 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-817291266 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-817291266|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-817291266 |ULTIMATE.start_main_#t~ite42_Out-817291266|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-817291266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-817291266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-817291266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-817291266, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-817291266|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:54:06,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1369687256 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1369687256 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1369687256 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1369687256 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1369687256| ~y$w_buff1_used~0_In-1369687256)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1369687256| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1369687256, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1369687256, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1369687256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1369687256} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1369687256, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1369687256, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1369687256|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1369687256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1369687256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 21:54:06,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1100475535 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1100475535 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1100475535| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1100475535| ~y$r_buff0_thd0~0_In1100475535)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1100475535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1100475535} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1100475535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1100475535, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1100475535|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:54:06,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1038052979 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1038052979 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1038052979 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1038052979 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1038052979 |ULTIMATE.start_main_#t~ite45_Out1038052979|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1038052979|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1038052979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1038052979, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038052979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038052979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1038052979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1038052979, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038052979, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1038052979|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038052979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:54:06,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:54:06,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:54:06 BasicIcfg [2019-12-26 21:54:06,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:54:06,295 INFO L168 Benchmark]: Toolchain (without parser) took 18747.90 ms. Allocated memory was 147.8 MB in the beginning and 631.8 MB in the end (delta: 483.9 MB). Free memory was 104.0 MB in the beginning and 211.1 MB in the end (delta: -107.1 MB). Peak memory consumption was 376.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:06,296 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 147.8 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 21:54:06,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.43 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.6 MB in the beginning and 158.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:06,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 204.5 MB. Free memory was 158.8 MB in the beginning and 156.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:06,298 INFO L168 Benchmark]: Boogie Preprocessor took 36.23 ms. Allocated memory is still 204.5 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:06,302 INFO L168 Benchmark]: RCFGBuilder took 818.36 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 109.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:06,303 INFO L168 Benchmark]: TraceAbstraction took 17017.90 ms. Allocated memory was 204.5 MB in the beginning and 631.8 MB in the end (delta: 427.3 MB). Free memory was 109.4 MB in the beginning and 211.1 MB in the end (delta: -101.6 MB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:54:06,309 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.51 ms. Allocated memory is still 147.8 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.43 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.6 MB in the beginning and 158.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 204.5 MB. Free memory was 158.8 MB in the beginning and 156.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.23 ms. Allocated memory is still 204.5 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.36 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 109.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17017.90 ms. Allocated memory was 204.5 MB in the beginning and 631.8 MB in the end (delta: 427.3 MB). Free memory was 109.4 MB in the beginning and 211.1 MB in the end (delta: -101.6 MB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2105 SDtfs, 2383 SDslu, 4179 SDs, 0 SdLazy, 3202 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 11142 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 50209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...