/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:56,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:56,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:56,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:56,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:56,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:56,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:56,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:56,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:56,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:56,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:56,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:56,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:56,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:56,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:56,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:56,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:56,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:56,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:56,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:56,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:56,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:56,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:56,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:56,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:56,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:56,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:56,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:56,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:56,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:56,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:56,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:56,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:56,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:56,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:56,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:56,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:56,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:56,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:56,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:56,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:56,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:03:56,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:56,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:56,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:56,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:56,435 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:56,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:56,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:56,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:56,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:56,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:56,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:56,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:56,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:56,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:56,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:56,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:56,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:56,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:56,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:56,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:56,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:56,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:56,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:56,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:56,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:56,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:56,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:56,440 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:56,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:56,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:56,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:56,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:56,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:56,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:56,724 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:56,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-18 23:03:56,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f9f50ef/64090a6c63284cf18df5aa39acab5227/FLAG1d7b01af3 [2019-12-18 23:03:57,262 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:57,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-18 23:03:57,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f9f50ef/64090a6c63284cf18df5aa39acab5227/FLAG1d7b01af3 [2019-12-18 23:03:57,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f9f50ef/64090a6c63284cf18df5aa39acab5227 [2019-12-18 23:03:57,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:57,616 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:57,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:57,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:57,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:57,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570dfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:57, skipping insertion in model container [2019-12-18 23:03:57,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:57" (1/1) ... [2019-12-18 23:03:57,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:57,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:58,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:58,284 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:58,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:58,431 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:58,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58 WrapperNode [2019-12-18 23:03:58,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:58,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:58,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:58,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:58,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:58,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:58,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:58,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:58,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (1/1) ... [2019-12-18 23:03:58,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:58,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:58,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:58,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:58,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (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-18 23:03:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:58,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:58,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:03:58,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:03:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:58,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:58,626 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:03:59,371 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:59,371 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:59,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:59 BoogieIcfgContainer [2019-12-18 23:03:59,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:59,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:59,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:59,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:59,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:57" (1/3) ... [2019-12-18 23:03:59,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97bcb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:59, skipping insertion in model container [2019-12-18 23:03:59,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:58" (2/3) ... [2019-12-18 23:03:59,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97bcb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:59, skipping insertion in model container [2019-12-18 23:03:59,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:59" (3/3) ... [2019-12-18 23:03:59,383 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2019-12-18 23:03:59,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:59,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:59,403 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:59,404 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:59,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,462 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,462 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,462 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,474 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,476 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,476 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:59,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:03:59,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:59,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:59,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:59,541 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:59,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:59,545 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:59,545 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:59,545 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:59,568 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 23:03:59,578 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 23:03:59,685 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 23:03:59,686 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:59,701 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:03:59,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 23:03:59,764 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 23:03:59,764 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:59,776 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 23:03:59,790 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 23:03:59,791 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:04:03,215 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 23:04:03,338 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 23:04:03,355 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50143 [2019-12-18 23:04:03,355 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 23:04:03,358 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 93 transitions [2019-12-18 23:04:04,406 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16438 states. [2019-12-18 23:04:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16438 states. [2019-12-18 23:04:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 23:04:04,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:04,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:04,417 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1237806690, now seen corresponding path program 1 times [2019-12-18 23:04:04,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:04,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615227804] [2019-12-18 23:04:04,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:04,681 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-18 23:04:04,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615227804] [2019-12-18 23:04:04,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:04,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:04:04,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134772507] [2019-12-18 23:04:04,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:04,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:04,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:04,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:04,707 INFO L87 Difference]: Start difference. First operand 16438 states. Second operand 3 states. [2019-12-18 23:04:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:05,132 INFO L93 Difference]: Finished difference Result 16294 states and 61568 transitions. [2019-12-18 23:04:05,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:05,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 23:04:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:05,362 INFO L225 Difference]: With dead ends: 16294 [2019-12-18 23:04:05,363 INFO L226 Difference]: Without dead ends: 15956 [2019-12-18 23:04:05,367 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-18 23:04:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15956 states. [2019-12-18 23:04:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15956 to 15956. [2019-12-18 23:04:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15956 states. [2019-12-18 23:04:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15956 states to 15956 states and 60359 transitions. [2019-12-18 23:04:07,120 INFO L78 Accepts]: Start accepts. Automaton has 15956 states and 60359 transitions. Word has length 7 [2019-12-18 23:04:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:07,121 INFO L462 AbstractCegarLoop]: Abstraction has 15956 states and 60359 transitions. [2019-12-18 23:04:07,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 15956 states and 60359 transitions. [2019-12-18 23:04:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:07,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:07,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:07,132 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1710281022, now seen corresponding path program 1 times [2019-12-18 23:04:07,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:07,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722905819] [2019-12-18 23:04:07,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:07,300 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-18 23:04:07,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722905819] [2019-12-18 23:04:07,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:07,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:07,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160724481] [2019-12-18 23:04:07,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:07,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:07,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:07,303 INFO L87 Difference]: Start difference. First operand 15956 states and 60359 transitions. Second operand 4 states. [2019-12-18 23:04:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:08,019 INFO L93 Difference]: Finished difference Result 25372 states and 91919 transitions. [2019-12-18 23:04:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:08,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:04:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:08,138 INFO L225 Difference]: With dead ends: 25372 [2019-12-18 23:04:08,139 INFO L226 Difference]: Without dead ends: 25358 [2019-12-18 23:04:08,139 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-18 23:04:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25358 states. [2019-12-18 23:04:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25358 to 22934. [2019-12-18 23:04:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22934 states. [2019-12-18 23:04:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22934 states to 22934 states and 84256 transitions. [2019-12-18 23:04:09,257 INFO L78 Accepts]: Start accepts. Automaton has 22934 states and 84256 transitions. Word has length 13 [2019-12-18 23:04:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:09,258 INFO L462 AbstractCegarLoop]: Abstraction has 22934 states and 84256 transitions. [2019-12-18 23:04:09,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22934 states and 84256 transitions. [2019-12-18 23:04:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:09,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:09,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:09,261 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 294680669, now seen corresponding path program 1 times [2019-12-18 23:04:09,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:09,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874230098] [2019-12-18 23:04:09,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:09,316 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-18 23:04:09,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874230098] [2019-12-18 23:04:09,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:09,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:09,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822651474] [2019-12-18 23:04:09,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:09,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:09,318 INFO L87 Difference]: Start difference. First operand 22934 states and 84256 transitions. Second operand 3 states. [2019-12-18 23:04:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:09,375 INFO L93 Difference]: Finished difference Result 13067 states and 41594 transitions. [2019-12-18 23:04:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:09,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 23:04:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:09,422 INFO L225 Difference]: With dead ends: 13067 [2019-12-18 23:04:09,422 INFO L226 Difference]: Without dead ends: 13067 [2019-12-18 23:04:09,422 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-18 23:04:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13067 states. [2019-12-18 23:04:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13067 to 13067. [2019-12-18 23:04:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13067 states. [2019-12-18 23:04:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13067 states to 13067 states and 41594 transitions. [2019-12-18 23:04:09,778 INFO L78 Accepts]: Start accepts. Automaton has 13067 states and 41594 transitions. Word has length 13 [2019-12-18 23:04:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:09,779 INFO L462 AbstractCegarLoop]: Abstraction has 13067 states and 41594 transitions. [2019-12-18 23:04:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 13067 states and 41594 transitions. [2019-12-18 23:04:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:04:09,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:09,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:09,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 217378403, now seen corresponding path program 1 times [2019-12-18 23:04:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:09,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476636737] [2019-12-18 23:04:09,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:09,823 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-18 23:04:09,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476636737] [2019-12-18 23:04:09,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:09,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:09,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18767531] [2019-12-18 23:04:09,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:09,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:09,825 INFO L87 Difference]: Start difference. First operand 13067 states and 41594 transitions. Second operand 4 states. [2019-12-18 23:04:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:09,849 INFO L93 Difference]: Finished difference Result 1935 states and 4552 transitions. [2019-12-18 23:04:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:04:09,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 23:04:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:09,855 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 23:04:09,856 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 23:04:09,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 23:04:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 23:04:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 23:04:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4552 transitions. [2019-12-18 23:04:10,465 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4552 transitions. Word has length 14 [2019-12-18 23:04:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:10,465 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4552 transitions. [2019-12-18 23:04:10,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4552 transitions. [2019-12-18 23:04:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 23:04:10,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:10,467 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-18 23:04:10,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1829602713, now seen corresponding path program 1 times [2019-12-18 23:04:10,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:10,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772638122] [2019-12-18 23:04:10,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:10,564 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-18 23:04:10,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772638122] [2019-12-18 23:04:10,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:10,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:10,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964237535] [2019-12-18 23:04:10,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:10,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:10,567 INFO L87 Difference]: Start difference. First operand 1935 states and 4552 transitions. Second operand 5 states. [2019-12-18 23:04:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:10,603 INFO L93 Difference]: Finished difference Result 629 states and 1474 transitions. [2019-12-18 23:04:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:10,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 23:04:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:10,606 INFO L225 Difference]: With dead ends: 629 [2019-12-18 23:04:10,606 INFO L226 Difference]: Without dead ends: 629 [2019-12-18 23:04:10,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-18 23:04:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 573. [2019-12-18 23:04:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-18 23:04:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1342 transitions. [2019-12-18 23:04:10,616 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1342 transitions. Word has length 26 [2019-12-18 23:04:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:10,616 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1342 transitions. [2019-12-18 23:04:10,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1342 transitions. [2019-12-18 23:04:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:04:10,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:10,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:10,619 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -572389292, now seen corresponding path program 1 times [2019-12-18 23:04:10,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:10,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320286958] [2019-12-18 23:04:10,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:10,730 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-18 23:04:10,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320286958] [2019-12-18 23:04:10,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:10,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:10,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897356897] [2019-12-18 23:04:10,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:10,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:10,732 INFO L87 Difference]: Start difference. First operand 573 states and 1342 transitions. Second operand 3 states. [2019-12-18 23:04:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:10,785 INFO L93 Difference]: Finished difference Result 583 states and 1352 transitions. [2019-12-18 23:04:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:10,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:04:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:10,788 INFO L225 Difference]: With dead ends: 583 [2019-12-18 23:04:10,788 INFO L226 Difference]: Without dead ends: 583 [2019-12-18 23:04:10,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-12-18 23:04:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 579. [2019-12-18 23:04:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-18 23:04:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1348 transitions. [2019-12-18 23:04:10,799 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1348 transitions. Word has length 55 [2019-12-18 23:04:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:10,799 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1348 transitions. [2019-12-18 23:04:10,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1348 transitions. [2019-12-18 23:04:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:04:10,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:10,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:10,802 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1691317009, now seen corresponding path program 1 times [2019-12-18 23:04:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:10,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095878659] [2019-12-18 23:04:10,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:11,018 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-18 23:04:11,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095878659] [2019-12-18 23:04:11,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:11,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:04:11,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653380318] [2019-12-18 23:04:11,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:04:11,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:11,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:04:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:11,020 INFO L87 Difference]: Start difference. First operand 579 states and 1348 transitions. Second operand 7 states. [2019-12-18 23:04:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:11,151 INFO L93 Difference]: Finished difference Result 978 states and 2170 transitions. [2019-12-18 23:04:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:04:11,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 23:04:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:11,153 INFO L225 Difference]: With dead ends: 978 [2019-12-18 23:04:11,153 INFO L226 Difference]: Without dead ends: 385 [2019-12-18 23:04:11,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:04:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-18 23:04:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 331. [2019-12-18 23:04:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 23:04:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 607 transitions. [2019-12-18 23:04:11,159 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 607 transitions. Word has length 55 [2019-12-18 23:04:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:11,160 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 607 transitions. [2019-12-18 23:04:11,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:04:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 607 transitions. [2019-12-18 23:04:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:04:11,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:11,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:11,161 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash -328148341, now seen corresponding path program 2 times [2019-12-18 23:04:11,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:11,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926331531] [2019-12-18 23:04:11,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:11,249 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-18 23:04:11,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926331531] [2019-12-18 23:04:11,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:11,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:11,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159898740] [2019-12-18 23:04:11,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:11,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:11,251 INFO L87 Difference]: Start difference. First operand 331 states and 607 transitions. Second operand 5 states. [2019-12-18 23:04:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:11,454 INFO L93 Difference]: Finished difference Result 478 states and 875 transitions. [2019-12-18 23:04:11,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:04:11,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 23:04:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:11,456 INFO L225 Difference]: With dead ends: 478 [2019-12-18 23:04:11,456 INFO L226 Difference]: Without dead ends: 478 [2019-12-18 23:04:11,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 23:04:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-18 23:04:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 394. [2019-12-18 23:04:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-18 23:04:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 730 transitions. [2019-12-18 23:04:11,462 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 730 transitions. Word has length 55 [2019-12-18 23:04:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:11,463 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 730 transitions. [2019-12-18 23:04:11,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 730 transitions. [2019-12-18 23:04:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:04:11,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:11,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, 1, 1, 1, 1] [2019-12-18 23:04:11,464 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1295367571, now seen corresponding path program 3 times [2019-12-18 23:04:11,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:11,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859095174] [2019-12-18 23:04:11,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:11,521 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-18 23:04:11,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859095174] [2019-12-18 23:04:11,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:11,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:11,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338323333] [2019-12-18 23:04:11,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:11,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:11,523 INFO L87 Difference]: Start difference. First operand 394 states and 730 transitions. Second operand 3 states. [2019-12-18 23:04:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:11,536 INFO L93 Difference]: Finished difference Result 394 states and 715 transitions. [2019-12-18 23:04:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:11,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:04:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:11,537 INFO L225 Difference]: With dead ends: 394 [2019-12-18 23:04:11,537 INFO L226 Difference]: Without dead ends: 394 [2019-12-18 23:04:11,538 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-18 23:04:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-18 23:04:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 376. [2019-12-18 23:04:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-18 23:04:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 682 transitions. [2019-12-18 23:04:11,543 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 682 transitions. Word has length 55 [2019-12-18 23:04:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:11,543 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 682 transitions. [2019-12-18 23:04:11,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 682 transitions. [2019-12-18 23:04:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:04:11,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:11,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:11,545 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1278939636, now seen corresponding path program 1 times [2019-12-18 23:04:11,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:11,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728574483] [2019-12-18 23:04:11,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:11,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728574483] [2019-12-18 23:04:11,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:11,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:04:11,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705601885] [2019-12-18 23:04:11,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:04:11,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:04:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:11,717 INFO L87 Difference]: Start difference. First operand 376 states and 682 transitions. Second operand 6 states. [2019-12-18 23:04:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:12,059 INFO L93 Difference]: Finished difference Result 526 states and 949 transitions. [2019-12-18 23:04:12,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:04:12,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 23:04:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:12,061 INFO L225 Difference]: With dead ends: 526 [2019-12-18 23:04:12,061 INFO L226 Difference]: Without dead ends: 526 [2019-12-18 23:04:12,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:04:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-18 23:04:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 419. [2019-12-18 23:04:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-18 23:04:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 761 transitions. [2019-12-18 23:04:12,069 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 761 transitions. Word has length 56 [2019-12-18 23:04:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:12,069 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 761 transitions. [2019-12-18 23:04:12,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:04:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 761 transitions. [2019-12-18 23:04:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:04:12,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:12,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:12,071 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1815043520, now seen corresponding path program 2 times [2019-12-18 23:04:12,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:12,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824819190] [2019-12-18 23:04:12,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:04:12,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824819190] [2019-12-18 23:04:12,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:12,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:12,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211922008] [2019-12-18 23:04:12,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:12,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:12,146 INFO L87 Difference]: Start difference. First operand 419 states and 761 transitions. Second operand 3 states. [2019-12-18 23:04:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:12,205 INFO L93 Difference]: Finished difference Result 419 states and 760 transitions. [2019-12-18 23:04:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:12,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 23:04:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:12,206 INFO L225 Difference]: With dead ends: 419 [2019-12-18 23:04:12,207 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 23:04:12,207 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-18 23:04:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 23:04:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 278. [2019-12-18 23:04:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-18 23:04:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 502 transitions. [2019-12-18 23:04:12,212 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 502 transitions. Word has length 56 [2019-12-18 23:04:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:12,213 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 502 transitions. [2019-12-18 23:04:12,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 502 transitions. [2019-12-18 23:04:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:04:12,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:12,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:12,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1847274299, now seen corresponding path program 1 times [2019-12-18 23:04:12,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:12,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453332051] [2019-12-18 23:04:12,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:12,534 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-18 23:04:12,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453332051] [2019-12-18 23:04:12,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:12,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:04:12,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418697659] [2019-12-18 23:04:12,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:04:12,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:04:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:04:12,537 INFO L87 Difference]: Start difference. First operand 278 states and 502 transitions. Second operand 13 states. [2019-12-18 23:04:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:13,197 INFO L93 Difference]: Finished difference Result 484 states and 852 transitions. [2019-12-18 23:04:13,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:04:13,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 23:04:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:13,200 INFO L225 Difference]: With dead ends: 484 [2019-12-18 23:04:13,200 INFO L226 Difference]: Without dead ends: 452 [2019-12-18 23:04:13,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:04:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-18 23:04:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 378. [2019-12-18 23:04:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-18 23:04:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 673 transitions. [2019-12-18 23:04:13,209 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 673 transitions. Word has length 57 [2019-12-18 23:04:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:13,209 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 673 transitions. [2019-12-18 23:04:13,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:04:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 673 transitions. [2019-12-18 23:04:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:04:13,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:13,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:13,211 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1476167727, now seen corresponding path program 2 times [2019-12-18 23:04:13,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:13,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119201542] [2019-12-18 23:04:13,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:13,518 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-18 23:04:13,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119201542] [2019-12-18 23:04:13,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:13,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:04:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904896622] [2019-12-18 23:04:13,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 23:04:13,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 23:04:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:04:13,520 INFO L87 Difference]: Start difference. First operand 378 states and 673 transitions. Second operand 14 states. [2019-12-18 23:04:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:14,112 INFO L93 Difference]: Finished difference Result 480 states and 826 transitions. [2019-12-18 23:04:14,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:04:14,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 23:04:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:14,115 INFO L225 Difference]: With dead ends: 480 [2019-12-18 23:04:14,115 INFO L226 Difference]: Without dead ends: 448 [2019-12-18 23:04:14,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:04:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-12-18 23:04:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 386. [2019-12-18 23:04:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-18 23:04:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 687 transitions. [2019-12-18 23:04:14,121 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 687 transitions. Word has length 57 [2019-12-18 23:04:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:14,122 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 687 transitions. [2019-12-18 23:04:14,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 23:04:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 687 transitions. [2019-12-18 23:04:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 23:04:14,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:14,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, 1, 1, 1, 1, 1] [2019-12-18 23:04:14,124 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:14,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1248889277, now seen corresponding path program 3 times [2019-12-18 23:04:14,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:14,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381213786] [2019-12-18 23:04:14,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:04:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:04:14,246 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:04:14,246 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:04:14,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~y$w_buff1~0_28) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22| 1)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd0~0_79 0) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~z~0_14 0) (= 0 v_~y$w_buff0~0_28) (= v_~y$r_buff0_thd1~0_9 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22|) 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2516~0.base_22|) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$r_buff1_thd2~0_19) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_cnt~0_23) (= v_~y~0_27 0) (= 0 v_~y$r_buff1_thd0~0_50) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t2516~0.offset_17|) (= v_~y$w_buff0_used~0_107 0) (= v_~y$mem_tmp~0_10 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22|) |v_ULTIMATE.start_main_~#t2516~0.offset_17| 0)) |v_#memory_int_19|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2516~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_~#t2516~0.base=|v_ULTIMATE.start_main_~#t2516~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t2516~0.offset=|v_ULTIMATE.start_main_~#t2516~0.offset_17|, ~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_107, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_9|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_27, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_18|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_19|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_11|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2516~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2517~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2516~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2518~0.base, ULTIMATE.start_main_~#t2517~0.base, ULTIMATE.start_main_~#t2518~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:04:14,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2517~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2517~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11|) |v_ULTIMATE.start_main_~#t2517~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2517~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2517~0.base_11| 0)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2517~0.offset, ULTIMATE.start_main_~#t2517~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 23:04:14,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L804-1-->L806: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2518~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10|) |v_ULTIMATE.start_main_~#t2518~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2518~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2518~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2518~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2518~0.base] because there is no mapped edge [2019-12-18 23:04:14,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= 1 v_~y$w_buff0_used~0_73) (= 2 v_~y$w_buff0~0_16) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_17, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:04:14,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_10 2) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z~0=v_~z~0_10, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 23:04:14,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1935655808 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1935655808 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out1935655808| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1935655808 |P2Thread1of1ForFork0_#t~ite11_Out1935655808|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1935655808, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1935655808} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1935655808, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1935655808|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1935655808} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 23:04:14,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out-1549706441| |P1Thread1of1ForFork2_#t~ite3_Out-1549706441|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1549706441 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1549706441 256)))) (or (and .cse0 (= ~y~0_In-1549706441 |P1Thread1of1ForFork2_#t~ite3_Out-1549706441|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= ~y$w_buff1~0_In-1549706441 |P1Thread1of1ForFork2_#t~ite3_Out-1549706441|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1549706441, ~y$w_buff1~0=~y$w_buff1~0_In-1549706441, ~y~0=~y~0_In-1549706441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1549706441} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1549706441, ~y$w_buff1~0=~y$w_buff1~0_In-1549706441, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1549706441|, ~y~0=~y~0_In-1549706441, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1549706441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1549706441} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 23:04:14,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-338298336 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-338298336 256) 0))) (or (and (= ~y$w_buff0_used~0_In-338298336 |P1Thread1of1ForFork2_#t~ite5_Out-338298336|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-338298336| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-338298336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-338298336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-338298336, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-338298336, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-338298336|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 23:04:14,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1929674153 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1929674153 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1929674153 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1929674153 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1929674153|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1929674153 |P2Thread1of1ForFork0_#t~ite12_Out1929674153|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1929674153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1929674153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1929674153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1929674153} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1929674153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1929674153, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1929674153|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1929674153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1929674153} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 23:04:14,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-141636387 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-141636387 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-141636387 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-141636387 256) 0))) (or (and (= ~y$w_buff1_used~0_In-141636387 |P1Thread1of1ForFork2_#t~ite6_Out-141636387|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-141636387|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-141636387, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-141636387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-141636387, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-141636387} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-141636387, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-141636387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-141636387, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-141636387|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-141636387} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 23:04:14,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1319799847 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1319799847 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1319799847| ~y$r_buff0_thd2~0_In1319799847)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out1319799847| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1319799847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319799847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1319799847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1319799847, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1319799847|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 23:04:14,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1552478256 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1552478256 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1552478256 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1552478256 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite8_Out-1552478256| ~y$r_buff1_thd2~0_In-1552478256) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1552478256| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1552478256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1552478256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1552478256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1552478256} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1552478256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1552478256, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1552478256|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1552478256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1552478256} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 23:04:14,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L754-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 23:04:14,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1989910979 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1989910979 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out1989910979) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In1989910979 ~y$r_buff0_thd3~0_Out1989910979) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1989910979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1989910979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1989910979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1989910979, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1989910979|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 23:04:14,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2040796345 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2040796345 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2040796345 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2040796345 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-2040796345|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd3~0_In-2040796345 |P2Thread1of1ForFork0_#t~ite14_Out-2040796345|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2040796345, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040796345, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2040796345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040796345} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2040796345|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2040796345, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040796345, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2040796345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040796345} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 23:04:14,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 23:04:14,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:04:14,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1035164537 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1035164537 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-1035164537| |ULTIMATE.start_main_#t~ite18_Out-1035164537|))) (or (and (or .cse0 .cse1) (= ~y~0_In-1035164537 |ULTIMATE.start_main_#t~ite18_Out-1035164537|) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out-1035164537| ~y$w_buff1~0_In-1035164537) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1035164537, ~y~0=~y~0_In-1035164537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1035164537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1035164537} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1035164537, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1035164537|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1035164537|, ~y~0=~y~0_In-1035164537, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1035164537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1035164537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 23:04:14,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-694191234 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-694191234 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-694191234|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-694191234| ~y$w_buff0_used~0_In-694191234) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-694191234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-694191234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-694191234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-694191234, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-694191234|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 23:04:14,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In693011675 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In693011675 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In693011675 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In693011675 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite21_Out693011675| ~y$w_buff1_used~0_In693011675)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite21_Out693011675|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In693011675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In693011675, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In693011675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In693011675} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In693011675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In693011675, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out693011675|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In693011675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In693011675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 23:04:14,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-405857885 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-405857885 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-405857885| ~y$r_buff0_thd0~0_In-405857885)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-405857885|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-405857885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-405857885} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-405857885, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-405857885, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-405857885|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 23:04:14,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1464732998 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1464732998 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1464732998 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1464732998 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1464732998 |ULTIMATE.start_main_#t~ite23_Out-1464732998|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1464732998|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464732998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1464732998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1464732998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464732998} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464732998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1464732998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1464732998, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1464732998|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464732998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 23:04:14,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L827-->L827-8: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-102104763 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In-102104763 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In-102104763 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-102104763 256))) (.cse3 (= 0 (mod ~weak$$choice2~0_In-102104763 256))) (.cse4 (= |ULTIMATE.start_main_#t~ite38_Out-102104763| |ULTIMATE.start_main_#t~ite39_Out-102104763|))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse1) .cse3 (= |ULTIMATE.start_main_#t~ite38_Out-102104763| |ULTIMATE.start_main_#t~ite37_Out-102104763|) .cse4 (= 0 |ULTIMATE.start_main_#t~ite37_Out-102104763|) (not .cse5))) (and (or (and (not .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-102104763| |ULTIMATE.start_main_#t~ite38_In-102104763|) (= |ULTIMATE.start_main_#t~ite39_Out-102104763| ~y$w_buff1_used~0_In-102104763)) (and (or (and .cse6 .cse0) .cse5 (and .cse6 .cse2)) .cse3 .cse4 (= |ULTIMATE.start_main_#t~ite38_Out-102104763| ~y$w_buff1_used~0_In-102104763))) (= |ULTIMATE.start_main_#t~ite37_In-102104763| |ULTIMATE.start_main_#t~ite37_Out-102104763|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-102104763, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-102104763, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-102104763|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-102104763|, ~weak$$choice2~0=~weak$$choice2~0_In-102104763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-102104763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-102104763} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-102104763, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-102104763|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-102104763, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-102104763|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-102104763|, ~weak$$choice2~0=~weak$$choice2~0_In-102104763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-102104763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-102104763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 23:04:14,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff0_thd0~0_62)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 23:04:14,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L831-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= v_~y~0_22 v_~y$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:04:14,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 23:04:14,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:04:14 BasicIcfg [2019-12-18 23:04:14,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:04:14,393 INFO L168 Benchmark]: Toolchain (without parser) took 16777.39 ms. Allocated memory was 140.0 MB in the beginning and 748.7 MB in the end (delta: 608.7 MB). Free memory was 101.4 MB in the beginning and 335.8 MB in the end (delta: -234.3 MB). Peak memory consumption was 374.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,394 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.91 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 158.3 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,396 INFO L168 Benchmark]: Boogie Preprocessor took 38.95 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,401 INFO L168 Benchmark]: RCFGBuilder took 828.66 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 106.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,402 INFO L168 Benchmark]: TraceAbstraction took 15016.70 ms. Allocated memory was 204.5 MB in the beginning and 748.7 MB in the end (delta: 544.2 MB). Free memory was 106.4 MB in the beginning and 335.8 MB in the end (delta: -229.4 MB). Peak memory consumption was 314.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:14,409 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.52 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.91 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 158.3 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.95 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.66 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 106.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15016.70 ms. Allocated memory was 204.5 MB in the beginning and 748.7 MB in the end (delta: 544.2 MB). Free memory was 106.4 MB in the beginning and 335.8 MB in the end (delta: -229.4 MB). Peak memory consumption was 314.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 25 ChoiceCompositions, 4072 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50143 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1282 SDtfs, 1302 SDslu, 2938 SDs, 0 SdLazy, 1551 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22934occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 3024 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 95222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...