/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:14:53,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:14:53,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:14:53,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:14:53,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:14:53,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:14:53,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:14:53,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:14:53,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:14:53,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:14:53,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:14:53,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:14:53,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:14:53,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:14:53,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:14:53,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:14:53,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:14:53,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:14:53,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:14:53,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:14:53,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:14:53,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:14:53,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:14:53,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:14:53,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:14:53,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:14:53,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:14:53,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:14:53,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:14:53,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:14:53,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:14:53,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:14:53,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:14:53,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:14:53,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:14:53,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:14:53,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:14:53,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:14:53,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:14:53,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:14:53,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:14:53,718 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-SemanticLbe-MCR.epf [2019-12-27 18:14:53,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:14:53,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:14:53,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:14:53,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:14:53,735 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:14:53,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:14:53,735 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:14:53,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:14:53,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:14:53,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:14:53,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:14:53,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:14:53,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:14:53,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:14:53,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:14:53,737 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:14:53,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:14:53,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:14:53,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:14:53,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:14:53,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:14:53,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:14:53,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:14:53,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:14:53,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:14:53,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:14:53,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:14:53,739 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:14:53,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:14:53,740 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:14:53,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:14:54,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:14:54,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:14:54,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:14:54,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:14:54,039 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:14:54,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-27 18:14:54,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc68820a6/818bc1f411104ecd9a43c680bcf186cf/FLAGb31669c34 [2019-12-27 18:14:54,628 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:14:54,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-27 18:14:54,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc68820a6/818bc1f411104ecd9a43c680bcf186cf/FLAGb31669c34 [2019-12-27 18:14:54,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc68820a6/818bc1f411104ecd9a43c680bcf186cf [2019-12-27 18:14:54,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:14:54,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:14:54,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:14:54,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:14:54,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:14:54,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:54" (1/1) ... [2019-12-27 18:14:54,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e70531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:54, skipping insertion in model container [2019-12-27 18:14:54,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:54" (1/1) ... [2019-12-27 18:14:54,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:14:55,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:14:55,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:14:55,544 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:14:55,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:14:55,719 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:14:55,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55 WrapperNode [2019-12-27 18:14:55,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:14:55,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:14:55,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:14:55,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:14:55,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:14:55,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:14:55,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:14:55,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:14:55,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (1/1) ... [2019-12-27 18:14:55,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:14:55,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:14:55,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:14:55,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:14:55,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14: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 18:14:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:14:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:14:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:14:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:14:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:14:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:14:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:14:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:14:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:14:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:14:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:14:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:14:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:14:55,887 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 18:14:56,600 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:14:56,600 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:14:56,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:56 BoogieIcfgContainer [2019-12-27 18:14:56,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:14:56,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:14:56,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:14:56,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:14:56,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:14:54" (1/3) ... [2019-12-27 18:14:56,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151b5d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:56, skipping insertion in model container [2019-12-27 18:14:56,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:55" (2/3) ... [2019-12-27 18:14:56,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151b5d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:56, skipping insertion in model container [2019-12-27 18:14:56,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:56" (3/3) ... [2019-12-27 18:14:56,612 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2019-12-27 18:14:56,623 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:14:56,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:14:56,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:14:56,635 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:14:56,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,722 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,744 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,745 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,749 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:56,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:14:56,788 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:14:56,788 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:14:56,788 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:14:56,788 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:14:56,788 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:14:56,788 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:14:56,789 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:14:56,789 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:14:56,806 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:14:56,808 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:14:56,913 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:14:56,913 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:14:56,933 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:14:56,958 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:14:57,036 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:14:57,037 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:14:57,044 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:14:57,063 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:14:57,065 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:15:02,347 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 18:15:02,770 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:15:02,908 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:15:03,025 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-27 18:15:03,025 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:15:03,029 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:15:15,729 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:15:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:15:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:15:15,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:15,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:15:15,739 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-27 18:15:15,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:15,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33700717] [2019-12-27 18:15:15,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:15,995 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 18:15:15,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33700717] [2019-12-27 18:15:15,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:15,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:15:15,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183295732] [2019-12-27 18:15:15,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:16,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:16,015 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:15:16,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:16,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:16,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:15:16,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:15:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:15:16,033 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:15:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:19,393 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:15:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:15:19,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:15:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:19,969 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:15:19,969 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:15:19,972 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 18:15:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:15:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:15:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:15:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:15:27,164 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:15:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:27,165 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:15:27,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:15:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:15:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:15:27,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:27,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:27,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-27 18:15:27,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:27,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384510084] [2019-12-27 18:15:27,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:27,269 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 18:15:27,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384510084] [2019-12-27 18:15:27,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:27,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:15:27,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583948835] [2019-12-27 18:15:27,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:27,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:27,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:15:27,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:27,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:27,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:15:27,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:15:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:15:27,279 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:15:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:30,891 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:15:30,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:15:30,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:15:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:31,314 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:15:31,314 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:15:31,315 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 18:15:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:15:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:15:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:15:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:15:43,433 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:15:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:43,434 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:15:43,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:15:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:15:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:15:43,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:43,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:43,439 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-27 18:15:43,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:43,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438905121] [2019-12-27 18:15:43,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:43,536 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 18:15:43,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438905121] [2019-12-27 18:15:43,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:43,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:15:43,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [275620312] [2019-12-27 18:15:43,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:43,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:43,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:15:43,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:43,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:43,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:15:43,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:43,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:15:43,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:15:43,541 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:15:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:49,101 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 18:15:49,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:15:49,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:15:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:49,893 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 18:15:49,893 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 18:15:49,894 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 18:15:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 18:15:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 18:15:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 18:15:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 18:15:58,047 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 18:15:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:58,047 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 18:15:58,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:15:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 18:15:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:15:58,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:58,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:58,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-27 18:15:58,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:58,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132348892] [2019-12-27 18:15:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:58,129 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 18:15:58,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132348892] [2019-12-27 18:15:58,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:58,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:15:58,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2093704818] [2019-12-27 18:15:58,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:58,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:58,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:15:58,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:58,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:15:58,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:15:58,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:58,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:15:58,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:15:58,196 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 5 states. [2019-12-27 18:16:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:05,339 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 18:16:05,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:16:05,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:16:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:05,938 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 18:16:05,939 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 18:16:05,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 18:16:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 18:16:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 18:16:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 18:16:14,461 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 18:16:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:14,461 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 18:16:14,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:16:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 18:16:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:16:14,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:14,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:14,465 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-27 18:16:14,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:14,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282164669] [2019-12-27 18:16:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:14,540 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 18:16:14,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282164669] [2019-12-27 18:16:14,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:14,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:14,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532197279] [2019-12-27 18:16:14,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:14,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:14,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:16:14,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:14,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:16:14,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:16:14,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:16:14,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:14,567 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 5 states. [2019-12-27 18:16:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:15,716 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 18:16:15,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:16:15,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:16:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:17,759 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 18:16:17,760 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 18:16:17,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:16:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 18:16:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 18:16:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 18:16:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 18:16:31,819 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 18:16:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:31,819 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 18:16:31,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:16:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 18:16:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:16:31,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:31,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:31,824 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:31,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-27 18:16:31,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:31,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310168605] [2019-12-27 18:16:31,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:31,876 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 18:16:31,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310168605] [2019-12-27 18:16:31,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:31,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:31,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677094317] [2019-12-27 18:16:31,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:31,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:31,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:16:31,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:31,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:16:31,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:16:31,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:16:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:31,901 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 5 states. [2019-12-27 18:16:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:37,926 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 18:16:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:16:37,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:16:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:38,530 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 18:16:38,530 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 18:16:38,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:16:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 18:16:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 18:16:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 18:16:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 18:16:50,271 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 18:16:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:50,271 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 18:16:50,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:16:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 18:16:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:16:50,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:50,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:50,291 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:50,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-27 18:16:50,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:50,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680434170] [2019-12-27 18:16:50,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:50,341 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 18:16:50,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680434170] [2019-12-27 18:16:50,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:50,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:16:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1776793387] [2019-12-27 18:16:50,342 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:50,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:50,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:16:50,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:50,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:16:50,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:16:50,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:50,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:16:50,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:16:50,347 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 18:16:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:56,879 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 18:16:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:16:56,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:16:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:57,452 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 18:16:57,452 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 18:16:57,453 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 18:17:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 18:17:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 18:17:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 18:17:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 18:17:04,840 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 18:17:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:04,840 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 18:17:04,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:17:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 18:17:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:17:04,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:04,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:04,858 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-27 18:17:04,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:04,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364280220] [2019-12-27 18:17:04,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:04,906 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 18:17:04,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364280220] [2019-12-27 18:17:04,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:04,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:04,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16422809] [2019-12-27 18:17:04,907 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:04,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:04,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 18:17:04,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:04,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:17:04,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:04,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:04,928 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 5 states. [2019-12-27 18:17:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:15,005 INFO L93 Difference]: Finished difference Result 320677 states and 1339367 transitions. [2019-12-27 18:17:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:15,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:17:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:15,632 INFO L225 Difference]: With dead ends: 320677 [2019-12-27 18:17:15,633 INFO L226 Difference]: Without dead ends: 193709 [2019-12-27 18:17:15,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193709 states. [2019-12-27 18:17:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193709 to 128270. [2019-12-27 18:17:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-27 18:17:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-27 18:17:23,159 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-27 18:17:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:23,160 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-27 18:17:23,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-27 18:17:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:17:23,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:23,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:23,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-27 18:17:23,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:23,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987640938] [2019-12-27 18:17:23,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:23,266 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 18:17:23,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987640938] [2019-12-27 18:17:23,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:23,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:23,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424128938] [2019-12-27 18:17:23,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:23,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:23,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:17:23,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:23,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:23,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:23,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:23,276 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 5 states. [2019-12-27 18:17:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:25,337 INFO L93 Difference]: Finished difference Result 169569 states and 676181 transitions. [2019-12-27 18:17:25,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:17:25,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:17:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:25,815 INFO L225 Difference]: With dead ends: 169569 [2019-12-27 18:17:25,815 INFO L226 Difference]: Without dead ends: 167273 [2019-12-27 18:17:25,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:17:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167273 states. [2019-12-27 18:17:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167273 to 132643. [2019-12-27 18:17:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132643 states. [2019-12-27 18:17:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132643 states to 132643 states and 541600 transitions. [2019-12-27 18:17:38,949 INFO L78 Accepts]: Start accepts. Automaton has 132643 states and 541600 transitions. Word has length 19 [2019-12-27 18:17:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:38,950 INFO L462 AbstractCegarLoop]: Abstraction has 132643 states and 541600 transitions. [2019-12-27 18:17:38,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 132643 states and 541600 transitions. [2019-12-27 18:17:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 18:17:38,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:38,971 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] [2019-12-27 18:17:38,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1494619507, now seen corresponding path program 1 times [2019-12-27 18:17:38,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:38,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671873834] [2019-12-27 18:17:38,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:39,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671873834] [2019-12-27 18:17:39,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:39,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:39,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199103665] [2019-12-27 18:17:39,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:39,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:39,027 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 60 transitions. [2019-12-27 18:17:39,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:39,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:39,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:17:39,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:39,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:17:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:17:39,029 INFO L87 Difference]: Start difference. First operand 132643 states and 541600 transitions. Second operand 3 states. [2019-12-27 18:17:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:41,697 INFO L93 Difference]: Finished difference Result 225373 states and 923689 transitions. [2019-12-27 18:17:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:41,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 18:17:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:42,038 INFO L225 Difference]: With dead ends: 225373 [2019-12-27 18:17:42,039 INFO L226 Difference]: Without dead ends: 114993 [2019-12-27 18:17:42,039 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 18:17:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114993 states. [2019-12-27 18:17:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114993 to 105754. [2019-12-27 18:17:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105754 states. [2019-12-27 18:17:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105754 states to 105754 states and 434218 transitions. [2019-12-27 18:17:53,673 INFO L78 Accepts]: Start accepts. Automaton has 105754 states and 434218 transitions. Word has length 20 [2019-12-27 18:17:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:53,673 INFO L462 AbstractCegarLoop]: Abstraction has 105754 states and 434218 transitions. [2019-12-27 18:17:53,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:17:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 105754 states and 434218 transitions. [2019-12-27 18:17:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:17:53,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:53,690 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] [2019-12-27 18:17:53,690 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1548802701, now seen corresponding path program 1 times [2019-12-27 18:17:53,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:53,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643954653] [2019-12-27 18:17:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:53,758 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 18:17:53,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643954653] [2019-12-27 18:17:53,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:53,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:53,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356001803] [2019-12-27 18:17:53,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:53,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:53,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 95 transitions. [2019-12-27 18:17:53,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:53,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:17:53,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:53,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:53,795 INFO L87 Difference]: Start difference. First operand 105754 states and 434218 transitions. Second operand 5 states. [2019-12-27 18:17:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:54,097 INFO L93 Difference]: Finished difference Result 36945 states and 127020 transitions. [2019-12-27 18:17:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:54,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 18:17:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:54,154 INFO L225 Difference]: With dead ends: 36945 [2019-12-27 18:17:54,154 INFO L226 Difference]: Without dead ends: 31943 [2019-12-27 18:17:54,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31943 states. [2019-12-27 18:17:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31943 to 20803. [2019-12-27 18:17:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20803 states. [2019-12-27 18:17:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20803 states to 20803 states and 69516 transitions. [2019-12-27 18:17:55,417 INFO L78 Accepts]: Start accepts. Automaton has 20803 states and 69516 transitions. Word has length 21 [2019-12-27 18:17:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:55,418 INFO L462 AbstractCegarLoop]: Abstraction has 20803 states and 69516 transitions. [2019-12-27 18:17:55,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20803 states and 69516 transitions. [2019-12-27 18:17:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:55,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:55,421 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 18:17:55,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-27 18:17:55,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:55,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343804637] [2019-12-27 18:17:55,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:55,477 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 18:17:55,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343804637] [2019-12-27 18:17:55,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:55,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:55,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79109491] [2019-12-27 18:17:55,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:55,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:55,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:17:55,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:55,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:55,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:55,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:55,516 INFO L87 Difference]: Start difference. First operand 20803 states and 69516 transitions. Second operand 6 states. [2019-12-27 18:17:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:55,909 INFO L93 Difference]: Finished difference Result 21504 states and 71054 transitions. [2019-12-27 18:17:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:17:55,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:17:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:55,968 INFO L225 Difference]: With dead ends: 21504 [2019-12-27 18:17:55,968 INFO L226 Difference]: Without dead ends: 21185 [2019-12-27 18:17:55,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:17:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21185 states. [2019-12-27 18:17:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21185 to 20730. [2019-12-27 18:17:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20730 states. [2019-12-27 18:17:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20730 states to 20730 states and 69240 transitions. [2019-12-27 18:17:56,436 INFO L78 Accepts]: Start accepts. Automaton has 20730 states and 69240 transitions. Word has length 22 [2019-12-27 18:17:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:56,436 INFO L462 AbstractCegarLoop]: Abstraction has 20730 states and 69240 transitions. [2019-12-27 18:17:56,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20730 states and 69240 transitions. [2019-12-27 18:17:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:56,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17: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] [2019-12-27 18:17:56,441 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-27 18:17:56,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:56,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688897880] [2019-12-27 18:17:56,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:56,495 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 18:17:56,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688897880] [2019-12-27 18:17:56,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:56,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:56,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1235132584] [2019-12-27 18:17:56,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:56,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:56,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:17:56,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:56,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:56,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:56,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:56,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:56,535 INFO L87 Difference]: Start difference. First operand 20730 states and 69240 transitions. Second operand 6 states. [2019-12-27 18:17:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:56,911 INFO L93 Difference]: Finished difference Result 20652 states and 68473 transitions. [2019-12-27 18:17:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:17:56,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:17:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:56,963 INFO L225 Difference]: With dead ends: 20652 [2019-12-27 18:17:56,963 INFO L226 Difference]: Without dead ends: 20213 [2019-12-27 18:17:56,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:17:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20213 states. [2019-12-27 18:17:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20213 to 19600. [2019-12-27 18:17:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19600 states. [2019-12-27 18:17:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19600 states to 19600 states and 65965 transitions. [2019-12-27 18:17:58,173 INFO L78 Accepts]: Start accepts. Automaton has 19600 states and 65965 transitions. Word has length 22 [2019-12-27 18:17:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:58,173 INFO L462 AbstractCegarLoop]: Abstraction has 19600 states and 65965 transitions. [2019-12-27 18:17:58,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 19600 states and 65965 transitions. [2019-12-27 18:17:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:17:58,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:58,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:58,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-27 18:17:58,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:58,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442845173] [2019-12-27 18:17:58,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:58,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442845173] [2019-12-27 18:17:58,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:58,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:58,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [345381330] [2019-12-27 18:17:58,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:58,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:58,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:17:58,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:58,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:58,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:58,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:58,288 INFO L87 Difference]: Start difference. First operand 19600 states and 65965 transitions. Second operand 6 states. [2019-12-27 18:17:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:58,567 INFO L93 Difference]: Finished difference Result 20172 states and 67231 transitions. [2019-12-27 18:17:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:17:58,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 18:17:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:58,599 INFO L225 Difference]: With dead ends: 20172 [2019-12-27 18:17:58,599 INFO L226 Difference]: Without dead ends: 19798 [2019-12-27 18:17:58,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:17:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19798 states. [2019-12-27 18:17:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19798 to 19798. [2019-12-27 18:17:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19798 states. [2019-12-27 18:17:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19798 states to 19798 states and 66428 transitions. [2019-12-27 18:17:58,973 INFO L78 Accepts]: Start accepts. Automaton has 19798 states and 66428 transitions. Word has length 28 [2019-12-27 18:17:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:58,973 INFO L462 AbstractCegarLoop]: Abstraction has 19798 states and 66428 transitions. [2019-12-27 18:17:58,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19798 states and 66428 transitions. [2019-12-27 18:17:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:17:58,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:58,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:58,981 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-27 18:17:58,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:58,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208632831] [2019-12-27 18:17:58,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:59,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208632831] [2019-12-27 18:17:59,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:59,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:59,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790222528] [2019-12-27 18:17:59,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:59,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:59,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:17:59,059 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:59,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:17:59,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:59,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:59,085 INFO L87 Difference]: Start difference. First operand 19798 states and 66428 transitions. Second operand 5 states. [2019-12-27 18:17:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:59,285 INFO L93 Difference]: Finished difference Result 26360 states and 88095 transitions. [2019-12-27 18:17:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:59,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 18:17:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:59,349 INFO L225 Difference]: With dead ends: 26360 [2019-12-27 18:17:59,350 INFO L226 Difference]: Without dead ends: 26360 [2019-12-27 18:17:59,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26360 states. [2019-12-27 18:17:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26360 to 20672. [2019-12-27 18:17:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20672 states. [2019-12-27 18:17:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20672 states to 20672 states and 68626 transitions. [2019-12-27 18:17:59,980 INFO L78 Accepts]: Start accepts. Automaton has 20672 states and 68626 transitions. Word has length 28 [2019-12-27 18:17:59,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:59,980 INFO L462 AbstractCegarLoop]: Abstraction has 20672 states and 68626 transitions. [2019-12-27 18:17:59,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20672 states and 68626 transitions. [2019-12-27 18:17:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:17:59,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:59,989 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] [2019-12-27 18:17:59,989 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-27 18:17:59,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:59,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960521589] [2019-12-27 18:17:59,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:00,042 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 18:18:00,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960521589] [2019-12-27 18:18:00,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:00,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:18:00,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773360919] [2019-12-27 18:18:00,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:00,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:00,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 18:18:00,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:00,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:00,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:18:00,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:18:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:18:00,094 INFO L87 Difference]: Start difference. First operand 20672 states and 68626 transitions. Second operand 6 states. [2019-12-27 18:18:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:00,351 INFO L93 Difference]: Finished difference Result 20919 states and 69006 transitions. [2019-12-27 18:18:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:18:00,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 18:18:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:00,384 INFO L225 Difference]: With dead ends: 20919 [2019-12-27 18:18:00,384 INFO L226 Difference]: Without dead ends: 20525 [2019-12-27 18:18:00,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:18:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20525 states. [2019-12-27 18:18:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20525 to 20333. [2019-12-27 18:18:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-27 18:18:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-27 18:18:00,763 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-27 18:18:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:00,763 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-27 18:18:00,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:18:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-27 18:18:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:18:00,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:00,775 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] [2019-12-27 18:18:00,775 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-27 18:18:00,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:00,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337140799] [2019-12-27 18:18:00,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:00,855 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 18:18:00,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337140799] [2019-12-27 18:18:00,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:00,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:18:00,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1092861198] [2019-12-27 18:18:00,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:00,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:00,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 187 transitions. [2019-12-27 18:18:00,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:00,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:00,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:00,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:00,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:00,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:00,890 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-27 18:18:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:01,469 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-27 18:18:01,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:18:01,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 18:18:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:01,524 INFO L225 Difference]: With dead ends: 34767 [2019-12-27 18:18:01,525 INFO L226 Difference]: Without dead ends: 34767 [2019-12-27 18:18:01,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:18:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-27 18:18:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-27 18:18:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-27 18:18:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-27 18:18:02,260 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-27 18:18:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:02,261 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-27 18:18:02,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-27 18:18:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:18:02,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:02,284 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] [2019-12-27 18:18:02,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-27 18:18:02,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:02,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866288320] [2019-12-27 18:18:02,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:02,350 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 18:18:02,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866288320] [2019-12-27 18:18:02,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:02,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:18:02,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [903878735] [2019-12-27 18:18:02,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:02,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:02,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 194 transitions. [2019-12-27 18:18:02,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:02,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:18:02,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:02,398 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-27 18:18:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:02,512 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-27 18:18:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:02,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 18:18:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:02,533 INFO L225 Difference]: With dead ends: 13178 [2019-12-27 18:18:02,533 INFO L226 Difference]: Without dead ends: 11110 [2019-12-27 18:18:02,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 18:18:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-27 18:18:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-27 18:18:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-27 18:18:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-27 18:18:02,700 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-27 18:18:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:02,701 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-27 18:18:02,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-27 18:18:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:18:02,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:02,712 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 18:18:02,712 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:02,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-27 18:18:02,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:02,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636649238] [2019-12-27 18:18:02,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:02,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 18:18:02,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636649238] [2019-12-27 18:18:02,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:02,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:18:02,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066652245] [2019-12-27 18:18:02,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:02,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:02,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 18:18:02,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:02,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:02,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:18:02,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:18:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:18:02,897 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 7 states. [2019-12-27 18:18:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:03,147 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-27 18:18:03,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:18:03,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 18:18:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:03,166 INFO L225 Difference]: With dead ends: 11069 [2019-12-27 18:18:03,166 INFO L226 Difference]: Without dead ends: 10842 [2019-12-27 18:18:03,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:18:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-27 18:18:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-27 18:18:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-27 18:18:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-27 18:18:03,320 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-27 18:18:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:03,320 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-27 18:18:03,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:18:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-27 18:18:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:18:03,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:03,331 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 18:18:03,331 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-27 18:18:03,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:03,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237153949] [2019-12-27 18:18:03,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:03,415 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 18:18:03,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237153949] [2019-12-27 18:18:03,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:03,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:18:03,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394550302] [2019-12-27 18:18:03,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:03,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:03,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 18:18:03,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:03,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:18:03,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:18:03,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:18:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:18:03,514 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 8 states. [2019-12-27 18:18:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:05,364 INFO L93 Difference]: Finished difference Result 36245 states and 107113 transitions. [2019-12-27 18:18:05,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:18:05,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 18:18:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:05,413 INFO L225 Difference]: With dead ends: 36245 [2019-12-27 18:18:05,414 INFO L226 Difference]: Without dead ends: 36245 [2019-12-27 18:18:05,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:18:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36245 states. [2019-12-27 18:18:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36245 to 13761. [2019-12-27 18:18:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-27 18:18:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41509 transitions. [2019-12-27 18:18:05,756 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41509 transitions. Word has length 40 [2019-12-27 18:18:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:05,756 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41509 transitions. [2019-12-27 18:18:05,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:18:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41509 transitions. [2019-12-27 18:18:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:18:05,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:05,776 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 18:18:05,776 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:05,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:05,777 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-27 18:18:05,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:05,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463488531] [2019-12-27 18:18:05,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:05,827 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 18:18:05,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463488531] [2019-12-27 18:18:05,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:05,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:18:05,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1591866301] [2019-12-27 18:18:05,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:05,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:05,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 182 transitions. [2019-12-27 18:18:05,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:05,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:18:05,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:18:05,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:18:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:18:05,887 INFO L87 Difference]: Start difference. First operand 13761 states and 41509 transitions. Second operand 4 states. [2019-12-27 18:18:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:06,157 INFO L93 Difference]: Finished difference Result 13036 states and 38278 transitions. [2019-12-27 18:18:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:06,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 18:18:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:06,176 INFO L225 Difference]: With dead ends: 13036 [2019-12-27 18:18:06,177 INFO L226 Difference]: Without dead ends: 13036 [2019-12-27 18:18:06,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 18:18:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13036 states. [2019-12-27 18:18:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13036 to 10086. [2019-12-27 18:18:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10086 states. [2019-12-27 18:18:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 29686 transitions. [2019-12-27 18:18:06,328 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 29686 transitions. Word has length 40 [2019-12-27 18:18:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:06,329 INFO L462 AbstractCegarLoop]: Abstraction has 10086 states and 29686 transitions. [2019-12-27 18:18:06,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:18:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 29686 transitions. [2019-12-27 18:18:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:18:06,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:06,341 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] [2019-12-27 18:18:06,341 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-27 18:18:06,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:06,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734290745] [2019-12-27 18:18:06,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:06,399 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 18:18:06,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734290745] [2019-12-27 18:18:06,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:06,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:18:06,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216093513] [2019-12-27 18:18:06,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:06,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:06,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 215 transitions. [2019-12-27 18:18:06,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:06,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:18:06,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:18:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:18:06,497 INFO L87 Difference]: Start difference. First operand 10086 states and 29686 transitions. Second operand 7 states. Received shutdown request... [2019-12-27 18:18:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:06,603 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:18:06,608 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:18:06,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:06 BasicIcfg [2019-12-27 18:18:06,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:18:06,610 INFO L168 Benchmark]: Toolchain (without parser) took 191662.16 ms. Allocated memory was 136.3 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 99.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 18:18:06,610 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:18:06,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.03 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 154.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:06,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 200.3 MB. Free memory was 154.2 MB in the beginning and 151.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:06,612 INFO L168 Benchmark]: Boogie Preprocessor took 38.96 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.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 18:18:06,613 INFO L168 Benchmark]: RCFGBuilder took 773.93 ms. Allocated memory is still 200.3 MB. Free memory was 149.1 MB in the beginning and 101.8 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:06,613 INFO L168 Benchmark]: TraceAbstraction took 190005.27 ms. Allocated memory was 200.3 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 101.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 18:18:06,616 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.42 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.03 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 154.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 200.3 MB. Free memory was 154.2 MB in the beginning and 151.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.96 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.93 ms. Allocated memory is still 200.3 MB. Free memory was 149.1 MB in the beginning and 101.8 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190005.27 ms. Allocated memory was 200.3 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 101.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (10086states) and FLOYD_HOARE automaton (currently 5 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (136 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (10086states) and FLOYD_HOARE automaton (currently 5 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (136 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 189.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 60.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2939 SDtfs, 3567 SDslu, 5673 SDs, 0 SdLazy, 3868 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 107.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 269695 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 38033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown