/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/mix024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:45:49,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:45:49,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:45:49,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:45:49,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:45:49,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:45:49,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:45:49,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:45:49,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:45:49,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:45:49,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:45:49,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:45:49,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:45:49,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:45:49,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:45:49,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:45:49,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:45:49,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:45:49,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:45:49,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:45:49,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:45:49,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:45:49,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:45:49,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:45:49,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:45:49,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:45:49,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:45:49,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:45:49,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:45:49,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:45:49,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:45:49,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:45:49,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:45:49,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:45:49,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:45:49,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:45:49,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:45:49,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:45:49,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:45:49,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:45:49,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:45:49,509 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 20:45:49,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:45:49,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:45:49,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:45:49,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:45:49,526 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:45:49,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:45:49,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:45:49,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:45:49,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:45:49,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:45:49,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:45:49,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:45:49,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:45:49,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:45:49,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:45:49,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:45:49,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:45:49,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:45:49,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:45:49,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:45:49,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:45:49,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:45:49,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:45:49,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:45:49,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:45:49,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:45:49,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:45:49,530 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:45:49,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:45:49,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:45:49,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:45:49,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:45:49,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:45:49,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:45:49,840 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:45:49,841 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-18 20:45:49,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9fd54d9/b7673e5d2b9e48e48aee3b8d6c3b88b6/FLAGa4f292d53 [2019-12-18 20:45:50,475 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:45:50,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-18 20:45:50,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9fd54d9/b7673e5d2b9e48e48aee3b8d6c3b88b6/FLAGa4f292d53 [2019-12-18 20:45:50,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9fd54d9/b7673e5d2b9e48e48aee3b8d6c3b88b6 [2019-12-18 20:45:50,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:45:50,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:45:50,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:45:50,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:45:50,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:45:50,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:45:50" (1/1) ... [2019-12-18 20:45:50,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a67259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:50, skipping insertion in model container [2019-12-18 20:45:50,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:45:50" (1/1) ... [2019-12-18 20:45:50,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:45:50,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:45:51,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:45:51,356 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:45:51,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:45:51,521 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:45:51,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51 WrapperNode [2019-12-18 20:45:51,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:45:51,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:45:51,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:45:51,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:45:51,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:45:51,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:45:51,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:45:51,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:45:51,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (1/1) ... [2019-12-18 20:45:51,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:45:51,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:45:51,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:45:51,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:45:51,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (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 20:45:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:45:51,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:45:51,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:45:51,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:45:51,705 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:45:51,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:45:51,706 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:45:51,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:45:51,706 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:45:51,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:45:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:45:51,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:45:51,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:45:51,709 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 20:45:52,446 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:45:52,446 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:45:52,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:45:52 BoogieIcfgContainer [2019-12-18 20:45:52,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:45:52,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:45:52,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:45:52,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:45:52,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:45:50" (1/3) ... [2019-12-18 20:45:52,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465665d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:45:52, skipping insertion in model container [2019-12-18 20:45:52,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:51" (2/3) ... [2019-12-18 20:45:52,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465665d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:45:52, skipping insertion in model container [2019-12-18 20:45:52,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:45:52" (3/3) ... [2019-12-18 20:45:52,456 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.opt.i [2019-12-18 20:45:52,467 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:45:52,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:45:52,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:45:52,476 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:45:52,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,520 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,520 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,583 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:52,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:45:52,633 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:45:52,633 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:45:52,633 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:45:52,634 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:45:52,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:45:52,634 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:45:52,634 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:45:52,634 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:45:52,652 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 20:45:52,654 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 20:45:52,738 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 20:45:52,738 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:45:52,756 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:45:52,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 20:45:52,827 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 20:45:52,827 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:45:52,836 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:45:52,856 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:45:52,857 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:45:56,584 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:45:56,752 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:45:56,784 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-18 20:45:56,787 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 20:45:56,791 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 20:46:06,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 20:46:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 20:46:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:46:06,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:06,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:46:06,880 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-18 20:46:06,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:06,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232153059] [2019-12-18 20:46:06,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:07,097 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 20:46:07,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232153059] [2019-12-18 20:46:07,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:07,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:46:07,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646023482] [2019-12-18 20:46:07,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:07,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:07,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:07,130 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 20:46:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:09,553 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 20:46:09,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:09,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:46:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:10,075 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 20:46:10,075 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 20:46:10,077 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 20:46:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 20:46:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 20:46:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 20:46:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 20:46:20,266 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 20:46:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:20,266 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 20:46:20,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 20:46:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:46:20,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:20,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:20,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-18 20:46:20,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:20,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156247658] [2019-12-18 20:46:20,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:20,384 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 20:46:20,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156247658] [2019-12-18 20:46:20,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:20,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:20,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076476420] [2019-12-18 20:46:20,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:20,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:20,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:20,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:20,387 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 20:46:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:20,608 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 20:46:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:20,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:46:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:20,669 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 20:46:20,669 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 20:46:20,670 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 20:46:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 20:46:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 20:46:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 20:46:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 20:46:21,232 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 20:46:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:21,232 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 20:46:21,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 20:46:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:46:21,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:21,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:21,235 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-18 20:46:21,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:21,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105848445] [2019-12-18 20:46:21,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:21,348 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 20:46:21,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105848445] [2019-12-18 20:46:21,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:21,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:21,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773520700] [2019-12-18 20:46:21,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:21,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:21,351 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 20:46:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:21,742 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 20:46:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:21,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:46:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:21,859 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 20:46:21,859 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 20:46:21,859 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 20:46:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 20:46:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 20:46:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 20:46:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 20:46:23,190 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 20:46:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:23,190 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 20:46:23,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 20:46:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:46:23,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:23,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:23,193 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-18 20:46:23,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:23,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311472885] [2019-12-18 20:46:23,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:23,296 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 20:46:23,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311472885] [2019-12-18 20:46:23,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:23,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:23,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957887751] [2019-12-18 20:46:23,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:23,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:23,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:23,303 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 20:46:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:23,655 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 20:46:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:23,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:46:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:23,744 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 20:46:23,745 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 20:46:23,745 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 20:46:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 20:46:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 20:46:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 20:46:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 20:46:24,908 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 20:46:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:24,909 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 20:46:24,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 20:46:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:46:24,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:24,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:24,911 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-18 20:46:24,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:24,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738024336] [2019-12-18 20:46:24,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:24,972 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 20:46:24,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738024336] [2019-12-18 20:46:24,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:24,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:24,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553326872] [2019-12-18 20:46:24,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:24,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:24,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:24,974 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 20:46:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:25,322 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 20:46:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:25,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:46:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:25,452 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 20:46:25,452 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 20:46:25,452 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 20:46:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 20:46:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 20:46:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 20:46:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 20:46:26,150 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 20:46:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:26,150 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 20:46:26,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 20:46:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:46:26,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:26,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] [2019-12-18 20:46:26,161 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-18 20:46:26,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:26,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939945766] [2019-12-18 20:46:26,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:26,284 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 20:46:26,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939945766] [2019-12-18 20:46:26,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:26,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:26,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543943038] [2019-12-18 20:46:26,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:26,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:26,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:26,286 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 20:46:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:26,856 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 20:46:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:46:26,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:46:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:27,254 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 20:46:27,255 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 20:46:27,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 20:46:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 20:46:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 20:46:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 20:46:27,963 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 20:46:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:27,963 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 20:46:27,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 20:46:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:46:27,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:27,974 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] [2019-12-18 20:46:27,974 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-18 20:46:27,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:27,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499890709] [2019-12-18 20:46:27,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:28,060 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 20:46:28,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499890709] [2019-12-18 20:46:28,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:28,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:28,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109260805] [2019-12-18 20:46:28,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:28,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:28,063 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 20:46:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:28,654 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 20:46:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:46:28,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:46:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:28,736 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 20:46:28,736 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 20:46:28,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 20:46:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 20:46:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 20:46:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 20:46:29,647 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 20:46:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:29,647 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 20:46:29,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 20:46:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:46:29,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:29,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:29,658 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-18 20:46:29,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:29,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693182082] [2019-12-18 20:46:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:29,700 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 20:46:29,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693182082] [2019-12-18 20:46:29,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:29,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:29,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566181628] [2019-12-18 20:46:29,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:29,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:29,703 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 20:46:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:29,766 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 20:46:29,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:46:29,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:46:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:29,783 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 20:46:29,783 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 20:46:29,784 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 20:46:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 20:46:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 20:46:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 20:46:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 20:46:29,950 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 20:46:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:29,950 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 20:46:29,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 20:46:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:46:29,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:29,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:29,966 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-18 20:46:29,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:29,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013411593] [2019-12-18 20:46:29,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:30,026 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 20:46:30,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013411593] [2019-12-18 20:46:30,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:30,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:46:30,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739257760] [2019-12-18 20:46:30,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:30,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:30,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:30,028 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 20:46:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:30,075 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-18 20:46:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:30,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:46:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:30,100 INFO L225 Difference]: With dead ends: 11488 [2019-12-18 20:46:30,100 INFO L226 Difference]: Without dead ends: 11488 [2019-12-18 20:46:30,100 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 20:46:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-18 20:46:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-18 20:46:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-18 20:46:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-18 20:46:30,357 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-18 20:46:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:30,357 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-18 20:46:30,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-18 20:46:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:46:30,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:30,381 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] [2019-12-18 20:46:30,382 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-18 20:46:30,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:30,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574897199] [2019-12-18 20:46:30,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:30,448 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 20:46:30,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574897199] [2019-12-18 20:46:30,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:30,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:46:30,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290396233] [2019-12-18 20:46:30,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:30,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:30,451 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-18 20:46:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:30,513 INFO L93 Difference]: Finished difference Result 10239 states and 32168 transitions. [2019-12-18 20:46:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:30,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:46:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:30,532 INFO L225 Difference]: With dead ends: 10239 [2019-12-18 20:46:30,533 INFO L226 Difference]: Without dead ends: 10239 [2019-12-18 20:46:30,533 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 20:46:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2019-12-18 20:46:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 9735. [2019-12-18 20:46:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-12-18 20:46:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 30758 transitions. [2019-12-18 20:46:30,687 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 30758 transitions. Word has length 40 [2019-12-18 20:46:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:30,687 INFO L462 AbstractCegarLoop]: Abstraction has 9735 states and 30758 transitions. [2019-12-18 20:46:30,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 30758 transitions. [2019-12-18 20:46:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:46:30,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:30,701 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] [2019-12-18 20:46:30,701 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-18 20:46:30,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:30,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370822703] [2019-12-18 20:46:30,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:30,763 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 20:46:30,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370822703] [2019-12-18 20:46:30,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:30,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:30,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773220354] [2019-12-18 20:46:30,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:30,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:30,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:30,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:30,766 INFO L87 Difference]: Start difference. First operand 9735 states and 30758 transitions. Second operand 3 states. [2019-12-18 20:46:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:30,858 INFO L93 Difference]: Finished difference Result 12683 states and 39352 transitions. [2019-12-18 20:46:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:30,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:46:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:30,885 INFO L225 Difference]: With dead ends: 12683 [2019-12-18 20:46:30,886 INFO L226 Difference]: Without dead ends: 12683 [2019-12-18 20:46:30,886 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 20:46:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-18 20:46:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 10393. [2019-12-18 20:46:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 20:46:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-18 20:46:31,212 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 54 [2019-12-18 20:46:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:31,212 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-18 20:46:31,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-18 20:46:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:46:31,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:31,228 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] [2019-12-18 20:46:31,228 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-18 20:46:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:31,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488611238] [2019-12-18 20:46:31,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:31,330 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 20:46:31,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488611238] [2019-12-18 20:46:31,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:31,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:46:31,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542145528] [2019-12-18 20:46:31,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:46:31,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:46:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:31,332 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 7 states. [2019-12-18 20:46:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:31,744 INFO L93 Difference]: Finished difference Result 26623 states and 83594 transitions. [2019-12-18 20:46:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:46:31,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:46:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:31,786 INFO L225 Difference]: With dead ends: 26623 [2019-12-18 20:46:31,786 INFO L226 Difference]: Without dead ends: 20927 [2019-12-18 20:46:31,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:46:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20927 states. [2019-12-18 20:46:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20927 to 13189. [2019-12-18 20:46:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-18 20:46:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 41908 transitions. [2019-12-18 20:46:32,057 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 41908 transitions. Word has length 54 [2019-12-18 20:46:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:32,058 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 41908 transitions. [2019-12-18 20:46:32,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:46:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 41908 transitions. [2019-12-18 20:46:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:46:32,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:32,078 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] [2019-12-18 20:46:32,078 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-18 20:46:32,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:32,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959548608] [2019-12-18 20:46:32,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:32,165 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 20:46:32,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959548608] [2019-12-18 20:46:32,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:32,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:46:32,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63642247] [2019-12-18 20:46:32,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:46:32,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:46:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:32,168 INFO L87 Difference]: Start difference. First operand 13189 states and 41908 transitions. Second operand 7 states. [2019-12-18 20:46:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:32,603 INFO L93 Difference]: Finished difference Result 34316 states and 106692 transitions. [2019-12-18 20:46:32,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:46:32,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:46:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:32,644 INFO L225 Difference]: With dead ends: 34316 [2019-12-18 20:46:32,644 INFO L226 Difference]: Without dead ends: 25449 [2019-12-18 20:46:32,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:46:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-18 20:46:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 17200. [2019-12-18 20:46:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17200 states. [2019-12-18 20:46:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 54622 transitions. [2019-12-18 20:46:32,987 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 54622 transitions. Word has length 54 [2019-12-18 20:46:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:32,988 INFO L462 AbstractCegarLoop]: Abstraction has 17200 states and 54622 transitions. [2019-12-18 20:46:32,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:46:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 54622 transitions. [2019-12-18 20:46:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:46:33,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:33,009 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] [2019-12-18 20:46:33,009 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash 714355520, now seen corresponding path program 3 times [2019-12-18 20:46:33,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:33,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941550080] [2019-12-18 20:46:33,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:33,152 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 20:46:33,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941550080] [2019-12-18 20:46:33,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:33,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:33,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354184341] [2019-12-18 20:46:33,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:46:33,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:33,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:46:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:33,156 INFO L87 Difference]: Start difference. First operand 17200 states and 54622 transitions. Second operand 9 states. [2019-12-18 20:46:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:35,086 INFO L93 Difference]: Finished difference Result 89167 states and 277833 transitions. [2019-12-18 20:46:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:46:35,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:46:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:35,213 INFO L225 Difference]: With dead ends: 89167 [2019-12-18 20:46:35,213 INFO L226 Difference]: Without dead ends: 76971 [2019-12-18 20:46:35,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 20:46:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76971 states. [2019-12-18 20:46:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76971 to 23213. [2019-12-18 20:46:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23213 states. [2019-12-18 20:46:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23213 states to 23213 states and 74466 transitions. [2019-12-18 20:46:36,064 INFO L78 Accepts]: Start accepts. Automaton has 23213 states and 74466 transitions. Word has length 54 [2019-12-18 20:46:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:36,064 INFO L462 AbstractCegarLoop]: Abstraction has 23213 states and 74466 transitions. [2019-12-18 20:46:36,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:46:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23213 states and 74466 transitions. [2019-12-18 20:46:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:46:36,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:36,101 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] [2019-12-18 20:46:36,101 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash 265762130, now seen corresponding path program 4 times [2019-12-18 20:46:36,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:36,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626120535] [2019-12-18 20:46:36,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:36,214 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 20:46:36,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626120535] [2019-12-18 20:46:36,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:36,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:36,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836979342] [2019-12-18 20:46:36,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:46:36,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:46:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:36,216 INFO L87 Difference]: Start difference. First operand 23213 states and 74466 transitions. Second operand 9 states. [2019-12-18 20:46:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:37,880 INFO L93 Difference]: Finished difference Result 69362 states and 216514 transitions. [2019-12-18 20:46:37,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 20:46:37,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:46:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:37,988 INFO L225 Difference]: With dead ends: 69362 [2019-12-18 20:46:37,989 INFO L226 Difference]: Without dead ends: 66294 [2019-12-18 20:46:37,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:46:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66294 states. [2019-12-18 20:46:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66294 to 22741. [2019-12-18 20:46:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22741 states. [2019-12-18 20:46:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 73038 transitions. [2019-12-18 20:46:38,685 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 73038 transitions. Word has length 54 [2019-12-18 20:46:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:38,686 INFO L462 AbstractCegarLoop]: Abstraction has 22741 states and 73038 transitions. [2019-12-18 20:46:38,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:46:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 73038 transitions. [2019-12-18 20:46:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:46:38,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:38,721 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] [2019-12-18 20:46:38,721 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-18 20:46:38,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:38,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433675801] [2019-12-18 20:46:38,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:38,824 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 20:46:38,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433675801] [2019-12-18 20:46:38,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:38,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:38,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107739590] [2019-12-18 20:46:38,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:38,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:38,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:38,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:38,828 INFO L87 Difference]: Start difference. First operand 22741 states and 73038 transitions. Second operand 3 states. [2019-12-18 20:46:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:38,909 INFO L93 Difference]: Finished difference Result 22739 states and 73033 transitions. [2019-12-18 20:46:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:38,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:46:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:38,945 INFO L225 Difference]: With dead ends: 22739 [2019-12-18 20:46:38,945 INFO L226 Difference]: Without dead ends: 22739 [2019-12-18 20:46:38,946 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 20:46:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22739 states. [2019-12-18 20:46:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22739 to 21096. [2019-12-18 20:46:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21096 states. [2019-12-18 20:46:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21096 states to 21096 states and 68535 transitions. [2019-12-18 20:46:39,278 INFO L78 Accepts]: Start accepts. Automaton has 21096 states and 68535 transitions. Word has length 54 [2019-12-18 20:46:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:39,278 INFO L462 AbstractCegarLoop]: Abstraction has 21096 states and 68535 transitions. [2019-12-18 20:46:39,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21096 states and 68535 transitions. [2019-12-18 20:46:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:46:39,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:39,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:39,302 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-18 20:46:39,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:39,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428948614] [2019-12-18 20:46:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:39,370 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 20:46:39,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428948614] [2019-12-18 20:46:39,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:39,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:39,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996814554] [2019-12-18 20:46:39,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:39,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:39,373 INFO L87 Difference]: Start difference. First operand 21096 states and 68535 transitions. Second operand 3 states. [2019-12-18 20:46:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:39,463 INFO L93 Difference]: Finished difference Result 19398 states and 61782 transitions. [2019-12-18 20:46:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:39,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:46:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:39,501 INFO L225 Difference]: With dead ends: 19398 [2019-12-18 20:46:39,501 INFO L226 Difference]: Without dead ends: 19398 [2019-12-18 20:46:39,502 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 20:46:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19398 states. [2019-12-18 20:46:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 16534. [2019-12-18 20:46:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16534 states. [2019-12-18 20:46:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 52346 transitions. [2019-12-18 20:46:39,949 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 52346 transitions. Word has length 55 [2019-12-18 20:46:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:39,949 INFO L462 AbstractCegarLoop]: Abstraction has 16534 states and 52346 transitions. [2019-12-18 20:46:39,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 52346 transitions. [2019-12-18 20:46:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:46:39,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:39,969 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 20:46:39,970 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-18 20:46:39,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:39,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136690449] [2019-12-18 20:46:39,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:40,082 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 20:46:40,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136690449] [2019-12-18 20:46:40,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:40,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:40,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427703788] [2019-12-18 20:46:40,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:46:40,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:40,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:46:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:40,084 INFO L87 Difference]: Start difference. First operand 16534 states and 52346 transitions. Second operand 9 states. [2019-12-18 20:46:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:41,417 INFO L93 Difference]: Finished difference Result 29391 states and 92467 transitions. [2019-12-18 20:46:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:46:41,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 20:46:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:41,459 INFO L225 Difference]: With dead ends: 29391 [2019-12-18 20:46:41,459 INFO L226 Difference]: Without dead ends: 24775 [2019-12-18 20:46:41,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:46:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24775 states. [2019-12-18 20:46:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24775 to 17142. [2019-12-18 20:46:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17142 states. [2019-12-18 20:46:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17142 states to 17142 states and 54026 transitions. [2019-12-18 20:46:41,771 INFO L78 Accepts]: Start accepts. Automaton has 17142 states and 54026 transitions. Word has length 56 [2019-12-18 20:46:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:41,771 INFO L462 AbstractCegarLoop]: Abstraction has 17142 states and 54026 transitions. [2019-12-18 20:46:41,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:46:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17142 states and 54026 transitions. [2019-12-18 20:46:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:46:41,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:41,790 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 20:46:41,790 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-18 20:46:41,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:41,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569212136] [2019-12-18 20:46:41,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569212136] [2019-12-18 20:46:42,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:42,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:46:42,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057414406] [2019-12-18 20:46:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:46:42,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:46:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:46:42,404 INFO L87 Difference]: Start difference. First operand 17142 states and 54026 transitions. Second operand 18 states. [2019-12-18 20:46:45,749 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-12-18 20:46:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:49,039 INFO L93 Difference]: Finished difference Result 38320 states and 117432 transitions. [2019-12-18 20:46:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-18 20:46:49,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-18 20:46:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:49,093 INFO L225 Difference]: With dead ends: 38320 [2019-12-18 20:46:49,093 INFO L226 Difference]: Without dead ends: 32213 [2019-12-18 20:46:49,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=824, Invalid=5028, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 20:46:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32213 states. [2019-12-18 20:46:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32213 to 18305. [2019-12-18 20:46:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18305 states. [2019-12-18 20:46:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18305 states to 18305 states and 57200 transitions. [2019-12-18 20:46:49,441 INFO L78 Accepts]: Start accepts. Automaton has 18305 states and 57200 transitions. Word has length 56 [2019-12-18 20:46:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:49,442 INFO L462 AbstractCegarLoop]: Abstraction has 18305 states and 57200 transitions. [2019-12-18 20:46:49,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:46:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18305 states and 57200 transitions. [2019-12-18 20:46:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:46:49,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:49,460 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 20:46:49,460 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1830147234, now seen corresponding path program 3 times [2019-12-18 20:46:49,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:49,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33171409] [2019-12-18 20:46:49,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:49,626 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 20:46:49,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33171409] [2019-12-18 20:46:49,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:49,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:49,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973295625] [2019-12-18 20:46:49,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:46:49,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:46:49,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:46:49,628 INFO L87 Difference]: Start difference. First operand 18305 states and 57200 transitions. Second operand 10 states. [2019-12-18 20:46:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:50,498 INFO L93 Difference]: Finished difference Result 31944 states and 99289 transitions. [2019-12-18 20:46:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:46:50,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 20:46:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:50,542 INFO L225 Difference]: With dead ends: 31944 [2019-12-18 20:46:50,543 INFO L226 Difference]: Without dead ends: 31378 [2019-12-18 20:46:50,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:46:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31378 states. [2019-12-18 20:46:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31378 to 19881. [2019-12-18 20:46:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19881 states. [2019-12-18 20:46:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19881 states to 19881 states and 62115 transitions. [2019-12-18 20:46:51,124 INFO L78 Accepts]: Start accepts. Automaton has 19881 states and 62115 transitions. Word has length 56 [2019-12-18 20:46:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:51,124 INFO L462 AbstractCegarLoop]: Abstraction has 19881 states and 62115 transitions. [2019-12-18 20:46:51,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:46:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19881 states and 62115 transitions. [2019-12-18 20:46:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:46:51,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:51,144 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 20:46:51,144 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 457193928, now seen corresponding path program 4 times [2019-12-18 20:46:51,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:51,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11148816] [2019-12-18 20:46:51,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:51,287 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 20:46:51,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11148816] [2019-12-18 20:46:51,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:51,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618322854] [2019-12-18 20:46:51,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:46:51,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:46:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:46:51,291 INFO L87 Difference]: Start difference. First operand 19881 states and 62115 transitions. Second operand 10 states. [2019-12-18 20:46:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:52,017 INFO L93 Difference]: Finished difference Result 31654 states and 98141 transitions. [2019-12-18 20:46:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:46:52,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 20:46:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:52,059 INFO L225 Difference]: With dead ends: 31654 [2019-12-18 20:46:52,059 INFO L226 Difference]: Without dead ends: 27383 [2019-12-18 20:46:52,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:46:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27383 states. [2019-12-18 20:46:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27383 to 17240. [2019-12-18 20:46:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17240 states. [2019-12-18 20:46:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17240 states to 17240 states and 53912 transitions. [2019-12-18 20:46:52,374 INFO L78 Accepts]: Start accepts. Automaton has 17240 states and 53912 transitions. Word has length 56 [2019-12-18 20:46:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:52,374 INFO L462 AbstractCegarLoop]: Abstraction has 17240 states and 53912 transitions. [2019-12-18 20:46:52,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:46:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 17240 states and 53912 transitions. [2019-12-18 20:46:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:46:52,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:52,392 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 20:46:52,392 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1965447590, now seen corresponding path program 5 times [2019-12-18 20:46:52,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:52,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615497477] [2019-12-18 20:46:52,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:52,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615497477] [2019-12-18 20:46:52,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:52,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:46:52,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796629108] [2019-12-18 20:46:52,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:46:52,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:46:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:46:52,539 INFO L87 Difference]: Start difference. First operand 17240 states and 53912 transitions. Second operand 11 states. [2019-12-18 20:46:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:53,441 INFO L93 Difference]: Finished difference Result 29132 states and 90170 transitions. [2019-12-18 20:46:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:46:53,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 20:46:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:53,487 INFO L225 Difference]: With dead ends: 29132 [2019-12-18 20:46:53,487 INFO L226 Difference]: Without dead ends: 25922 [2019-12-18 20:46:53,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:46:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25922 states. [2019-12-18 20:46:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25922 to 16208. [2019-12-18 20:46:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16208 states. [2019-12-18 20:46:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16208 states to 16208 states and 50679 transitions. [2019-12-18 20:46:53,800 INFO L78 Accepts]: Start accepts. Automaton has 16208 states and 50679 transitions. Word has length 56 [2019-12-18 20:46:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:53,800 INFO L462 AbstractCegarLoop]: Abstraction has 16208 states and 50679 transitions. [2019-12-18 20:46:53,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:46:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 16208 states and 50679 transitions. [2019-12-18 20:46:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:46:53,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:53,818 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 20:46:53,818 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 6 times [2019-12-18 20:46:53,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:53,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369398834] [2019-12-18 20:46:53,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:46:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:46:53,922 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:46:53,922 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:46:53,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_16|) |v_ULTIMATE.start_main_~#t636~0.offset_13| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd3~0_17) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= |v_ULTIMATE.start_main_~#t636~0.offset_13| 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t636~0.base_16|) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t636~0.base_16|) 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t636~0.base_16| 1)) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t636~0.base_16| 4)) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_15|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ULTIMATE.start_main_~#t636~0.offset=|v_ULTIMATE.start_main_~#t636~0.offset_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t636~0.base=|v_ULTIMATE.start_main_~#t636~0.base_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t638~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t638~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t636~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t636~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, #NULL.base, ~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~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t637~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:46:53,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t637~0.base_11|) (= |v_ULTIMATE.start_main_~#t637~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11|) |v_ULTIMATE.start_main_~#t637~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t637~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t637~0.base_11| 0)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, #length, ULTIMATE.start_main_~#t637~0.base] because there is no mapped edge [2019-12-18 20:46:53,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-934055449 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-934055449|) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-934055449| 1) (= ~y$w_buff0_used~0_In-934055449 ~y$w_buff1_used~0_Out-934055449) (= 1 ~y$w_buff0~0_Out-934055449) (= P1Thread1of1ForFork1_~arg.base_Out-934055449 |P1Thread1of1ForFork1_#in~arg.base_In-934055449|) (= (mod ~y$w_buff1_used~0_Out-934055449 256) 0) (= |P1Thread1of1ForFork1_#in~arg.offset_In-934055449| P1Thread1of1ForFork1_~arg.offset_Out-934055449) (= ~y$w_buff0_used~0_Out-934055449 1) (= ~y$w_buff1~0_Out-934055449 ~y$w_buff0~0_In-934055449)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-934055449, ~y$w_buff0~0=~y$w_buff0~0_In-934055449, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-934055449|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-934055449|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-934055449, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-934055449, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-934055449, ~y$w_buff1~0=~y$w_buff1~0_Out-934055449, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-934055449|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-934055449, ~y$w_buff0~0=~y$w_buff0~0_Out-934055449, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-934055449|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-934055449|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-934055449} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:46:53,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t638~0.base_11|)) (= |v_ULTIMATE.start_main_~#t638~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t638~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11|) |v_ULTIMATE.start_main_~#t638~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t638~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t638~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t638~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:46:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork2_#t~ite32_Out1883510375| |P2Thread1of1ForFork2_#t~ite33_Out1883510375|)) (.cse2 (= (mod ~y$w_buff1_used~0_In1883510375 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1883510375 256) 0))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite32_Out1883510375| ~y$w_buff1~0_In1883510375) (not .cse2)) (and (= |P2Thread1of1ForFork2_#t~ite32_Out1883510375| ~y~0_In1883510375) .cse1 (or .cse2 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1883510375, ~y$w_buff1~0=~y$w_buff1~0_In1883510375, ~y~0=~y~0_In1883510375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1883510375} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1883510375, ~y$w_buff1~0=~y$w_buff1~0_In1883510375, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1883510375|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1883510375|, ~y~0=~y~0_In1883510375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1883510375} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 20:46:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1097360324 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1097360324 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1097360324| 0)) (and (= ~y$w_buff0_used~0_In-1097360324 |P1Thread1of1ForFork1_#t~ite28_Out-1097360324|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097360324, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1097360324} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1097360324, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1097360324, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1097360324|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:46:53,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1970540513 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1970540513 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out1970540513|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite34_Out1970540513| ~y$w_buff0_used~0_In1970540513) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1970540513, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1970540513} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1970540513|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1970540513, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1970540513} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 20:46:53,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1045722318 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1045722318 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1045722318 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1045722318 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out-1045722318| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1045722318 |P2Thread1of1ForFork2_#t~ite35_Out-1045722318|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1045722318, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045722318, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1045722318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1045722318} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-1045722318|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1045722318, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1045722318, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1045722318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1045722318} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 20:46:53,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In691351279 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In691351279 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out691351279|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In691351279 |P2Thread1of1ForFork2_#t~ite36_Out691351279|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In691351279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In691351279} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out691351279|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In691351279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In691351279} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 20:46:53,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1174141955 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1174141955 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1174141955 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1174141955 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In1174141955 |P2Thread1of1ForFork2_#t~ite37_Out1174141955|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out1174141955|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1174141955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1174141955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1174141955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1174141955} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out1174141955|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1174141955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1174141955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1174141955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1174141955} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 20:46:53,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 20:46:53,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In1414355062 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1414355062 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1414355062 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1414355062 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1414355062 |P1Thread1of1ForFork1_#t~ite29_Out1414355062|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out1414355062|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1414355062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1414355062, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1414355062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1414355062} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1414355062, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1414355062|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1414355062, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1414355062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1414355062} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 20:46:53,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1095717682 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1095717682 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In1095717682 ~y$r_buff0_thd2~0_Out1095717682) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd2~0_Out1095717682) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1095717682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1095717682} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1095717682|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1095717682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1095717682} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:46:53,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1150731571 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1150731571 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1150731571 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1150731571 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1150731571 |P1Thread1of1ForFork1_#t~ite31_Out-1150731571|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1150731571| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1150731571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1150731571, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1150731571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1150731571} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1150731571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1150731571, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1150731571|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1150731571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1150731571} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 20:46:53,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 20:46:53,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1058670686 256)))) (or (and (= ~y$w_buff0~0_In-1058670686 |P0Thread1of1ForFork0_#t~ite9_Out-1058670686|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite8_In-1058670686| |P0Thread1of1ForFork0_#t~ite8_Out-1058670686|)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out-1058670686| |P0Thread1of1ForFork0_#t~ite8_Out-1058670686|) (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1058670686 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1058670686 256))) (and (= (mod ~y$r_buff1_thd1~0_In-1058670686 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1058670686 256)))) (= ~y$w_buff0~0_In-1058670686 |P0Thread1of1ForFork0_#t~ite8_Out-1058670686|) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1058670686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058670686, ~y$w_buff0~0=~y$w_buff0~0_In-1058670686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1058670686, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In-1058670686|, ~weak$$choice2~0=~weak$$choice2~0_In-1058670686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1058670686} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1058670686, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-1058670686|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1058670686, ~y$w_buff0~0=~y$w_buff0~0_In-1058670686, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1058670686|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1058670686, ~weak$$choice2~0=~weak$$choice2~0_In-1058670686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1058670686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:46:53,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-180442856 256)))) (or (and (= ~y$w_buff1~0_In-180442856 |P0Thread1of1ForFork0_#t~ite11_Out-180442856|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-180442856 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-180442856 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-180442856 256)) (and (= (mod ~y$r_buff1_thd1~0_In-180442856 256) 0) .cse0))) (= |P0Thread1of1ForFork0_#t~ite11_Out-180442856| |P0Thread1of1ForFork0_#t~ite12_Out-180442856|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite11_In-180442856| |P0Thread1of1ForFork0_#t~ite11_Out-180442856|) (= ~y$w_buff1~0_In-180442856 |P0Thread1of1ForFork0_#t~ite12_Out-180442856|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-180442856|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-180442856, ~y$w_buff1~0=~y$w_buff1~0_In-180442856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-180442856, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-180442856, ~weak$$choice2~0=~weak$$choice2~0_In-180442856, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180442856} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-180442856|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-180442856, ~y$w_buff1~0=~y$w_buff1~0_In-180442856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-180442856, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-180442856, ~weak$$choice2~0=~weak$$choice2~0_In-180442856, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-180442856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180442856} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 20:46:53,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 20:46:53,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite24_Out102795250| |P0Thread1of1ForFork0_#t~ite23_Out102795250|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In102795250 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In102795250 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In102795250 256) 0)) (.cse5 (= (mod ~y$w_buff1_used~0_In102795250 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In102795250 256) 0))) (or (and (or (and (= ~y$r_buff1_thd1~0_In102795250 |P0Thread1of1ForFork0_#t~ite24_Out102795250|) (= |P0Thread1of1ForFork0_#t~ite23_In102795250| |P0Thread1of1ForFork0_#t~ite23_Out102795250|) (not .cse0)) (and .cse1 .cse0 (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3)) (= ~y$r_buff1_thd1~0_In102795250 |P0Thread1of1ForFork0_#t~ite23_Out102795250|))) (= |P0Thread1of1ForFork0_#t~ite22_In102795250| |P0Thread1of1ForFork0_#t~ite22_Out102795250|)) (let ((.cse6 (not .cse3))) (and .cse1 .cse0 (or .cse6 (not .cse2)) (not .cse4) (= |P0Thread1of1ForFork0_#t~ite22_Out102795250| 0) (= |P0Thread1of1ForFork0_#t~ite22_Out102795250| |P0Thread1of1ForFork0_#t~ite23_Out102795250|) (or .cse6 (not .cse5)))))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In102795250|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In102795250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In102795250, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In102795250, ~weak$$choice2~0=~weak$$choice2~0_In102795250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In102795250, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In102795250|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out102795250|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In102795250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In102795250, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In102795250, ~weak$$choice2~0=~weak$$choice2~0_In102795250, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out102795250|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out102795250|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In102795250} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 20:46:53,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 20:46:53,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:46:53,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-86201111 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-86201111 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-86201111| ~y$w_buff1~0_In-86201111)) (and (= |ULTIMATE.start_main_#t~ite41_Out-86201111| ~y~0_In-86201111) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-86201111, ~y~0=~y~0_In-86201111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-86201111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-86201111} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-86201111|, ~y$w_buff1~0=~y$w_buff1~0_In-86201111, ~y~0=~y~0_In-86201111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-86201111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-86201111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 20:46:53,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:46:53,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In710616409 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In710616409 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out710616409|)) (and (= |ULTIMATE.start_main_#t~ite43_Out710616409| ~y$w_buff0_used~0_In710616409) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In710616409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In710616409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In710616409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In710616409, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out710616409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:46:53,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-416479989 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-416479989 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-416479989 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-416479989 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-416479989| ~y$w_buff1_used~0_In-416479989)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-416479989|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-416479989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416479989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416479989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416479989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-416479989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416479989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416479989, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-416479989|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416479989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:46:53,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1658541329 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1658541329 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1658541329|)) (and (= ~y$r_buff0_thd0~0_In-1658541329 |ULTIMATE.start_main_#t~ite45_Out-1658541329|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658541329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1658541329} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658541329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1658541329, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1658541329|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:46:53,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In467562952 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In467562952 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In467562952 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In467562952 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out467562952| ~y$r_buff1_thd0~0_In467562952) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out467562952| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In467562952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In467562952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In467562952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In467562952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In467562952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In467562952, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out467562952|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In467562952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In467562952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:46:53,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:46:54,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:46:54 BasicIcfg [2019-12-18 20:46:54,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:46:54,044 INFO L168 Benchmark]: Toolchain (without parser) took 63289.29 ms. Allocated memory was 144.2 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 100.6 MB in the beginning and 506.0 MB in the end (delta: -405.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,044 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.03 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 156.7 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.65 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 154.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,046 INFO L168 Benchmark]: Boogie Preprocessor took 40.00 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,046 INFO L168 Benchmark]: RCFGBuilder took 817.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 104.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,052 INFO L168 Benchmark]: TraceAbstraction took 61592.77 ms. Allocated memory was 201.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.6 MB in the beginning and 506.0 MB in the end (delta: -402.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 20:46:54,055 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.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.03 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 156.7 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.65 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 154.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.00 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 104.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61592.77 ms. Allocated memory was 201.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.6 MB in the beginning and 506.0 MB in the end (delta: -402.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L833] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 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, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 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) [L808] 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) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 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 [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4982 SDtfs, 7558 SDslu, 19357 SDs, 0 SdLazy, 10581 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 30 SyntacticMatches, 14 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2940 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 217543 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 188358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...