/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/mix032_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:55:53,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:55:53,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:55:53,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:55:53,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:55:53,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:55:53,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:55:53,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:55:53,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:55:53,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:55:53,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:55:53,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:55:53,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:55:53,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:55:53,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:55:53,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:55:53,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:55:53,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:55:53,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:55:53,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:55:53,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:55:53,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:55:53,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:55:53,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:55:53,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:55:53,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:55:53,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:55:53,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:55:53,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:55:53,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:55:53,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:55:53,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:55:53,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:55:53,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:55:53,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:55:53,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:55:53,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:55:53,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:55:53,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:55:53,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:55:53,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:55:53,526 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 20:55:53,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:55:53,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:55:53,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:55:53,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:55:53,543 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:55:53,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:55:53,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:55:53,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:55:53,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:55:53,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:55:53,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:55:53,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:55:53,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:55:53,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:55:53,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:55:53,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:55:53,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:55:53,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:55:53,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:55:53,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:55:53,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:55:53,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:55:53,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:55:53,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:55:53,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:55:53,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:55:53,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:55:53,547 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:55:53,547 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:55:53,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:55:53,548 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:55:53,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:55:53,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:55:53,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:55:53,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:55:53,852 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:55:53,852 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:55:53,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-27 20:55:53,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2a2b73f/266d99b0bcfd47768d66eb515649a584/FLAGb037d0325 [2019-12-27 20:55:54,461 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:55:54,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.oepc.i [2019-12-27 20:55:54,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2a2b73f/266d99b0bcfd47768d66eb515649a584/FLAGb037d0325 [2019-12-27 20:55:54,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2a2b73f/266d99b0bcfd47768d66eb515649a584 [2019-12-27 20:55:54,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:55:54,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:55:54,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:54,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:55:54,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:55:54,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:54" (1/1) ... [2019-12-27 20:55:54,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6724b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:54, skipping insertion in model container [2019-12-27 20:55:54,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:54" (1/1) ... [2019-12-27 20:55:54,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:55:54,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:55:55,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:55,412 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:55:55,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:55,555 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:55:55,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55 WrapperNode [2019-12-27 20:55:55,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:55,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:55,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:55:55,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:55:55,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:55,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:55:55,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:55:55,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:55:55,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... [2019-12-27 20:55:55,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:55:55,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:55:55,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:55:55,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:55:55,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:55:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:55:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:55:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:55:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:55:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:55:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:55:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:55:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:55:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:55:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:55:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:55:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:55:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:55:55,790 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 20:55:56,651 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:55:56,651 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:55:56,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:56 BoogieIcfgContainer [2019-12-27 20:55:56,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:55:56,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:55:56,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:55:56,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:55:56,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:55:54" (1/3) ... [2019-12-27 20:55:56,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270aa367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:56, skipping insertion in model container [2019-12-27 20:55:56,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:55" (2/3) ... [2019-12-27 20:55:56,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270aa367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:56, skipping insertion in model container [2019-12-27 20:55:56,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:56" (3/3) ... [2019-12-27 20:55:56,661 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_tso.oepc.i [2019-12-27 20:55:56,671 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:55:56,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:55:56,680 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:55:56,681 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:55:56,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,760 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,760 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,792 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,794 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:56,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:55:56,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:55:56,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:55:56,850 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:55:56,852 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:55:56,852 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:55:56,852 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:55:56,852 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:55:56,852 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:55:56,876 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 20:55:56,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 20:55:57,001 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 20:55:57,001 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:57,024 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:55:57,050 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 20:55:57,157 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 20:55:57,158 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:57,170 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:55:57,193 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:55:57,195 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:56:00,960 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 20:56:01,114 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 20:56:01,141 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86141 [2019-12-27 20:56:01,141 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 20:56:01,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 107 transitions [2019-12-27 20:56:24,863 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 132752 states. [2019-12-27 20:56:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 132752 states. [2019-12-27 20:56:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:56:24,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:24,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:56:24,871 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 920980, now seen corresponding path program 1 times [2019-12-27 20:56:24,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:24,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154361012] [2019-12-27 20:56:24,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:25,234 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 20:56:25,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154361012] [2019-12-27 20:56:25,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:25,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:56:25,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500070396] [2019-12-27 20:56:25,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:25,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:25,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:56:25,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:25,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:25,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:25,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:25,277 INFO L87 Difference]: Start difference. First operand 132752 states. Second operand 3 states. [2019-12-27 20:56:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:26,806 INFO L93 Difference]: Finished difference Result 131526 states and 562532 transitions. [2019-12-27 20:56:26,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:26,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:56:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:31,187 INFO L225 Difference]: With dead ends: 131526 [2019-12-27 20:56:31,187 INFO L226 Difference]: Without dead ends: 123882 [2019-12-27 20:56:31,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123882 states. [2019-12-27 20:56:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123882 to 123882. [2019-12-27 20:56:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123882 states. [2019-12-27 20:56:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123882 states to 123882 states and 529184 transitions. [2019-12-27 20:56:45,091 INFO L78 Accepts]: Start accepts. Automaton has 123882 states and 529184 transitions. Word has length 3 [2019-12-27 20:56:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:45,092 INFO L462 AbstractCegarLoop]: Abstraction has 123882 states and 529184 transitions. [2019-12-27 20:56:45,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 123882 states and 529184 transitions. [2019-12-27 20:56:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:56:45,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:45,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:45,096 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:56:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash 710493958, now seen corresponding path program 1 times [2019-12-27 20:56:45,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:45,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405398502] [2019-12-27 20:56:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:45,223 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 20:56:45,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405398502] [2019-12-27 20:56:45,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:45,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:45,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28146573] [2019-12-27 20:56:45,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:45,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:45,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:56:45,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:45,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:45,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:56:45,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:45,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:56:45,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:45,231 INFO L87 Difference]: Start difference. First operand 123882 states and 529184 transitions. Second operand 4 states. [2019-12-27 20:56:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:52,302 INFO L93 Difference]: Finished difference Result 192368 states and 789500 transitions. [2019-12-27 20:56:52,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:56:52,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:56:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:53,159 INFO L225 Difference]: With dead ends: 192368 [2019-12-27 20:56:53,159 INFO L226 Difference]: Without dead ends: 192319 [2019-12-27 20:56:53,160 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 20:57:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192319 states. [2019-12-27 20:57:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192319 to 176439. [2019-12-27 20:57:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176439 states. [2019-12-27 20:57:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176439 states to 176439 states and 733020 transitions. [2019-12-27 20:57:04,936 INFO L78 Accepts]: Start accepts. Automaton has 176439 states and 733020 transitions. Word has length 11 [2019-12-27 20:57:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:04,936 INFO L462 AbstractCegarLoop]: Abstraction has 176439 states and 733020 transitions. [2019-12-27 20:57:04,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 176439 states and 733020 transitions. [2019-12-27 20:57:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:57:04,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:04,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:04,944 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash 379802942, now seen corresponding path program 1 times [2019-12-27 20:57:04,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:04,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215890512] [2019-12-27 20:57:04,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:04,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 20:57:04,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215890512] [2019-12-27 20:57:04,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:04,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:04,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335843805] [2019-12-27 20:57:04,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:05,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:05,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:57:05,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:05,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:05,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:05,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:05,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:05,004 INFO L87 Difference]: Start difference. First operand 176439 states and 733020 transitions. Second operand 3 states. [2019-12-27 20:57:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:05,178 INFO L93 Difference]: Finished difference Result 37131 states and 120949 transitions. [2019-12-27 20:57:05,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:05,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:57:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:05,260 INFO L225 Difference]: With dead ends: 37131 [2019-12-27 20:57:05,260 INFO L226 Difference]: Without dead ends: 37131 [2019-12-27 20:57:05,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37131 states. [2019-12-27 20:57:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37131 to 37131. [2019-12-27 20:57:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37131 states. [2019-12-27 20:57:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37131 states to 37131 states and 120949 transitions. [2019-12-27 20:57:11,460 INFO L78 Accepts]: Start accepts. Automaton has 37131 states and 120949 transitions. Word has length 13 [2019-12-27 20:57:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:11,460 INFO L462 AbstractCegarLoop]: Abstraction has 37131 states and 120949 transitions. [2019-12-27 20:57:11,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 37131 states and 120949 transitions. [2019-12-27 20:57:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:57:11,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:11,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:11,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash 63930122, now seen corresponding path program 1 times [2019-12-27 20:57:11,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:11,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110246635] [2019-12-27 20:57:11,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:11,578 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 20:57:11,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110246635] [2019-12-27 20:57:11,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:11,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:11,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [990392064] [2019-12-27 20:57:11,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:11,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:11,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:57:11,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:11,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:11,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:57:11,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:57:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:57:11,592 INFO L87 Difference]: Start difference. First operand 37131 states and 120949 transitions. Second operand 5 states. [2019-12-27 20:57:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:12,194 INFO L93 Difference]: Finished difference Result 51130 states and 164640 transitions. [2019-12-27 20:57:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:57:12,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:57:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:12,278 INFO L225 Difference]: With dead ends: 51130 [2019-12-27 20:57:12,279 INFO L226 Difference]: Without dead ends: 51130 [2019-12-27 20:57:12,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51130 states. [2019-12-27 20:57:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51130 to 43859. [2019-12-27 20:57:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43859 states. [2019-12-27 20:57:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43859 states to 43859 states and 142404 transitions. [2019-12-27 20:57:13,106 INFO L78 Accepts]: Start accepts. Automaton has 43859 states and 142404 transitions. Word has length 16 [2019-12-27 20:57:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:13,107 INFO L462 AbstractCegarLoop]: Abstraction has 43859 states and 142404 transitions. [2019-12-27 20:57:13,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:57:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 43859 states and 142404 transitions. [2019-12-27 20:57:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:57:13,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:13,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:13,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:13,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1543064485, now seen corresponding path program 1 times [2019-12-27 20:57:13,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:13,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936335786] [2019-12-27 20:57:13,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:13,265 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 20:57:13,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936335786] [2019-12-27 20:57:13,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:13,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:13,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520471156] [2019-12-27 20:57:13,267 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:13,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:13,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 20:57:13,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:13,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:13,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:57:13,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:57:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:57:13,281 INFO L87 Difference]: Start difference. First operand 43859 states and 142404 transitions. Second operand 6 states. [2019-12-27 20:57:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:14,601 INFO L93 Difference]: Finished difference Result 65194 states and 206492 transitions. [2019-12-27 20:57:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:57:14,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 20:57:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:14,710 INFO L225 Difference]: With dead ends: 65194 [2019-12-27 20:57:14,710 INFO L226 Difference]: Without dead ends: 65187 [2019-12-27 20:57:14,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:57:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65187 states. [2019-12-27 20:57:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65187 to 43757. [2019-12-27 20:57:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43757 states. [2019-12-27 20:57:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43757 states to 43757 states and 141300 transitions. [2019-12-27 20:57:15,653 INFO L78 Accepts]: Start accepts. Automaton has 43757 states and 141300 transitions. Word has length 22 [2019-12-27 20:57:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:15,653 INFO L462 AbstractCegarLoop]: Abstraction has 43757 states and 141300 transitions. [2019-12-27 20:57:15,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:57:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 43757 states and 141300 transitions. [2019-12-27 20:57:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:57:15,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:15,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:15,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 970281241, now seen corresponding path program 1 times [2019-12-27 20:57:15,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:15,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266849564] [2019-12-27 20:57:15,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:15,735 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 20:57:15,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266849564] [2019-12-27 20:57:15,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:15,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:15,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154941786] [2019-12-27 20:57:15,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:15,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:15,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:57:15,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:15,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:15,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:57:15,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:57:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:57:15,751 INFO L87 Difference]: Start difference. First operand 43757 states and 141300 transitions. Second operand 4 states. [2019-12-27 20:57:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:15,817 INFO L93 Difference]: Finished difference Result 17328 states and 52920 transitions. [2019-12-27 20:57:15,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:57:15,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:57:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:15,842 INFO L225 Difference]: With dead ends: 17328 [2019-12-27 20:57:15,842 INFO L226 Difference]: Without dead ends: 17328 [2019-12-27 20:57:15,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:57:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17328 states. [2019-12-27 20:57:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17328 to 17035. [2019-12-27 20:57:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17035 states. [2019-12-27 20:57:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17035 states to 17035 states and 52084 transitions. [2019-12-27 20:57:16,107 INFO L78 Accepts]: Start accepts. Automaton has 17035 states and 52084 transitions. Word has length 25 [2019-12-27 20:57:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:16,107 INFO L462 AbstractCegarLoop]: Abstraction has 17035 states and 52084 transitions. [2019-12-27 20:57:16,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:57:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 17035 states and 52084 transitions. [2019-12-27 20:57:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:57:16,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:16,119 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 20:57:16,119 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 847537641, now seen corresponding path program 1 times [2019-12-27 20:57:16,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:16,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953265328] [2019-12-27 20:57:16,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:16,169 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 20:57:16,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953265328] [2019-12-27 20:57:16,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:16,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:16,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000897682] [2019-12-27 20:57:16,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:16,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:16,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:57:16,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:16,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:16,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:16,182 INFO L87 Difference]: Start difference. First operand 17035 states and 52084 transitions. Second operand 3 states. [2019-12-27 20:57:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:16,513 INFO L93 Difference]: Finished difference Result 24679 states and 73906 transitions. [2019-12-27 20:57:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:16,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 20:57:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:16,546 INFO L225 Difference]: With dead ends: 24679 [2019-12-27 20:57:16,547 INFO L226 Difference]: Without dead ends: 24679 [2019-12-27 20:57:16,547 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 20:57:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24679 states. [2019-12-27 20:57:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24679 to 18893. [2019-12-27 20:57:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18893 states. [2019-12-27 20:57:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18893 states to 18893 states and 57180 transitions. [2019-12-27 20:57:16,866 INFO L78 Accepts]: Start accepts. Automaton has 18893 states and 57180 transitions. Word has length 27 [2019-12-27 20:57:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:16,866 INFO L462 AbstractCegarLoop]: Abstraction has 18893 states and 57180 transitions. [2019-12-27 20:57:16,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18893 states and 57180 transitions. [2019-12-27 20:57:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:57:16,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:16,882 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 20:57:16,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1249538234, now seen corresponding path program 1 times [2019-12-27 20:57:16,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:16,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116060019] [2019-12-27 20:57:16,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:16,969 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 20:57:16,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116060019] [2019-12-27 20:57:16,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:16,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:16,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675574305] [2019-12-27 20:57:16,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:16,975 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:16,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:57:16,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:16,981 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:16,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:57:16,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:57:16,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:57:16,982 INFO L87 Difference]: Start difference. First operand 18893 states and 57180 transitions. Second operand 6 states. [2019-12-27 20:57:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:17,581 INFO L93 Difference]: Finished difference Result 26342 states and 77765 transitions. [2019-12-27 20:57:17,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:57:17,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:57:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:17,619 INFO L225 Difference]: With dead ends: 26342 [2019-12-27 20:57:17,619 INFO L226 Difference]: Without dead ends: 26342 [2019-12-27 20:57:17,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:57:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2019-12-27 20:57:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 21635. [2019-12-27 20:57:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21635 states. [2019-12-27 20:57:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21635 states to 21635 states and 65084 transitions. [2019-12-27 20:57:17,967 INFO L78 Accepts]: Start accepts. Automaton has 21635 states and 65084 transitions. Word has length 27 [2019-12-27 20:57:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:17,968 INFO L462 AbstractCegarLoop]: Abstraction has 21635 states and 65084 transitions. [2019-12-27 20:57:17,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:57:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21635 states and 65084 transitions. [2019-12-27 20:57:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:57:17,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:17,990 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] [2019-12-27 20:57:17,991 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 303260619, now seen corresponding path program 1 times [2019-12-27 20:57:17,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:17,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021860928] [2019-12-27 20:57:17,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:18,098 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 20:57:18,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021860928] [2019-12-27 20:57:18,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:18,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:57:18,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870616848] [2019-12-27 20:57:18,100 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:18,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:18,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 20:57:18,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:18,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:18,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:57:18,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:57:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:57:18,119 INFO L87 Difference]: Start difference. First operand 21635 states and 65084 transitions. Second operand 7 states. [2019-12-27 20:57:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:19,396 INFO L93 Difference]: Finished difference Result 29098 states and 85533 transitions. [2019-12-27 20:57:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:57:19,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 20:57:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:19,438 INFO L225 Difference]: With dead ends: 29098 [2019-12-27 20:57:19,438 INFO L226 Difference]: Without dead ends: 29098 [2019-12-27 20:57:19,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:57:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29098 states. [2019-12-27 20:57:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29098 to 19796. [2019-12-27 20:57:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19796 states. [2019-12-27 20:57:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19796 states to 19796 states and 59787 transitions. [2019-12-27 20:57:19,807 INFO L78 Accepts]: Start accepts. Automaton has 19796 states and 59787 transitions. Word has length 33 [2019-12-27 20:57:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:19,807 INFO L462 AbstractCegarLoop]: Abstraction has 19796 states and 59787 transitions. [2019-12-27 20:57:19,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:57:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19796 states and 59787 transitions. [2019-12-27 20:57:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:57:19,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:19,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:19,831 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1014539128, now seen corresponding path program 1 times [2019-12-27 20:57:19,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:19,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483395653] [2019-12-27 20:57:19,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:19,903 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 20:57:19,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483395653] [2019-12-27 20:57:19,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:19,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:57:19,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680388686] [2019-12-27 20:57:19,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:19,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:20,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 20:57:20,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:20,206 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:57:20,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:20,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:20,207 INFO L87 Difference]: Start difference. First operand 19796 states and 59787 transitions. Second operand 3 states. [2019-12-27 20:57:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:20,276 INFO L93 Difference]: Finished difference Result 19795 states and 59785 transitions. [2019-12-27 20:57:20,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:20,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:57:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:20,304 INFO L225 Difference]: With dead ends: 19795 [2019-12-27 20:57:20,304 INFO L226 Difference]: Without dead ends: 19795 [2019-12-27 20:57:20,305 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 20:57:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19795 states. [2019-12-27 20:57:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19795 to 19795. [2019-12-27 20:57:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19795 states. [2019-12-27 20:57:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19795 states to 19795 states and 59785 transitions. [2019-12-27 20:57:20,611 INFO L78 Accepts]: Start accepts. Automaton has 19795 states and 59785 transitions. Word has length 39 [2019-12-27 20:57:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:20,611 INFO L462 AbstractCegarLoop]: Abstraction has 19795 states and 59785 transitions. [2019-12-27 20:57:20,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19795 states and 59785 transitions. [2019-12-27 20:57:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:57:20,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:20,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:20,634 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 756070649, now seen corresponding path program 1 times [2019-12-27 20:57:20,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:20,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115255547] [2019-12-27 20:57:20,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:20,709 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 20:57:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115255547] [2019-12-27 20:57:20,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:20,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:57:20,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920684582] [2019-12-27 20:57:20,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:20,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:20,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 20:57:20,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:20,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:57:20,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:57:20,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:57:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:57:20,859 INFO L87 Difference]: Start difference. First operand 19795 states and 59785 transitions. Second operand 6 states. [2019-12-27 20:57:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:20,965 INFO L93 Difference]: Finished difference Result 18449 states and 56713 transitions. [2019-12-27 20:57:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:57:20,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:57:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:21,001 INFO L225 Difference]: With dead ends: 18449 [2019-12-27 20:57:21,001 INFO L226 Difference]: Without dead ends: 18449 [2019-12-27 20:57:21,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:57:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2019-12-27 20:57:21,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 17868. [2019-12-27 20:57:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17868 states. [2019-12-27 20:57:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17868 states to 17868 states and 55144 transitions. [2019-12-27 20:57:21,332 INFO L78 Accepts]: Start accepts. Automaton has 17868 states and 55144 transitions. Word has length 40 [2019-12-27 20:57:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:21,332 INFO L462 AbstractCegarLoop]: Abstraction has 17868 states and 55144 transitions. [2019-12-27 20:57:21,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:57:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17868 states and 55144 transitions. [2019-12-27 20:57:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:57:21,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:21,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:21,353 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 465623346, now seen corresponding path program 1 times [2019-12-27 20:57:21,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:21,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529926958] [2019-12-27 20:57:21,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:21,417 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 20:57:21,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529926958] [2019-12-27 20:57:21,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:21,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:21,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [811009837] [2019-12-27 20:57:21,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:21,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:21,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 20:57:21,734 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:21,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:57:21,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:21,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:21,760 INFO L87 Difference]: Start difference. First operand 17868 states and 55144 transitions. Second operand 3 states. [2019-12-27 20:57:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:21,910 INFO L93 Difference]: Finished difference Result 23807 states and 72041 transitions. [2019-12-27 20:57:21,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:21,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:57:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:21,960 INFO L225 Difference]: With dead ends: 23807 [2019-12-27 20:57:21,960 INFO L226 Difference]: Without dead ends: 23807 [2019-12-27 20:57:21,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23807 states. [2019-12-27 20:57:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23807 to 17426. [2019-12-27 20:57:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17426 states. [2019-12-27 20:57:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17426 states to 17426 states and 53191 transitions. [2019-12-27 20:57:22,571 INFO L78 Accepts]: Start accepts. Automaton has 17426 states and 53191 transitions. Word has length 64 [2019-12-27 20:57:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:22,571 INFO L462 AbstractCegarLoop]: Abstraction has 17426 states and 53191 transitions. [2019-12-27 20:57:22,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17426 states and 53191 transitions. [2019-12-27 20:57:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:57:22,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:22,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:22,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -693487797, now seen corresponding path program 1 times [2019-12-27 20:57:22,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:22,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75722146] [2019-12-27 20:57:22,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:22,718 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 20:57:22,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75722146] [2019-12-27 20:57:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:22,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:57:22,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088030457] [2019-12-27 20:57:22,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:22,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:23,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 20:57:23,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:23,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:57:23,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:57:23,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:23,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:57:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:57:23,080 INFO L87 Difference]: Start difference. First operand 17426 states and 53191 transitions. Second operand 9 states. [2019-12-27 20:57:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:26,130 INFO L93 Difference]: Finished difference Result 74859 states and 223762 transitions. [2019-12-27 20:57:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 20:57:26,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 20:57:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:26,214 INFO L225 Difference]: With dead ends: 74859 [2019-12-27 20:57:26,214 INFO L226 Difference]: Without dead ends: 58507 [2019-12-27 20:57:26,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:57:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58507 states. [2019-12-27 20:57:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58507 to 20749. [2019-12-27 20:57:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20749 states. [2019-12-27 20:57:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20749 states to 20749 states and 63592 transitions. [2019-12-27 20:57:27,190 INFO L78 Accepts]: Start accepts. Automaton has 20749 states and 63592 transitions. Word has length 64 [2019-12-27 20:57:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:27,190 INFO L462 AbstractCegarLoop]: Abstraction has 20749 states and 63592 transitions. [2019-12-27 20:57:27,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:57:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20749 states and 63592 transitions. [2019-12-27 20:57:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:57:27,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:27,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:27,220 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1789693793, now seen corresponding path program 2 times [2019-12-27 20:57:27,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:27,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687390008] [2019-12-27 20:57:27,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:27,313 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 20:57:27,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687390008] [2019-12-27 20:57:27,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:27,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:57:27,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294139763] [2019-12-27 20:57:27,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:27,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:27,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 348 transitions. [2019-12-27 20:57:27,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:27,531 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:57:27,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:57:27,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:27,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:57:27,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:57:27,532 INFO L87 Difference]: Start difference. First operand 20749 states and 63592 transitions. Second operand 8 states. [2019-12-27 20:57:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:30,285 INFO L93 Difference]: Finished difference Result 80209 states and 242038 transitions. [2019-12-27 20:57:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 20:57:30,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 20:57:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:30,365 INFO L225 Difference]: With dead ends: 80209 [2019-12-27 20:57:30,365 INFO L226 Difference]: Without dead ends: 54612 [2019-12-27 20:57:30,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:57:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54612 states. [2019-12-27 20:57:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54612 to 25968. [2019-12-27 20:57:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25968 states. [2019-12-27 20:57:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25968 states to 25968 states and 79415 transitions. [2019-12-27 20:57:31,008 INFO L78 Accepts]: Start accepts. Automaton has 25968 states and 79415 transitions. Word has length 64 [2019-12-27 20:57:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:31,008 INFO L462 AbstractCegarLoop]: Abstraction has 25968 states and 79415 transitions. [2019-12-27 20:57:31,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:57:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 25968 states and 79415 transitions. [2019-12-27 20:57:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:57:31,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:31,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:31,036 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 679233867, now seen corresponding path program 3 times [2019-12-27 20:57:31,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:31,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272518326] [2019-12-27 20:57:31,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:31,446 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 20:57:31,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272518326] [2019-12-27 20:57:31,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:31,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:57:31,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562488435] [2019-12-27 20:57:31,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:31,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:31,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 245 transitions. [2019-12-27 20:57:31,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:31,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:57:31,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:57:31,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:57:31,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:57:31,652 INFO L87 Difference]: Start difference. First operand 25968 states and 79415 transitions. Second operand 11 states. [2019-12-27 20:57:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:34,337 INFO L93 Difference]: Finished difference Result 93511 states and 282700 transitions. [2019-12-27 20:57:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:57:34,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 20:57:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:34,471 INFO L225 Difference]: With dead ends: 93511 [2019-12-27 20:57:34,471 INFO L226 Difference]: Without dead ends: 90888 [2019-12-27 20:57:34,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 20:57:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90888 states. [2019-12-27 20:57:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90888 to 26161. [2019-12-27 20:57:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26161 states. [2019-12-27 20:57:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26161 states to 26161 states and 80275 transitions. [2019-12-27 20:57:35,427 INFO L78 Accepts]: Start accepts. Automaton has 26161 states and 80275 transitions. Word has length 64 [2019-12-27 20:57:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:35,427 INFO L462 AbstractCegarLoop]: Abstraction has 26161 states and 80275 transitions. [2019-12-27 20:57:35,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:57:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 26161 states and 80275 transitions. [2019-12-27 20:57:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:57:35,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:35,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:35,458 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash -101721945, now seen corresponding path program 4 times [2019-12-27 20:57:35,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:35,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434374911] [2019-12-27 20:57:35,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:35,527 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 20:57:35,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434374911] [2019-12-27 20:57:35,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:35,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:57:35,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1690731902] [2019-12-27 20:57:35,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:35,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:36,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 558 transitions. [2019-12-27 20:57:36,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:36,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:57:36,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:36,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:36,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:36,180 INFO L87 Difference]: Start difference. First operand 26161 states and 80275 transitions. Second operand 3 states. [2019-12-27 20:57:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:36,388 INFO L93 Difference]: Finished difference Result 30476 states and 93350 transitions. [2019-12-27 20:57:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:36,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:57:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:36,446 INFO L225 Difference]: With dead ends: 30476 [2019-12-27 20:57:36,447 INFO L226 Difference]: Without dead ends: 30476 [2019-12-27 20:57:36,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 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 20:57:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30476 states. [2019-12-27 20:57:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30476 to 27118. [2019-12-27 20:57:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27118 states. [2019-12-27 20:57:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27118 states to 27118 states and 83438 transitions. [2019-12-27 20:57:36,956 INFO L78 Accepts]: Start accepts. Automaton has 27118 states and 83438 transitions. Word has length 64 [2019-12-27 20:57:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:36,957 INFO L462 AbstractCegarLoop]: Abstraction has 27118 states and 83438 transitions. [2019-12-27 20:57:36,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27118 states and 83438 transitions. [2019-12-27 20:57:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:57:36,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:36,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:36,988 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash -255354465, now seen corresponding path program 1 times [2019-12-27 20:57:36,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:36,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654040058] [2019-12-27 20:57:36,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:37,045 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 20:57:37,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654040058] [2019-12-27 20:57:37,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:37,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:57:37,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566149501] [2019-12-27 20:57:37,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:37,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:37,184 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 211 transitions. [2019-12-27 20:57:37,184 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:37,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:57:37,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:57:37,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:57:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:57:37,187 INFO L87 Difference]: Start difference. First operand 27118 states and 83438 transitions. Second operand 3 states. [2019-12-27 20:57:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:37,428 INFO L93 Difference]: Finished difference Result 38047 states and 117827 transitions. [2019-12-27 20:57:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:57:37,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:57:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:37,483 INFO L225 Difference]: With dead ends: 38047 [2019-12-27 20:57:37,483 INFO L226 Difference]: Without dead ends: 38047 [2019-12-27 20:57:37,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 20:57:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38047 states. [2019-12-27 20:57:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38047 to 27977. [2019-12-27 20:57:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27977 states. [2019-12-27 20:57:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27977 states to 27977 states and 86074 transitions. [2019-12-27 20:57:37,997 INFO L78 Accepts]: Start accepts. Automaton has 27977 states and 86074 transitions. Word has length 65 [2019-12-27 20:57:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:37,998 INFO L462 AbstractCegarLoop]: Abstraction has 27977 states and 86074 transitions. [2019-12-27 20:57:37,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:57:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27977 states and 86074 transitions. [2019-12-27 20:57:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:57:38,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:38,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:38,297 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1966497405, now seen corresponding path program 2 times [2019-12-27 20:57:38,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:38,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912168314] [2019-12-27 20:57:38,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:38,428 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 20:57:38,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912168314] [2019-12-27 20:57:38,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:38,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:57:38,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875460895] [2019-12-27 20:57:38,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:38,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:38,659 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 355 transitions. [2019-12-27 20:57:38,659 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:38,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:57:38,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:57:38,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:38,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:57:38,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:57:38,696 INFO L87 Difference]: Start difference. First operand 27977 states and 86074 transitions. Second operand 9 states. [2019-12-27 20:57:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:41,500 INFO L93 Difference]: Finished difference Result 99183 states and 299680 transitions. [2019-12-27 20:57:41,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:57:41,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:57:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:41,637 INFO L225 Difference]: With dead ends: 99183 [2019-12-27 20:57:41,638 INFO L226 Difference]: Without dead ends: 85933 [2019-12-27 20:57:41,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 20:57:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85933 states. [2019-12-27 20:57:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85933 to 28984. [2019-12-27 20:57:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28984 states. [2019-12-27 20:57:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 89435 transitions. [2019-12-27 20:57:42,583 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 89435 transitions. Word has length 65 [2019-12-27 20:57:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:42,583 INFO L462 AbstractCegarLoop]: Abstraction has 28984 states and 89435 transitions. [2019-12-27 20:57:42,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:57:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 89435 transitions. [2019-12-27 20:57:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:57:42,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:42,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:42,618 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 765140549, now seen corresponding path program 3 times [2019-12-27 20:57:42,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:42,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776098126] [2019-12-27 20:57:42,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:42,794 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 20:57:42,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776098126] [2019-12-27 20:57:42,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:42,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:57:42,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028528369] [2019-12-27 20:57:42,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:42,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:43,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 367 transitions. [2019-12-27 20:57:43,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:43,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:57:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:57:43,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:57:43,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:57:43,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:57:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:57:43,482 INFO L87 Difference]: Start difference. First operand 28984 states and 89435 transitions. Second operand 12 states. [2019-12-27 20:57:44,041 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 20:57:44,282 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 20:57:44,671 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 20:57:44,907 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 20:57:45,110 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-27 20:57:45,752 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 20:57:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:50,953 INFO L93 Difference]: Finished difference Result 124633 states and 375795 transitions. [2019-12-27 20:57:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 20:57:50,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 20:57:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:51,125 INFO L225 Difference]: With dead ends: 124633 [2019-12-27 20:57:51,126 INFO L226 Difference]: Without dead ends: 106060 [2019-12-27 20:57:51,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2285 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1056, Invalid=5264, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 20:57:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106060 states. [2019-12-27 20:57:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106060 to 30560. [2019-12-27 20:57:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30560 states. [2019-12-27 20:57:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30560 states to 30560 states and 94792 transitions. [2019-12-27 20:57:52,640 INFO L78 Accepts]: Start accepts. Automaton has 30560 states and 94792 transitions. Word has length 65 [2019-12-27 20:57:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:52,640 INFO L462 AbstractCegarLoop]: Abstraction has 30560 states and 94792 transitions. [2019-12-27 20:57:52,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:57:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30560 states and 94792 transitions. [2019-12-27 20:57:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:57:52,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:52,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:52,675 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash 457053945, now seen corresponding path program 4 times [2019-12-27 20:57:52,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:52,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976231693] [2019-12-27 20:57:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:52,804 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 20:57:52,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976231693] [2019-12-27 20:57:52,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:52,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:57:52,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550460081] [2019-12-27 20:57:52,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:52,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:53,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 356 transitions. [2019-12-27 20:57:53,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:53,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:57:53,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:57:53,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:57:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:57:53,050 INFO L87 Difference]: Start difference. First operand 30560 states and 94792 transitions. Second operand 9 states. [2019-12-27 20:57:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:54,407 INFO L93 Difference]: Finished difference Result 89539 states and 269304 transitions. [2019-12-27 20:57:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 20:57:54,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:57:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:54,532 INFO L225 Difference]: With dead ends: 89539 [2019-12-27 20:57:54,532 INFO L226 Difference]: Without dead ends: 85538 [2019-12-27 20:57:54,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:57:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85538 states. [2019-12-27 20:57:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85538 to 30431. [2019-12-27 20:57:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30431 states. [2019-12-27 20:57:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30431 states to 30431 states and 94157 transitions. [2019-12-27 20:57:55,872 INFO L78 Accepts]: Start accepts. Automaton has 30431 states and 94157 transitions. Word has length 65 [2019-12-27 20:57:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:55,873 INFO L462 AbstractCegarLoop]: Abstraction has 30431 states and 94157 transitions. [2019-12-27 20:57:55,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:57:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30431 states and 94157 transitions. [2019-12-27 20:57:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:57:55,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:55,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:55,906 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1618555097, now seen corresponding path program 5 times [2019-12-27 20:57:55,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:55,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772882834] [2019-12-27 20:57:55,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:56,056 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 20:57:56,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772882834] [2019-12-27 20:57:56,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:56,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:57:56,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582884614] [2019-12-27 20:57:56,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:56,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:56,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 502 transitions. [2019-12-27 20:57:56,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:56,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:57:56,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:57:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:57:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:57:56,452 INFO L87 Difference]: Start difference. First operand 30431 states and 94157 transitions. Second operand 8 states. [2019-12-27 20:57:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:57:57,582 INFO L93 Difference]: Finished difference Result 48615 states and 150579 transitions. [2019-12-27 20:57:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:57:57,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 20:57:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:57:57,702 INFO L225 Difference]: With dead ends: 48615 [2019-12-27 20:57:57,702 INFO L226 Difference]: Without dead ends: 48615 [2019-12-27 20:57:57,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:57:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48615 states. [2019-12-27 20:57:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48615 to 34270. [2019-12-27 20:57:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34270 states. [2019-12-27 20:57:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34270 states to 34270 states and 106652 transitions. [2019-12-27 20:57:58,484 INFO L78 Accepts]: Start accepts. Automaton has 34270 states and 106652 transitions. Word has length 65 [2019-12-27 20:57:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:57:58,484 INFO L462 AbstractCegarLoop]: Abstraction has 34270 states and 106652 transitions. [2019-12-27 20:57:58,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:57:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34270 states and 106652 transitions. [2019-12-27 20:57:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:57:58,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:57:58,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:57:58,527 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:57:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:57:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1430272868, now seen corresponding path program 1 times [2019-12-27 20:57:58,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:57:58,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272284341] [2019-12-27 20:57:58,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:57:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:57:58,774 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 20:57:58,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272284341] [2019-12-27 20:57:58,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:57:58,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:57:58,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802038045] [2019-12-27 20:57:58,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:57:58,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:57:59,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 377 transitions. [2019-12-27 20:57:59,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:57:59,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:57:59,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:57:59,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:57:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:57:59,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:57:59,623 INFO L87 Difference]: Start difference. First operand 34270 states and 106652 transitions. Second operand 13 states. [2019-12-27 20:58:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:03,497 INFO L93 Difference]: Finished difference Result 70553 states and 214407 transitions. [2019-12-27 20:58:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 20:58:03,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 20:58:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:03,602 INFO L225 Difference]: With dead ends: 70553 [2019-12-27 20:58:03,602 INFO L226 Difference]: Without dead ends: 70301 [2019-12-27 20:58:03,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 20:58:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70301 states. [2019-12-27 20:58:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70301 to 42201. [2019-12-27 20:58:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42201 states. [2019-12-27 20:58:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42201 states to 42201 states and 130266 transitions. [2019-12-27 20:58:04,489 INFO L78 Accepts]: Start accepts. Automaton has 42201 states and 130266 transitions. Word has length 65 [2019-12-27 20:58:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:04,489 INFO L462 AbstractCegarLoop]: Abstraction has 42201 states and 130266 transitions. [2019-12-27 20:58:04,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:58:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 42201 states and 130266 transitions. [2019-12-27 20:58:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:58:04,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:04,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:04,545 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash -309958138, now seen corresponding path program 2 times [2019-12-27 20:58:04,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:04,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116974657] [2019-12-27 20:58:04,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:04,778 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 20:58:04,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116974657] [2019-12-27 20:58:04,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:04,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:58:04,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1042729932] [2019-12-27 20:58:04,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:04,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:05,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 343 transitions. [2019-12-27 20:58:05,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:05,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:58:05,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:58:05,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:58:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:58:05,185 INFO L87 Difference]: Start difference. First operand 42201 states and 130266 transitions. Second operand 11 states. [2019-12-27 20:58:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:08,098 INFO L93 Difference]: Finished difference Result 62851 states and 187628 transitions. [2019-12-27 20:58:08,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:58:08,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 20:58:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:08,195 INFO L225 Difference]: With dead ends: 62851 [2019-12-27 20:58:08,195 INFO L226 Difference]: Without dead ends: 62236 [2019-12-27 20:58:08,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-12-27 20:58:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62236 states. [2019-12-27 20:58:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62236 to 46793. [2019-12-27 20:58:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46793 states. [2019-12-27 20:58:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46793 states to 46793 states and 141537 transitions. [2019-12-27 20:58:09,087 INFO L78 Accepts]: Start accepts. Automaton has 46793 states and 141537 transitions. Word has length 65 [2019-12-27 20:58:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:09,087 INFO L462 AbstractCegarLoop]: Abstraction has 46793 states and 141537 transitions. [2019-12-27 20:58:09,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:58:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46793 states and 141537 transitions. [2019-12-27 20:58:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:58:09,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:09,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:09,142 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -306425438, now seen corresponding path program 3 times [2019-12-27 20:58:09,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:09,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488590173] [2019-12-27 20:58:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:09,194 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 20:58:09,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488590173] [2019-12-27 20:58:09,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:09,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:09,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805617613] [2019-12-27 20:58:09,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:09,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:09,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 280 transitions. [2019-12-27 20:58:09,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:09,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:09,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:09,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:09,422 INFO L87 Difference]: Start difference. First operand 46793 states and 141537 transitions. Second operand 3 states. [2019-12-27 20:58:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:09,577 INFO L93 Difference]: Finished difference Result 46792 states and 141535 transitions. [2019-12-27 20:58:09,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:09,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:58:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:09,648 INFO L225 Difference]: With dead ends: 46792 [2019-12-27 20:58:09,648 INFO L226 Difference]: Without dead ends: 46792 [2019-12-27 20:58:09,648 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 20:58:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46792 states. [2019-12-27 20:58:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46792 to 37349. [2019-12-27 20:58:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37349 states. [2019-12-27 20:58:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37349 states to 37349 states and 114960 transitions. [2019-12-27 20:58:10,846 INFO L78 Accepts]: Start accepts. Automaton has 37349 states and 114960 transitions. Word has length 65 [2019-12-27 20:58:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:10,846 INFO L462 AbstractCegarLoop]: Abstraction has 37349 states and 114960 transitions. [2019-12-27 20:58:10,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 37349 states and 114960 transitions. [2019-12-27 20:58:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:58:10,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:10,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:10,890 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash -486988441, now seen corresponding path program 1 times [2019-12-27 20:58:10,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:10,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173499398] [2019-12-27 20:58:10,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:10,950 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 20:58:10,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173499398] [2019-12-27 20:58:10,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:10,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:10,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003992689] [2019-12-27 20:58:10,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:10,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:11,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 355 transitions. [2019-12-27 20:58:11,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:11,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:58:11,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:11,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:11,310 INFO L87 Difference]: Start difference. First operand 37349 states and 114960 transitions. Second operand 4 states. [2019-12-27 20:58:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:11,704 INFO L93 Difference]: Finished difference Result 37565 states and 113260 transitions. [2019-12-27 20:58:11,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:11,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 20:58:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:11,764 INFO L225 Difference]: With dead ends: 37565 [2019-12-27 20:58:11,764 INFO L226 Difference]: Without dead ends: 37565 [2019-12-27 20:58:11,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37565 states. [2019-12-27 20:58:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37565 to 28438. [2019-12-27 20:58:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28438 states. [2019-12-27 20:58:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28438 states to 28438 states and 86456 transitions. [2019-12-27 20:58:12,258 INFO L78 Accepts]: Start accepts. Automaton has 28438 states and 86456 transitions. Word has length 66 [2019-12-27 20:58:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:12,258 INFO L462 AbstractCegarLoop]: Abstraction has 28438 states and 86456 transitions. [2019-12-27 20:58:12,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 28438 states and 86456 transitions. [2019-12-27 20:58:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:12,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:12,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:12,290 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 52139489, now seen corresponding path program 1 times [2019-12-27 20:58:12,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:12,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372757719] [2019-12-27 20:58:12,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:12,447 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 20:58:12,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372757719] [2019-12-27 20:58:12,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:12,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:58:12,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955597314] [2019-12-27 20:58:12,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:12,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:12,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 464 transitions. [2019-12-27 20:58:12,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:12,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:58:12,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:58:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:58:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:58:12,749 INFO L87 Difference]: Start difference. First operand 28438 states and 86456 transitions. Second operand 11 states. [2019-12-27 20:58:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:16,057 INFO L93 Difference]: Finished difference Result 71036 states and 214933 transitions. [2019-12-27 20:58:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 20:58:16,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 20:58:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:16,157 INFO L225 Difference]: With dead ends: 71036 [2019-12-27 20:58:16,157 INFO L226 Difference]: Without dead ends: 71036 [2019-12-27 20:58:16,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=508, Invalid=1562, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 20:58:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71036 states. [2019-12-27 20:58:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71036 to 31805. [2019-12-27 20:58:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31805 states. [2019-12-27 20:58:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31805 states to 31805 states and 97747 transitions. [2019-12-27 20:58:16,964 INFO L78 Accepts]: Start accepts. Automaton has 31805 states and 97747 transitions. Word has length 67 [2019-12-27 20:58:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:16,964 INFO L462 AbstractCegarLoop]: Abstraction has 31805 states and 97747 transitions. [2019-12-27 20:58:16,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:58:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 31805 states and 97747 transitions. [2019-12-27 20:58:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:17,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:17,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:17,003 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:17,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:17,003 INFO L82 PathProgramCache]: Analyzing trace with hash -577174194, now seen corresponding path program 1 times [2019-12-27 20:58:17,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:17,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55835919] [2019-12-27 20:58:17,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:17,162 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 20:58:17,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55835919] [2019-12-27 20:58:17,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:17,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:58:17,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802176309] [2019-12-27 20:58:17,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:17,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:17,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 334 transitions. [2019-12-27 20:58:17,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:17,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:58:17,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:58:17,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:58:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:58:17,388 INFO L87 Difference]: Start difference. First operand 31805 states and 97747 transitions. Second operand 10 states. [2019-12-27 20:58:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:18,652 INFO L93 Difference]: Finished difference Result 43892 states and 133944 transitions. [2019-12-27 20:58:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:58:18,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 20:58:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:18,712 INFO L225 Difference]: With dead ends: 43892 [2019-12-27 20:58:18,712 INFO L226 Difference]: Without dead ends: 36981 [2019-12-27 20:58:18,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:58:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36981 states. [2019-12-27 20:58:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36981 to 32383. [2019-12-27 20:58:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32383 states. [2019-12-27 20:58:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32383 states to 32383 states and 99331 transitions. [2019-12-27 20:58:19,798 INFO L78 Accepts]: Start accepts. Automaton has 32383 states and 99331 transitions. Word has length 67 [2019-12-27 20:58:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:19,798 INFO L462 AbstractCegarLoop]: Abstraction has 32383 states and 99331 transitions. [2019-12-27 20:58:19,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:58:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 32383 states and 99331 transitions. [2019-12-27 20:58:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:19,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:19,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:19,834 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 88220959, now seen corresponding path program 2 times [2019-12-27 20:58:19,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:19,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425305169] [2019-12-27 20:58:19,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:19,918 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 20:58:19,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425305169] [2019-12-27 20:58:19,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:19,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:19,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032776072] [2019-12-27 20:58:19,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:19,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:20,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 463 transitions. [2019-12-27 20:58:20,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:20,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:58:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:20,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:20,341 INFO L87 Difference]: Start difference. First operand 32383 states and 99331 transitions. Second operand 4 states. [2019-12-27 20:58:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:20,564 INFO L93 Difference]: Finished difference Result 32170 states and 98442 transitions. [2019-12-27 20:58:20,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:20,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 20:58:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:20,627 INFO L225 Difference]: With dead ends: 32170 [2019-12-27 20:58:20,628 INFO L226 Difference]: Without dead ends: 32170 [2019-12-27 20:58:20,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 7 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 20:58:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32170 states. [2019-12-27 20:58:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32170 to 24626. [2019-12-27 20:58:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24626 states. [2019-12-27 20:58:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24626 states to 24626 states and 74438 transitions. [2019-12-27 20:58:21,093 INFO L78 Accepts]: Start accepts. Automaton has 24626 states and 74438 transitions. Word has length 67 [2019-12-27 20:58:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:21,093 INFO L462 AbstractCegarLoop]: Abstraction has 24626 states and 74438 transitions. [2019-12-27 20:58:21,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24626 states and 74438 transitions. [2019-12-27 20:58:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:21,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:21,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:21,123 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:21,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1795964016, now seen corresponding path program 2 times [2019-12-27 20:58:21,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:21,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479972144] [2019-12-27 20:58:21,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:21,291 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 20:58:21,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479972144] [2019-12-27 20:58:21,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:21,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:58:21,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1096639856] [2019-12-27 20:58:21,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:21,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:21,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 341 transitions. [2019-12-27 20:58:21,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:21,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:58:21,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:58:21,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:58:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:58:21,692 INFO L87 Difference]: Start difference. First operand 24626 states and 74438 transitions. Second operand 11 states. [2019-12-27 20:58:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:23,286 INFO L93 Difference]: Finished difference Result 40223 states and 120507 transitions. [2019-12-27 20:58:23,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:58:23,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 20:58:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:23,341 INFO L225 Difference]: With dead ends: 40223 [2019-12-27 20:58:23,341 INFO L226 Difference]: Without dead ends: 36423 [2019-12-27 20:58:23,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:58:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36423 states. [2019-12-27 20:58:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36423 to 25099. [2019-12-27 20:58:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25099 states. [2019-12-27 20:58:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25099 states to 25099 states and 75593 transitions. [2019-12-27 20:58:24,001 INFO L78 Accepts]: Start accepts. Automaton has 25099 states and 75593 transitions. Word has length 67 [2019-12-27 20:58:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:24,001 INFO L462 AbstractCegarLoop]: Abstraction has 25099 states and 75593 transitions. [2019-12-27 20:58:24,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:58:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 25099 states and 75593 transitions. [2019-12-27 20:58:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:24,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:24,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:24,030 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash -970985194, now seen corresponding path program 3 times [2019-12-27 20:58:24,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:24,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577380133] [2019-12-27 20:58:24,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:24,180 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 20:58:24,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577380133] [2019-12-27 20:58:24,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:24,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:58:24,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796463664] [2019-12-27 20:58:24,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:24,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:24,386 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 482 transitions. [2019-12-27 20:58:24,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:24,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:58:24,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:58:24,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:58:24,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:58:24,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:58:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:58:24,607 INFO L87 Difference]: Start difference. First operand 25099 states and 75593 transitions. Second operand 14 states. [2019-12-27 20:58:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:26,205 INFO L93 Difference]: Finished difference Result 32621 states and 97237 transitions. [2019-12-27 20:58:26,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:58:26,205 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 20:58:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:26,249 INFO L225 Difference]: With dead ends: 32621 [2019-12-27 20:58:26,249 INFO L226 Difference]: Without dead ends: 29445 [2019-12-27 20:58:26,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:58:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29445 states. [2019-12-27 20:58:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29445 to 24743. [2019-12-27 20:58:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 20:58:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 74542 transitions. [2019-12-27 20:58:26,637 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 74542 transitions. Word has length 67 [2019-12-27 20:58:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:26,637 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 74542 transitions. [2019-12-27 20:58:26,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:58:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 74542 transitions. [2019-12-27 20:58:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:26,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:26,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:26,663 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2371798, now seen corresponding path program 4 times [2019-12-27 20:58:26,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:26,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759544696] [2019-12-27 20:58:26,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:26,832 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 20:58:26,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759544696] [2019-12-27 20:58:26,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:26,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:58:26,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381907082] [2019-12-27 20:58:26,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:26,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:27,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 20:58:27,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:27,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:58:27,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:58:27,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:58:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:27,101 INFO L87 Difference]: Start difference. First operand 24743 states and 74542 transitions. Second operand 16 states. [2019-12-27 20:58:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:32,162 INFO L93 Difference]: Finished difference Result 63309 states and 190505 transitions. [2019-12-27 20:58:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 20:58:32,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:58:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:32,259 INFO L225 Difference]: With dead ends: 63309 [2019-12-27 20:58:32,259 INFO L226 Difference]: Without dead ends: 57906 [2019-12-27 20:58:32,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=628, Invalid=4342, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 20:58:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57906 states. [2019-12-27 20:58:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57906 to 31891. [2019-12-27 20:58:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31891 states. [2019-12-27 20:58:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31891 states to 31891 states and 96127 transitions. [2019-12-27 20:58:32,956 INFO L78 Accepts]: Start accepts. Automaton has 31891 states and 96127 transitions. Word has length 67 [2019-12-27 20:58:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:32,956 INFO L462 AbstractCegarLoop]: Abstraction has 31891 states and 96127 transitions. [2019-12-27 20:58:32,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:58:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31891 states and 96127 transitions. [2019-12-27 20:58:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:32,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:32,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:32,988 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1144414374, now seen corresponding path program 5 times [2019-12-27 20:58:32,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:32,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291867260] [2019-12-27 20:58:32,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:33,519 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 20:58:33,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291867260] [2019-12-27 20:58:33,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:33,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 20:58:33,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1397503712] [2019-12-27 20:58:33,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:33,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:33,941 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 635 transitions. [2019-12-27 20:58:33,941 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:34,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:58:34,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:58:34,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:58:34,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:58:34,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:58:34,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 20:58:34,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 20:58:34,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:34,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 20:58:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-12-27 20:58:34,599 INFO L87 Difference]: Start difference. First operand 31891 states and 96127 transitions. Second operand 28 states. [2019-12-27 20:58:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:41,307 INFO L93 Difference]: Finished difference Result 60277 states and 178796 transitions. [2019-12-27 20:58:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 20:58:41,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2019-12-27 20:58:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:41,393 INFO L225 Difference]: With dead ends: 60277 [2019-12-27 20:58:41,393 INFO L226 Difference]: Without dead ends: 58196 [2019-12-27 20:58:41,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=421, Invalid=3361, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 20:58:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58196 states. [2019-12-27 20:58:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58196 to 30856. [2019-12-27 20:58:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30856 states. [2019-12-27 20:58:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30856 states to 30856 states and 92977 transitions. [2019-12-27 20:58:42,041 INFO L78 Accepts]: Start accepts. Automaton has 30856 states and 92977 transitions. Word has length 67 [2019-12-27 20:58:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:42,042 INFO L462 AbstractCegarLoop]: Abstraction has 30856 states and 92977 transitions. [2019-12-27 20:58:42,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 20:58:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30856 states and 92977 transitions. [2019-12-27 20:58:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:42,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:42,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:42,075 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash -669641542, now seen corresponding path program 6 times [2019-12-27 20:58:42,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:42,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562006859] [2019-12-27 20:58:42,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:42,236 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 20:58:42,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562006859] [2019-12-27 20:58:42,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:42,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:58:42,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671871582] [2019-12-27 20:58:42,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:42,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:42,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 559 transitions. [2019-12-27 20:58:42,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:42,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:58:42,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:58:42,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:58:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:42,565 INFO L87 Difference]: Start difference. First operand 30856 states and 92977 transitions. Second operand 16 states. [2019-12-27 20:58:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:52,891 INFO L93 Difference]: Finished difference Result 101274 states and 301690 transitions. [2019-12-27 20:58:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-12-27 20:58:52,891 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:58:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:53,026 INFO L225 Difference]: With dead ends: 101274 [2019-12-27 20:58:53,026 INFO L226 Difference]: Without dead ends: 88401 [2019-12-27 20:58:53,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10936 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3301, Invalid=23431, Unknown=0, NotChecked=0, Total=26732 [2019-12-27 20:58:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88401 states. [2019-12-27 20:58:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88401 to 31293. [2019-12-27 20:58:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31293 states. [2019-12-27 20:58:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31293 states to 31293 states and 94080 transitions. [2019-12-27 20:58:54,205 INFO L78 Accepts]: Start accepts. Automaton has 31293 states and 94080 transitions. Word has length 67 [2019-12-27 20:58:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:54,206 INFO L462 AbstractCegarLoop]: Abstraction has 31293 states and 94080 transitions. [2019-12-27 20:58:54,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:58:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 31293 states and 94080 transitions. [2019-12-27 20:58:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:54,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:54,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:54,241 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash -912279478, now seen corresponding path program 7 times [2019-12-27 20:58:54,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:54,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127004582] [2019-12-27 20:58:54,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:54,406 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 20:58:54,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127004582] [2019-12-27 20:58:54,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:54,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:58:54,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258939404] [2019-12-27 20:58:54,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:54,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:54,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 470 transitions. [2019-12-27 20:58:54,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:54,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:58:54,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:58:54,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:58:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:58:54,696 INFO L87 Difference]: Start difference. First operand 31293 states and 94080 transitions. Second operand 12 states. [2019-12-27 20:58:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:55,768 INFO L93 Difference]: Finished difference Result 51696 states and 154507 transitions. [2019-12-27 20:58:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:58:55,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 20:58:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:55,839 INFO L225 Difference]: With dead ends: 51696 [2019-12-27 20:58:55,839 INFO L226 Difference]: Without dead ends: 45289 [2019-12-27 20:58:55,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:58:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45289 states. [2019-12-27 20:58:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45289 to 28915. [2019-12-27 20:58:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28915 states. [2019-12-27 20:58:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28915 states to 28915 states and 87097 transitions. [2019-12-27 20:58:56,409 INFO L78 Accepts]: Start accepts. Automaton has 28915 states and 87097 transitions. Word has length 67 [2019-12-27 20:58:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:56,409 INFO L462 AbstractCegarLoop]: Abstraction has 28915 states and 87097 transitions. [2019-12-27 20:58:56,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:58:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 28915 states and 87097 transitions. [2019-12-27 20:58:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:58:56,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:56,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:56,440 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 827602940, now seen corresponding path program 8 times [2019-12-27 20:58:56,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:56,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438300351] [2019-12-27 20:58:56,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:56,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:58:56,563 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:58:56,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= v_~b$flush_delayed~0_13 0) (= v_~__unbuffered_p1_EBX~0_14 0) (= 0 v_~a~0_8) (= v_~b$r_buff1_thd1~0_19 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t867~0.base_21| 4) |v_#length_25|) (= 0 v_~b$r_buff0_thd0~0_21) (= v_~b$r_buff1_thd2~0_18 0) (= 0 v_~b$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~y~0_7) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t867~0.base_21|) 0) (= 0 v_~b$r_buff0_thd1~0_29) (= v_~x~0_10 0) (= 0 v_~b$w_buff0~0_24) (= 0 v_~z~0_7) (= v_~b$r_buff1_thd0~0_24 0) (= 0 v_~b$r_buff0_thd3~0_76) (= v_~b$read_delayed_var~0.offset_7 0) (= 0 v_~b$r_buff0_thd2~0_21) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t867~0.base_21| 1)) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~b$mem_tmp~0_10 0) (= v_~b$r_buff1_thd3~0_49 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~b$w_buff1_used~0_68) (= 0 v_~b$w_buff1~0_23) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t867~0.base_21|) (= 0 |v_ULTIMATE.start_main_~#t867~0.offset_17|) (= v_~b~0_28 0) (= 0 v_~b$w_buff0_used~0_110) (= 0 v_~b$read_delayed_var~0.base_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t867~0.base_21|) |v_ULTIMATE.start_main_~#t867~0.offset_17| 0)) |v_#memory_int_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_76, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_19, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ULTIMATE.start_main_~#t867~0.base=|v_ULTIMATE.start_main_~#t867~0.base_21|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_110, ~a~0=v_~a~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_21, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_21, ~b$mem_tmp~0=v_~b$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~b$flush_delayed~0=v_~b$flush_delayed~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t867~0.offset=|v_ULTIMATE.start_main_~#t867~0.offset_17|, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_21|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_68, ~y~0=v_~y~0_7, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_28, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_21|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_49} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t867~0.base, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t867~0.offset, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 20:58:56,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L754: Formula: (and (= ~b$r_buff0_thd3~0_In-1022712325 ~b$r_buff1_thd3~0_Out-1022712325) (= ~b$r_buff0_thd0~0_In-1022712325 ~b$r_buff1_thd0~0_Out-1022712325) (= ~b$r_buff0_thd2~0_In-1022712325 ~b$r_buff1_thd2~0_Out-1022712325) (= ~b$r_buff1_thd1~0_Out-1022712325 ~b$r_buff0_thd1~0_In-1022712325) (= ~__unbuffered_p0_EAX~0_Out-1022712325 ~x~0_In-1022712325) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1022712325)) (= ~b$r_buff0_thd1~0_Out-1022712325 1)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1022712325, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1022712325, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1022712325, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1022712325, ~x~0=~x~0_In-1022712325, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1022712325} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1022712325, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1022712325, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1022712325, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1022712325, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1022712325, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1022712325, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1022712325, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1022712325, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1022712325, ~x~0=~x~0_In-1022712325, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1022712325} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 20:58:56,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t868~0.base_10|)) (= |v_ULTIMATE.start_main_~#t868~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10| 1) |v_#valid_27|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t868~0.base_10|) |v_ULTIMATE.start_main_~#t868~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t868~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t868~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t868~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t868~0.offset=|v_ULTIMATE.start_main_~#t868~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t868~0.base=|v_ULTIMATE.start_main_~#t868~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t868~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t868~0.base, #length] because there is no mapped edge [2019-12-27 20:58:56,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In1478420564 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1478420564 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1478420564| ~b$w_buff1~0_In1478420564)) (and (= |P1Thread1of1ForFork0_#t~ite9_Out1478420564| ~b~0_In1478420564) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1478420564, ~b~0=~b~0_In1478420564, ~b$w_buff1~0=~b$w_buff1~0_In1478420564, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1478420564} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1478420564, ~b~0=~b~0_In1478420564, ~b$w_buff1~0=~b$w_buff1~0_In1478420564, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1478420564|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1478420564} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 20:58:56,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_23 |v_P1Thread1of1ForFork0_#t~ite9_8|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_8|} OutVars{~b~0=v_~b~0_23, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_7|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_7|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 20:58:56,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In-1778190183 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-1778190183 256) 0))) (or (and (= ~b$w_buff0_used~0_In-1778190183 |P1Thread1of1ForFork0_#t~ite11_Out-1778190183|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-1778190183|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1778190183, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1778190183} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1778190183, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1778190183, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1778190183|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 20:58:56,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In85593549 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In85593549 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In85593549 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In85593549 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In85593549 |P1Thread1of1ForFork0_#t~ite12_Out85593549|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out85593549|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In85593549, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In85593549, ~b$w_buff1_used~0=~b$w_buff1_used~0_In85593549, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In85593549} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In85593549, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In85593549, ~b$w_buff1_used~0=~b$w_buff1_used~0_In85593549, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out85593549|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In85593549} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 20:58:56,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1644972173 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In1644972173 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In1644972173 |P1Thread1of1ForFork0_#t~ite13_Out1644972173|)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out1644972173| 0) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1644972173, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1644972173} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1644972173, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1644972173, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1644972173|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 20:58:56,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~b$r_buff0_thd2~0_In742246737 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In742246737 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In742246737 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In742246737 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out742246737| ~b$r_buff1_thd2~0_In742246737) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out742246737| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In742246737, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In742246737, ~b$w_buff1_used~0=~b$w_buff1_used~0_In742246737, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In742246737} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In742246737, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In742246737, ~b$w_buff1_used~0=~b$w_buff1_used~0_In742246737, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out742246737|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In742246737} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 20:58:56,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~b$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 20:58:56,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t869~0.base_13|) (= |v_ULTIMATE.start_main_~#t869~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t869~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t869~0.base_13|) |v_ULTIMATE.start_main_~#t869~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t869~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t869~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t869~0.base=|v_ULTIMATE.start_main_~#t869~0.base_13|, ULTIMATE.start_main_~#t869~0.offset=|v_ULTIMATE.start_main_~#t869~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t869~0.base, ULTIMATE.start_main_~#t869~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 20:58:56,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In617494744 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_In617494744| |P2Thread1of1ForFork1_#t~ite20_Out617494744|) (= ~b$w_buff0~0_In617494744 |P2Thread1of1ForFork1_#t~ite21_Out617494744|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite21_Out617494744| |P2Thread1of1ForFork1_#t~ite20_Out617494744|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In617494744 256)))) (or (and (= 0 (mod ~b$r_buff1_thd3~0_In617494744 256)) .cse1) (and (= (mod ~b$w_buff1_used~0_In617494744 256) 0) .cse1) (= (mod ~b$w_buff0_used~0_In617494744 256) 0))) (= ~b$w_buff0~0_In617494744 |P2Thread1of1ForFork1_#t~ite20_Out617494744|) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In617494744, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In617494744, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In617494744|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In617494744, ~b$w_buff0~0=~b$w_buff0~0_In617494744, ~weak$$choice2~0=~weak$$choice2~0_In617494744, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In617494744} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In617494744, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In617494744, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out617494744|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out617494744|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In617494744, ~b$w_buff0~0=~b$w_buff0~0_In617494744, ~weak$$choice2~0=~weak$$choice2~0_In617494744, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In617494744} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:58:56,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L810-->L810-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2127475708 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_Out2127475708| ~b$w_buff0_used~0_In2127475708) (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In2127475708 256)))) (or (and (= 0 (mod ~b$w_buff1_used~0_In2127475708 256)) .cse0) (and .cse0 (= 0 (mod ~b$r_buff1_thd3~0_In2127475708 256))) (= 0 (mod ~b$w_buff0_used~0_In2127475708 256)))) .cse1 (= |P2Thread1of1ForFork1_#t~ite26_Out2127475708| |P2Thread1of1ForFork1_#t~ite27_Out2127475708|)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out2127475708| ~b$w_buff0_used~0_In2127475708) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite26_In2127475708| |P2Thread1of1ForFork1_#t~ite26_Out2127475708|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2127475708, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2127475708, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In2127475708|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2127475708, ~weak$$choice2~0=~weak$$choice2~0_In2127475708, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2127475708} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2127475708, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out2127475708|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2127475708, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out2127475708|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2127475708, ~weak$$choice2~0=~weak$$choice2~0_In2127475708, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2127475708} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 20:58:56,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (= v_~b$r_buff0_thd3~0_49 v_~b$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_49, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:58:56,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (= v_~b~0_18 v_~b$mem_tmp~0_5) (not (= (mod v_~b$flush_delayed~0_8 256) 0))) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 20:58:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In-1050845673 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In-1050845673 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1050845673| ~b$w_buff1~0_In-1050845673) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1050845673| ~b~0_In-1050845673) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1050845673, ~b~0=~b~0_In-1050845673, ~b$w_buff1~0=~b$w_buff1~0_In-1050845673, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1050845673} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1050845673|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1050845673, ~b~0=~b~0_In-1050845673, ~b$w_buff1~0=~b$w_buff1~0_In-1050845673, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1050845673} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 20:58:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_20 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, ~b~0=v_~b~0_20, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 20:58:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In1198991538 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In1198991538 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite40_Out1198991538|) (not .cse0) (not .cse1)) (and (= ~b$w_buff0_used~0_In1198991538 |P2Thread1of1ForFork1_#t~ite40_Out1198991538|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1198991538, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1198991538} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1198991538, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1198991538, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out1198991538|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 20:58:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff1_used~0_In757461251 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In757461251 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In757461251 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In757461251 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In757461251 |P2Thread1of1ForFork1_#t~ite41_Out757461251|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out757461251|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In757461251, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In757461251, ~b$w_buff1_used~0=~b$w_buff1_used~0_In757461251, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In757461251} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In757461251, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In757461251, ~b$w_buff1_used~0=~b$w_buff1_used~0_In757461251, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out757461251|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In757461251} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 20:58:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1608605361 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1608605361 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1608605361|)) (and (= ~b$r_buff0_thd3~0_In-1608605361 |P2Thread1of1ForFork1_#t~ite42_Out-1608605361|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1608605361, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1608605361} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1608605361, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1608605361, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1608605361|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 20:58:56,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-1391104901 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1391104901 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1391104901 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-1391104901 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-1391104901| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite43_Out-1391104901| ~b$r_buff1_thd3~0_In-1391104901) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1391104901, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1391104901, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1391104901, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1391104901} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1391104901, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1391104901, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-1391104901|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1391104901, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1391104901} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 20:58:56,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~b$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_42, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 20:58:56,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd1~0_In-1730683278 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1730683278 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1730683278 |P0Thread1of1ForFork2_#t~ite5_Out-1730683278|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-1730683278|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1730683278, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1730683278} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1730683278, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1730683278, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1730683278|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 20:58:56,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd1~0_In-75305315 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-75305315 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In-75305315 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-75305315 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-75305315|)) (and (= ~b$w_buff1_used~0_In-75305315 |P0Thread1of1ForFork2_#t~ite6_Out-75305315|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-75305315, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-75305315, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-75305315, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-75305315} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-75305315, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-75305315, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-75305315, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-75305315, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-75305315|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 20:58:56,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In1013657300 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1013657300 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~b$r_buff0_thd1~0_Out1013657300)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd1~0_In1013657300 ~b$r_buff0_thd1~0_Out1013657300)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1013657300, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1013657300} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1013657300, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1013657300, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1013657300|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 20:58:56,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In1461281883 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1461281883 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In1461281883 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In1461281883 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out1461281883| 0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1461281883| ~b$r_buff1_thd1~0_In1461281883) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1461281883, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1461281883, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1461281883, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1461281883} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1461281883, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1461281883, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1461281883, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1461281883, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1461281883|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 20:58:56,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_~b$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork2_#t~ite8_8|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:58:56,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:58:56,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In557890118 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd0~0_In557890118 256)))) (or (and (or .cse0 .cse1) (= ~b~0_In557890118 |ULTIMATE.start_main_#t~ite47_Out557890118|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out557890118| ~b$w_buff1~0_In557890118) (not .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In557890118, ~b$w_buff1_used~0=~b$w_buff1_used~0_In557890118, ~b~0=~b~0_In557890118, ~b$w_buff1~0=~b$w_buff1~0_In557890118} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In557890118, ~b$w_buff1_used~0=~b$w_buff1_used~0_In557890118, ~b~0=~b~0_In557890118, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out557890118|, ~b$w_buff1~0=~b$w_buff1~0_In557890118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:58:56,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~b~0=v_~b~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:58:56,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1521467001 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1521467001 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1521467001| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1521467001| ~b$w_buff0_used~0_In-1521467001)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1521467001, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1521467001} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1521467001, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1521467001|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1521467001} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:58:56,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In-833492793 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In-833492793 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In-833492793 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-833492793 256)))) (or (and (= ~b$w_buff1_used~0_In-833492793 |ULTIMATE.start_main_#t~ite50_Out-833492793|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-833492793|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-833492793, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-833492793, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-833492793, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-833492793} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-833492793|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-833492793, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-833492793, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-833492793, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-833492793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:58:56,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In2029975328 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In2029975328 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out2029975328| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out2029975328| ~b$r_buff0_thd0~0_In2029975328)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2029975328, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2029975328} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2029975328, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2029975328|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2029975328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:58:56,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In2038188455 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In2038188455 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In2038188455 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In2038188455 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out2038188455|)) (and (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In2038188455 |ULTIMATE.start_main_#t~ite52_Out2038188455|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2038188455, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2038188455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2038188455, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2038188455} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2038188455, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2038188455|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2038188455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2038188455, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2038188455} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:58:56,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p2_EAX~0_5 1) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= v_~b$r_buff1_thd0~0_17 |v_ULTIMATE.start_main_#t~ite52_11|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:58:56,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:58:56 BasicIcfg [2019-12-27 20:58:56,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:58:56,700 INFO L168 Benchmark]: Toolchain (without parser) took 181900.69 ms. Allocated memory was 146.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,701 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:58:56,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.95 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 156.1 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.54 ms. Allocated memory is still 203.4 MB. Free memory was 156.1 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,702 INFO L168 Benchmark]: Boogie Preprocessor took 82.95 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,702 INFO L168 Benchmark]: RCFGBuilder took 947.48 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 100.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,703 INFO L168 Benchmark]: TraceAbstraction took 180045.23 ms. Allocated memory was 203.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,705 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.53 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.95 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 156.1 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.54 ms. Allocated memory is still 203.4 MB. Free memory was 156.1 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.95 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 947.48 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 100.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180045.23 ms. Allocated memory was 203.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 180 ProgramPointsBefore, 97 ProgramPointsAfterwards, 217 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7585 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86141 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t867, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t868, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t869, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.7s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 81.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10163 SDtfs, 17472 SDslu, 45830 SDs, 0 SdLazy, 37717 SolverSat, 1120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1091 GetRequests, 224 SyntacticMatches, 72 SemanticMatches, 795 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18671 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176439occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 674438 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1731 ConstructedInterpolants, 0 QuantifiedInterpolants, 446545 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...