/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:13:00,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:13:00,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:13:00,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:13:00,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:13:00,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:13:00,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:13:00,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:13:00,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:13:00,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:13:00,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:13:00,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:13:00,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:13:00,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:13:00,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:13:00,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:13:00,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:13:00,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:13:00,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:13:00,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:13:00,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:13:00,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:13:00,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:13:00,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:13:00,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:13:00,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:13:00,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:13:00,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:13:00,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:13:00,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:13:00,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:13:00,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:13:00,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:13:00,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:13:00,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:13:00,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:13:00,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:13:00,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:13:00,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:13:00,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:13:00,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:13:00,514 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-MCR.epf [2019-12-27 21:13:00,542 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:13:00,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:13:00,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:13:00,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:13:00,545 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:13:00,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:13:00,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:13:00,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:13:00,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:13:00,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:13:00,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:13:00,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:13:00,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:13:00,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:13:00,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:13:00,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:13:00,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:13:00,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:13:00,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:13:00,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:13:00,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:13:00,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:13:00,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:13:00,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:13:00,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:13:00,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:13:00,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:13:00,551 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:13:00,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:13:00,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:13:00,552 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:13:00,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:13:00,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:13:00,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:13:00,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:13:00,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:13:00,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:13:00,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-27 21:13:00,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294b0ecb4/4c89b0424ffe4226a96ecb822a847092/FLAGf09b87cfd [2019-12-27 21:13:01,535 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:13:01,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-27 21:13:01,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294b0ecb4/4c89b0424ffe4226a96ecb822a847092/FLAGf09b87cfd [2019-12-27 21:13:01,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294b0ecb4/4c89b0424ffe4226a96ecb822a847092 [2019-12-27 21:13:01,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:13:01,795 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:13:01,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:01,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:13:01,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:13:01,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb8c5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:01, skipping insertion in model container [2019-12-27 21:13:01,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:13:01" (1/1) ... [2019-12-27 21:13:01,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:13:01,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:13:02,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:02,416 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:13:02,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:13:02,562 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:13:02,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02 WrapperNode [2019-12-27 21:13:02,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:13:02,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:02,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:13:02,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:13:02,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:13:02,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:13:02,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:13:02,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:13:02,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... [2019-12-27 21:13:02,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:13:02,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:13:02,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:13:02,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:13:02,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:13:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:13:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:13:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:13:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:13:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:13:02,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:13:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:13:02,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:13:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:13:02,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:13:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:13:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:13:02,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:13:02,773 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:13:03,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:13:03,492 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:13:03,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:03 BoogieIcfgContainer [2019-12-27 21:13:03,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:13:03,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:13:03,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:13:03,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:13:03,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:13:01" (1/3) ... [2019-12-27 21:13:03,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d15d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:03, skipping insertion in model container [2019-12-27 21:13:03,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:13:02" (2/3) ... [2019-12-27 21:13:03,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d15d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:13:03, skipping insertion in model container [2019-12-27 21:13:03,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:13:03" (3/3) ... [2019-12-27 21:13:03,503 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-27 21:13:03,514 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:13:03,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:13:03,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:13:03,524 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:13:03,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,611 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,612 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,612 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:13:03,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:13:03,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:13:03,647 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:13:03,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:13:03,648 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:13:03,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:13:03,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:13:03,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:13:03,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:13:03,668 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 21:13:03,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 21:13:03,767 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 21:13:03,767 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:03,781 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:13:03,800 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 21:13:03,897 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 21:13:03,898 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:13:03,909 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:13:03,927 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:13:03,928 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:13:07,526 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:13:07,695 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:13:07,712 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-27 21:13:07,713 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 21:13:07,716 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-27 21:13:08,626 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 21:13:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 21:13:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:13:08,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:08,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:08,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:08,640 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 21:13:08,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:08,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574289367] [2019-12-27 21:13:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:08,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574289367] [2019-12-27 21:13:08,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:08,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:13:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005964793] [2019-12-27 21:13:08,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:08,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:08,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:13:08,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:08,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:08,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:08,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:08,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:08,943 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 21:13:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:09,289 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-27 21:13:09,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:09,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:13:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:09,472 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 21:13:09,472 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 21:13:09,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 21:13:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 21:13:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 21:13:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-27 21:13:10,213 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-27 21:13:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:10,214 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-27 21:13:10,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-27 21:13:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:10,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:10,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:10,219 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 21:13:10,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:10,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324177964] [2019-12-27 21:13:10,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:10,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324177964] [2019-12-27 21:13:10,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:10,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:10,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40821478] [2019-12-27 21:13:10,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:10,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:10,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:13:10,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:10,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:10,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:10,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:10,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:10,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:10,318 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-27 21:13:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:11,391 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-27 21:13:11,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:11,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:13:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:11,473 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 21:13:11,473 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 21:13:11,474 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-27 21:13:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 21:13:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 21:13:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 21:13:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-27 21:13:12,237 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-27 21:13:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:12,238 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-27 21:13:12,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-27 21:13:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:12,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:12,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:12,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 21:13:12,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:12,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199631890] [2019-12-27 21:13:12,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:12,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199631890] [2019-12-27 21:13:12,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:12,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:12,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327966541] [2019-12-27 21:13:12,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:12,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:12,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:13:12,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:12,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:13:12,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:12,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:12,404 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 5 states. [2019-12-27 21:13:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:13,046 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-27 21:13:13,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:13,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:13:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:13,166 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 21:13:13,166 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 21:13:13,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 21:13:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-27 21:13:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-27 21:13:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-27 21:13:14,974 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-27 21:13:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:14,974 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-27 21:13:14,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-27 21:13:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 21:13:14,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:14,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:14,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 21:13:14,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:14,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919338333] [2019-12-27 21:13:14,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:15,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919338333] [2019-12-27 21:13:15,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:15,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:15,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612832508] [2019-12-27 21:13:15,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:15,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:15,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 21:13:15,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:15,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:15,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:15,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:15,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:15,106 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-27 21:13:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:15,672 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-27 21:13:15,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:13:15,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 21:13:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:15,771 INFO L225 Difference]: With dead ends: 29780 [2019-12-27 21:13:15,771 INFO L226 Difference]: Without dead ends: 29766 [2019-12-27 21:13:15,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-27 21:13:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-27 21:13:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 21:13:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-27 21:13:16,809 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-27 21:13:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:16,809 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-27 21:13:16,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-27 21:13:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:13:16,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:16,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:16,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-27 21:13:16,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:16,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706590328] [2019-12-27 21:13:16,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:16,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706590328] [2019-12-27 21:13:16,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:16,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:16,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [726984593] [2019-12-27 21:13:16,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:16,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:16,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:13:16,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:16,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:16,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:16,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:16,988 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 4 states. [2019-12-27 21:13:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:17,286 INFO L93 Difference]: Finished difference Result 13150 states and 40780 transitions. [2019-12-27 21:13:17,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:13:17,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 21:13:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:17,311 INFO L225 Difference]: With dead ends: 13150 [2019-12-27 21:13:17,311 INFO L226 Difference]: Without dead ends: 12620 [2019-12-27 21:13:17,312 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-27 21:13:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12620 states. [2019-12-27 21:13:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12620 to 12620. [2019-12-27 21:13:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12620 states. [2019-12-27 21:13:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12620 states to 12620 states and 39274 transitions. [2019-12-27 21:13:17,645 INFO L78 Accepts]: Start accepts. Automaton has 12620 states and 39274 transitions. Word has length 27 [2019-12-27 21:13:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:17,646 INFO L462 AbstractCegarLoop]: Abstraction has 12620 states and 39274 transitions. [2019-12-27 21:13:17,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12620 states and 39274 transitions. [2019-12-27 21:13:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:13:17,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:17,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:17,656 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash -173751725, now seen corresponding path program 1 times [2019-12-27 21:13:17,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:17,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307130102] [2019-12-27 21:13:17,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:17,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307130102] [2019-12-27 21:13:17,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:17,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:17,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866577336] [2019-12-27 21:13:17,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:17,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:17,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 36 transitions. [2019-12-27 21:13:17,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:17,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:17,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:17,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:17,759 INFO L87 Difference]: Start difference. First operand 12620 states and 39274 transitions. Second operand 6 states. [2019-12-27 21:13:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:18,186 INFO L93 Difference]: Finished difference Result 17774 states and 54068 transitions. [2019-12-27 21:13:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:13:18,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:13:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:18,216 INFO L225 Difference]: With dead ends: 17774 [2019-12-27 21:13:18,216 INFO L226 Difference]: Without dead ends: 17758 [2019-12-27 21:13:18,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17758 states. [2019-12-27 21:13:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17758 to 15419. [2019-12-27 21:13:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15419 states. [2019-12-27 21:13:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15419 states to 15419 states and 47344 transitions. [2019-12-27 21:13:18,746 INFO L78 Accepts]: Start accepts. Automaton has 15419 states and 47344 transitions. Word has length 28 [2019-12-27 21:13:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:18,746 INFO L462 AbstractCegarLoop]: Abstraction has 15419 states and 47344 transitions. [2019-12-27 21:13:18,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 15419 states and 47344 transitions. [2019-12-27 21:13:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:18,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:18,763 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] [2019-12-27 21:13:18,763 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1496615068, now seen corresponding path program 1 times [2019-12-27 21:13:18,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:18,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031927896] [2019-12-27 21:13:18,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:18,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031927896] [2019-12-27 21:13:18,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:18,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:18,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761102008] [2019-12-27 21:13:18,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:18,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:18,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 46 transitions. [2019-12-27 21:13:18,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:18,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:18,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:18,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:18,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:18,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:18,842 INFO L87 Difference]: Start difference. First operand 15419 states and 47344 transitions. Second operand 3 states. [2019-12-27 21:13:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:18,963 INFO L93 Difference]: Finished difference Result 19451 states and 60048 transitions. [2019-12-27 21:13:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:18,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-27 21:13:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:18,997 INFO L225 Difference]: With dead ends: 19451 [2019-12-27 21:13:18,998 INFO L226 Difference]: Without dead ends: 19451 [2019-12-27 21:13:18,998 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-27 21:13:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19451 states. [2019-12-27 21:13:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19451 to 17233. [2019-12-27 21:13:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17233 states. [2019-12-27 21:13:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17233 states to 17233 states and 53543 transitions. [2019-12-27 21:13:19,375 INFO L78 Accepts]: Start accepts. Automaton has 17233 states and 53543 transitions. Word has length 34 [2019-12-27 21:13:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:19,378 INFO L462 AbstractCegarLoop]: Abstraction has 17233 states and 53543 transitions. [2019-12-27 21:13:19,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 17233 states and 53543 transitions. [2019-12-27 21:13:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:19,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:19,397 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] [2019-12-27 21:13:19,398 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1228654752, now seen corresponding path program 1 times [2019-12-27 21:13:19,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:19,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325632792] [2019-12-27 21:13:19,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:19,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325632792] [2019-12-27 21:13:19,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:19,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:19,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616869534] [2019-12-27 21:13:19,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:19,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:19,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 46 transitions. [2019-12-27 21:13:19,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:19,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:19,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:19,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:19,473 INFO L87 Difference]: Start difference. First operand 17233 states and 53543 transitions. Second operand 3 states. [2019-12-27 21:13:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:19,662 INFO L93 Difference]: Finished difference Result 17233 states and 53350 transitions. [2019-12-27 21:13:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:19,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-27 21:13:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:19,686 INFO L225 Difference]: With dead ends: 17233 [2019-12-27 21:13:19,686 INFO L226 Difference]: Without dead ends: 17233 [2019-12-27 21:13:19,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2019-12-27 21:13:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17233. [2019-12-27 21:13:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17233 states. [2019-12-27 21:13:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17233 states to 17233 states and 53350 transitions. [2019-12-27 21:13:19,962 INFO L78 Accepts]: Start accepts. Automaton has 17233 states and 53350 transitions. Word has length 34 [2019-12-27 21:13:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:19,963 INFO L462 AbstractCegarLoop]: Abstraction has 17233 states and 53350 transitions. [2019-12-27 21:13:19,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17233 states and 53350 transitions. [2019-12-27 21:13:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:19,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:19,976 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] [2019-12-27 21:13:19,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash 460610592, now seen corresponding path program 1 times [2019-12-27 21:13:19,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:19,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022151992] [2019-12-27 21:13:19,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:20,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022151992] [2019-12-27 21:13:20,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:20,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:20,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574026399] [2019-12-27 21:13:20,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:20,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:20,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 61 transitions. [2019-12-27 21:13:20,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:20,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:20,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:20,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:20,128 INFO L87 Difference]: Start difference. First operand 17233 states and 53350 transitions. Second operand 7 states. [2019-12-27 21:13:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:21,000 INFO L93 Difference]: Finished difference Result 26259 states and 79135 transitions. [2019-12-27 21:13:21,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:13:21,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 21:13:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:21,059 INFO L225 Difference]: With dead ends: 26259 [2019-12-27 21:13:21,060 INFO L226 Difference]: Without dead ends: 26237 [2019-12-27 21:13:21,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:13:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26237 states. [2019-12-27 21:13:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26237 to 17765. [2019-12-27 21:13:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17765 states. [2019-12-27 21:13:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 54932 transitions. [2019-12-27 21:13:21,608 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 54932 transitions. Word has length 34 [2019-12-27 21:13:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:21,608 INFO L462 AbstractCegarLoop]: Abstraction has 17765 states and 54932 transitions. [2019-12-27 21:13:21,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 54932 transitions. [2019-12-27 21:13:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:21,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:21,621 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] [2019-12-27 21:13:21,621 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2030308068, now seen corresponding path program 1 times [2019-12-27 21:13:21,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:21,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539510939] [2019-12-27 21:13:21,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:21,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539510939] [2019-12-27 21:13:21,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:21,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:21,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922577973] [2019-12-27 21:13:21,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:21,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:21,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 61 transitions. [2019-12-27 21:13:21,743 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:21,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:21,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:21,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:21,745 INFO L87 Difference]: Start difference. First operand 17765 states and 54932 transitions. Second operand 7 states. [2019-12-27 21:13:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:22,377 INFO L93 Difference]: Finished difference Result 24195 states and 73310 transitions. [2019-12-27 21:13:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:13:22,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 21:13:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:22,411 INFO L225 Difference]: With dead ends: 24195 [2019-12-27 21:13:22,411 INFO L226 Difference]: Without dead ends: 24182 [2019-12-27 21:13:22,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:13:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24182 states. [2019-12-27 21:13:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24182 to 19705. [2019-12-27 21:13:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-27 21:13:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-27 21:13:22,909 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 34 [2019-12-27 21:13:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:22,910 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-27 21:13:22,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-27 21:13:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:13:22,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:22,927 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] [2019-12-27 21:13:22,927 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-27 21:13:22,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:22,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041883413] [2019-12-27 21:13:22,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:22,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041883413] [2019-12-27 21:13:22,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:22,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:22,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454694087] [2019-12-27 21:13:22,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:23,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:23,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 42 transitions. [2019-12-27 21:13:23,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:23,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:23,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:23,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:23,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:23,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:23,033 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 6 states. [2019-12-27 21:13:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:23,086 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-27 21:13:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:23,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 21:13:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:23,090 INFO L225 Difference]: With dead ends: 2732 [2019-12-27 21:13:23,090 INFO L226 Difference]: Without dead ends: 2423 [2019-12-27 21:13:23,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:13:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-27 21:13:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-27 21:13:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 21:13:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-27 21:13:23,123 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-27 21:13:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:23,124 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-27 21:13:23,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-27 21:13:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 21:13:23,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:23,128 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] [2019-12-27 21:13:23,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:23,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-27 21:13:23,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:23,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186334822] [2019-12-27 21:13:23,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:23,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186334822] [2019-12-27 21:13:23,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:23,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:23,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700647132] [2019-12-27 21:13:23,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:23,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:23,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 55 transitions. [2019-12-27 21:13:23,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:23,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:23,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:13:23,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:13:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:23,274 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 7 states. [2019-12-27 21:13:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:23,333 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-27 21:13:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:23,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 21:13:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:23,334 INFO L225 Difference]: With dead ends: 706 [2019-12-27 21:13:23,334 INFO L226 Difference]: Without dead ends: 660 [2019-12-27 21:13:23,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:13:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-27 21:13:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-27 21:13:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:13:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-27 21:13:23,344 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-27 21:13:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:23,344 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-27 21:13:23,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:13:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-27 21:13:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:13:23,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:23,346 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-27 21:13:23,346 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-27 21:13:23,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:23,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199457504] [2019-12-27 21:13:23,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:23,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199457504] [2019-12-27 21:13:23,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:23,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:23,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [405968475] [2019-12-27 21:13:23,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:23,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:23,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 134 transitions. [2019-12-27 21:13:23,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:23,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:13:23,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:23,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:23,518 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-27 21:13:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:23,781 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-27 21:13:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:23,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:13:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:23,785 INFO L225 Difference]: With dead ends: 875 [2019-12-27 21:13:23,786 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 21:13:23,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 21:13:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-27 21:13:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 21:13:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-27 21:13:23,803 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-27 21:13:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-27 21:13:23,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-27 21:13:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:13:23,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:23,813 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-27 21:13:23,813 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-27 21:13:23,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:23,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776764726] [2019-12-27 21:13:23,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:23,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-27 21:13:23,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776764726] [2019-12-27 21:13:23,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:23,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:23,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833268433] [2019-12-27 21:13:23,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:23,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:24,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 129 transitions. [2019-12-27 21:13:24,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:24,080 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:13:24,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:24,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:24,081 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 5 states. [2019-12-27 21:13:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:24,264 INFO L93 Difference]: Finished difference Result 820 states and 1826 transitions. [2019-12-27 21:13:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:13:24,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:13:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:24,266 INFO L225 Difference]: With dead ends: 820 [2019-12-27 21:13:24,266 INFO L226 Difference]: Without dead ends: 820 [2019-12-27 21:13:24,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:13:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-27 21:13:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 604. [2019-12-27 21:13:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 21:13:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-27 21:13:24,277 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-27 21:13:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:24,278 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-27 21:13:24,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-27 21:13:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:13:24,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:24,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:24,279 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-27 21:13:24,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:24,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909077204] [2019-12-27 21:13:24,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:24,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909077204] [2019-12-27 21:13:24,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:24,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:13:24,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253856855] [2019-12-27 21:13:24,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:24,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:24,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 132 transitions. [2019-12-27 21:13:24,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:24,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:13:24,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:13:24,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:13:24,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:13:24,584 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 8 states. [2019-12-27 21:13:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:24,725 INFO L93 Difference]: Finished difference Result 956 states and 2008 transitions. [2019-12-27 21:13:24,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:13:24,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 21:13:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:24,726 INFO L225 Difference]: With dead ends: 956 [2019-12-27 21:13:24,727 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 21:13:24,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:13:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 21:13:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-27 21:13:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 21:13:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-27 21:13:24,735 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-27 21:13:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:24,735 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-27 21:13:24,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:13:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-27 21:13:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:13:24,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:24,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:24,737 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-27 21:13:24,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:24,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378865199] [2019-12-27 21:13:24,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:25,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378865199] [2019-12-27 21:13:25,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:25,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:13:25,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [935732098] [2019-12-27 21:13:25,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:25,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:25,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 130 transitions. [2019-12-27 21:13:25,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:25,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:13:25,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:13:25,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:13:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:13:25,203 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 13 states. [2019-12-27 21:13:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:25,735 INFO L93 Difference]: Finished difference Result 794 states and 1707 transitions. [2019-12-27 21:13:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:13:25,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 21:13:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:25,738 INFO L225 Difference]: With dead ends: 794 [2019-12-27 21:13:25,738 INFO L226 Difference]: Without dead ends: 764 [2019-12-27 21:13:25,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:13:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-27 21:13:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 746. [2019-12-27 21:13:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 21:13:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1625 transitions. [2019-12-27 21:13:25,746 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1625 transitions. Word has length 57 [2019-12-27 21:13:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:25,746 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1625 transitions. [2019-12-27 21:13:25,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:13:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1625 transitions. [2019-12-27 21:13:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:13:25,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:25,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:25,747 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:13:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 3 times [2019-12-27 21:13:25,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:25,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113572662] [2019-12-27 21:13:25,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:13:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:13:25,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:13:25,871 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:13:25,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:13:25,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-27 21:13:25,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:13:25,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In533089617 0)) (= ~y$r_buff0_thd2~0_In533089617 ~y$r_buff1_thd2~0_Out533089617) (= ~y$r_buff1_thd0~0_Out533089617 ~y$r_buff0_thd0~0_In533089617) (= ~y$r_buff0_thd1~0_In533089617 ~y$r_buff1_thd1~0_Out533089617) (= ~__unbuffered_p2_EAX~0_Out533089617 ~z~0_Out533089617) (= ~y$r_buff0_thd3~0_In533089617 ~y$r_buff1_thd3~0_Out533089617) (= 1 ~y$r_buff0_thd3~0_Out533089617) (= ~z~0_Out533089617 1) (= ~a~0_In533089617 ~__unbuffered_p2_EBX~0_Out533089617)) InVars {~a~0=~a~0_In533089617, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In533089617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In533089617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In533089617, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In533089617, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In533089617} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out533089617, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In533089617, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out533089617, ~a~0=~a~0_In533089617, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out533089617, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out533089617, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out533089617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In533089617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In533089617, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In533089617, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out533089617, ~z~0=~z~0_Out533089617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out533089617} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:13:25,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:13:25,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite4_Out820812910| |P1Thread1of1ForFork0_#t~ite3_Out820812910|)) (.cse0 (= (mod ~y$w_buff1_used~0_In820812910 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In820812910 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In820812910 |P1Thread1of1ForFork0_#t~ite3_Out820812910|)) (and .cse1 (or .cse0 .cse2) (= ~y~0_In820812910 |P1Thread1of1ForFork0_#t~ite3_Out820812910|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In820812910, ~y$w_buff1~0=~y$w_buff1~0_In820812910, ~y~0=~y~0_In820812910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In820812910} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In820812910, ~y$w_buff1~0=~y$w_buff1~0_In820812910, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out820812910|, ~y~0=~y~0_In820812910, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out820812910|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In820812910} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:13:25,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1458240282 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1458240282 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out-1458240282|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite11_Out-1458240282| ~y$w_buff0_used~0_In-1458240282)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458240282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1458240282} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458240282, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1458240282|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1458240282} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:13:25,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1471549891 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1471549891 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1471549891 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1471549891 256) 0))) (or (and (= ~y$w_buff1_used~0_In1471549891 |P2Thread1of1ForFork1_#t~ite12_Out1471549891|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite12_Out1471549891| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1471549891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471549891, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1471549891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1471549891} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1471549891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1471549891, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1471549891, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1471549891|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1471549891} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:13:25,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-248374152 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-248374152 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-248374152)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-248374152 ~y$r_buff0_thd3~0_Out-248374152)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-248374152, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-248374152} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-248374152|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-248374152, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-248374152} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:13:25,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-943230581 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-943230581 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-943230581 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-943230581 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite14_Out-943230581| ~y$r_buff1_thd3~0_In-943230581)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out-943230581| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-943230581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943230581, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-943230581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943230581} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-943230581|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-943230581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943230581, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-943230581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943230581} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:13:25,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 21:13:25,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1611799854 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1611799854 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite5_Out1611799854| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out1611799854| ~y$w_buff0_used~0_In1611799854)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1611799854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1611799854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1611799854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1611799854, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1611799854|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:13:25,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2139464448 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2139464448 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2139464448 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2139464448 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out2139464448| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite6_Out2139464448| ~y$w_buff1_used~0_In2139464448) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139464448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139464448, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139464448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139464448} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2139464448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2139464448, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2139464448, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out2139464448|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2139464448} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:13:25,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-214573511 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-214573511 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite7_Out-214573511| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out-214573511| ~y$r_buff0_thd2~0_In-214573511) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-214573511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214573511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-214573511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214573511, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-214573511|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:13:25,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In497078788 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In497078788 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In497078788 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In497078788 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite8_Out497078788| 0)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out497078788| ~y$r_buff1_thd2~0_In497078788) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In497078788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497078788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497078788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In497078788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In497078788, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out497078788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497078788} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:13:25,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 21:13:25,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:13:25,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-397197175 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-397197175 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite18_Out-397197175| |ULTIMATE.start_main_#t~ite19_Out-397197175|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-397197175 |ULTIMATE.start_main_#t~ite18_Out-397197175|) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite18_Out-397197175| ~y~0_In-397197175) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-397197175, ~y~0=~y~0_In-397197175, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-397197175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-397197175, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-397197175|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-397197175|, ~y~0=~y~0_In-397197175, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-397197175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:13:25,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In719164731 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In719164731 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out719164731| ~y$w_buff0_used~0_In719164731)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out719164731| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In719164731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719164731} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In719164731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In719164731, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out719164731|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:13:25,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1305699190 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1305699190 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1305699190 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1305699190 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-1305699190| 0)) (and (= ~y$w_buff1_used~0_In-1305699190 |ULTIMATE.start_main_#t~ite21_Out-1305699190|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305699190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1305699190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305699190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1305699190, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1305699190|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:13:25,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1798693962 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1798693962 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1798693962| ~y$r_buff0_thd0~0_In1798693962) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out1798693962| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1798693962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1798693962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1798693962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1798693962, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1798693962|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:13:25,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1976144321 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1976144321 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1976144321 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1976144321 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1976144321 |ULTIMATE.start_main_#t~ite23_Out1976144321|)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1976144321|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1976144321, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1976144321, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1976144321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1976144321, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1976144321, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1976144321|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1976144321} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:13:25,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In371161405 256)))) (or (and (= ~y$w_buff0~0_In371161405 |ULTIMATE.start_main_#t~ite29_Out371161405|) .cse0 (= |ULTIMATE.start_main_#t~ite30_Out371161405| |ULTIMATE.start_main_#t~ite29_Out371161405|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In371161405 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In371161405 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In371161405 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In371161405 256)))))) (and (= |ULTIMATE.start_main_#t~ite29_In371161405| |ULTIMATE.start_main_#t~ite29_Out371161405|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out371161405| ~y$w_buff0~0_In371161405)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In371161405, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In371161405|, ~y$w_buff0~0=~y$w_buff0~0_In371161405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In371161405, ~weak$$choice2~0=~weak$$choice2~0_In371161405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In371161405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In371161405} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out371161405|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In371161405, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out371161405|, ~y$w_buff0~0=~y$w_buff0~0_In371161405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In371161405, ~weak$$choice2~0=~weak$$choice2~0_In371161405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In371161405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In371161405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:13:25,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In123398912 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_In123398912| |ULTIMATE.start_main_#t~ite35_Out123398912|) (= ~y$w_buff0_used~0_In123398912 |ULTIMATE.start_main_#t~ite36_Out123398912|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite36_Out123398912| |ULTIMATE.start_main_#t~ite35_Out123398912|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In123398912 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In123398912 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In123398912 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In123398912 256)))) (= ~y$w_buff0_used~0_In123398912 |ULTIMATE.start_main_#t~ite35_Out123398912|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In123398912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In123398912, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In123398912|, ~weak$$choice2~0=~weak$$choice2~0_In123398912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123398912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123398912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In123398912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In123398912, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out123398912|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out123398912|, ~weak$$choice2~0=~weak$$choice2~0_In123398912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123398912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123398912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:13:25,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-926786190 256) 0))) (or (and (= ~y$w_buff1_used~0_In-926786190 |ULTIMATE.start_main_#t~ite38_Out-926786190|) (= |ULTIMATE.start_main_#t~ite38_Out-926786190| |ULTIMATE.start_main_#t~ite39_Out-926786190|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-926786190 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-926786190 256) 0)) (= (mod ~y$w_buff0_used~0_In-926786190 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-926786190 256) 0))))) (and (not .cse0) (= ~y$w_buff1_used~0_In-926786190 |ULTIMATE.start_main_#t~ite39_Out-926786190|) (= |ULTIMATE.start_main_#t~ite38_In-926786190| |ULTIMATE.start_main_#t~ite38_Out-926786190|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-926786190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-926786190, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-926786190|, ~weak$$choice2~0=~weak$$choice2~0_In-926786190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-926786190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-926786190} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-926786190, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-926786190|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-926786190, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-926786190|, ~weak$$choice2~0=~weak$$choice2~0_In-926786190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-926786190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-926786190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:13:25,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:13:25,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite44_Out1160618584| |ULTIMATE.start_main_#t~ite45_Out1160618584|)) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In1160618584 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1160618584 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1160618584 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In1160618584 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In1160618584 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (= |ULTIMATE.start_main_#t~ite43_Out1160618584| |ULTIMATE.start_main_#t~ite44_Out1160618584|) (= |ULTIMATE.start_main_#t~ite43_Out1160618584| 0) (or (not .cse1) .cse2) (or (not .cse3) .cse2) .cse4 (not .cse5))) (and (= |ULTIMATE.start_main_#t~ite43_In1160618584| |ULTIMATE.start_main_#t~ite43_Out1160618584|) (or (and .cse0 (or .cse5 (and .cse6 .cse3) (and .cse1 .cse6)) (= ~y$r_buff1_thd0~0_In1160618584 |ULTIMATE.start_main_#t~ite44_Out1160618584|) .cse4) (and (not .cse4) (= ~y$r_buff1_thd0~0_In1160618584 |ULTIMATE.start_main_#t~ite45_Out1160618584|) (= |ULTIMATE.start_main_#t~ite44_Out1160618584| |ULTIMATE.start_main_#t~ite44_In1160618584|)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1160618584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1160618584, ~weak$$choice2~0=~weak$$choice2~0_In1160618584, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In1160618584|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1160618584, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1160618584, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1160618584|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1160618584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1160618584, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1160618584|, ~weak$$choice2~0=~weak$$choice2~0_In1160618584, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1160618584, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1160618584|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1160618584|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1160618584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:13:25,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:13:25,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:13:25,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:13:25 BasicIcfg [2019-12-27 21:13:25,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:13:25,992 INFO L168 Benchmark]: Toolchain (without parser) took 24197.78 ms. Allocated memory was 146.8 MB in the beginning and 1.1 GB in the end (delta: 999.8 MB). Free memory was 102.9 MB in the beginning and 477.7 MB in the end (delta: -374.8 MB). Peak memory consumption was 625.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:25,993 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:13:25,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.81 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 155.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:25,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.53 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:25,995 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 150.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:25,996 INFO L168 Benchmark]: RCFGBuilder took 816.73 ms. Allocated memory is still 203.9 MB. Free memory was 150.7 MB in the beginning and 103.1 MB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:25,997 INFO L168 Benchmark]: TraceAbstraction took 22495.19 ms. Allocated memory was 203.9 MB in the beginning and 1.1 GB in the end (delta: 942.7 MB). Free memory was 103.1 MB in the beginning and 477.7 MB in the end (delta: -374.7 MB). Peak memory consumption was 568.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:13:26,004 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.27 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.81 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 155.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.53 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.20 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 150.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.73 ms. Allocated memory is still 203.9 MB. Free memory was 150.7 MB in the beginning and 103.1 MB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22495.19 ms. Allocated memory was 203.9 MB in the beginning and 1.1 GB in the end (delta: 942.7 MB). Free memory was 103.1 MB in the beginning and 477.7 MB in the end (delta: -374.7 MB). Peak memory consumption was 568.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 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) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1890 SDtfs, 2151 SDslu, 4384 SDs, 0 SdLazy, 2558 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22014occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 31173 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 84998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...