/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:54:38,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:54:38,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:54:38,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:54:38,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:54:38,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:54:38,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:54:38,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:54:38,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:54:38,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:54:38,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:54:38,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:54:38,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:54:38,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:54:38,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:54:38,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:54:38,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:54:38,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:54:38,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:54:38,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:54:38,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:54:38,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:54:38,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:54:38,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:54:38,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:54:38,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:54:38,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:54:38,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:54:38,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:54:38,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:54:38,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:54:38,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:54:38,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:54:38,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:54:38,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:54:38,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:54:38,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:54:38,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:54:38,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:54:38,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:54:38,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:54:38,772 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-NoLbe-MCR.epf [2019-12-28 03:54:38,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:54:38,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:54:38,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:54:38,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:54:38,788 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:54:38,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:54:38,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:54:38,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:54:38,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:54:38,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:54:38,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:54:38,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:54:38,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:54:38,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:54:38,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:54:38,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:54:38,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:54:38,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:54:38,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:54:38,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:54:38,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:54:38,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:54:38,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:54:38,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:54:38,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:54:38,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:54:38,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:54:38,793 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:54:38,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:54:38,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:54:38,794 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:54:38,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:54:39,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:54:39,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:54:39,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:54:39,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:54:39,089 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:54:39,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-28 03:54:39,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1d56439/077ea8c87a544d9ab2b175d6d4ce76cb/FLAG902330388 [2019-12-28 03:54:39,735 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:54:39,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-28 03:54:39,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1d56439/077ea8c87a544d9ab2b175d6d4ce76cb/FLAG902330388 [2019-12-28 03:54:39,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1d56439/077ea8c87a544d9ab2b175d6d4ce76cb [2019-12-28 03:54:40,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:54:40,010 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:54:40,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:54:40,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:54:40,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:54:40,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b151aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40, skipping insertion in model container [2019-12-28 03:54:40,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:54:40,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:54:40,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:54:40,579 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:54:40,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:54:40,766 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:54:40,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40 WrapperNode [2019-12-28 03:54:40,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:54:40,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:54:40,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:54:40,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:54:40,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:54:40,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:54:40,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:54:40,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:54:40,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (1/1) ... [2019-12-28 03:54:40,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:54:40,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:54:40,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:54:40,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:54:40,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (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-28 03:54:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:54:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:54:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:54:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:54:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:54:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:54:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:54:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:54:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:54:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:54:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:54:40,968 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:54:41,773 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:54:41,773 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:54:41,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:54:41 BoogieIcfgContainer [2019-12-28 03:54:41,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:54:41,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:54:41,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:54:41,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:54:41,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:54:40" (1/3) ... [2019-12-28 03:54:41,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de905fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:54:41, skipping insertion in model container [2019-12-28 03:54:41,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:54:40" (2/3) ... [2019-12-28 03:54:41,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de905fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:54:41, skipping insertion in model container [2019-12-28 03:54:41,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:54:41" (3/3) ... [2019-12-28 03:54:41,800 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc.i [2019-12-28 03:54:41,811 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:54:41,812 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:54:41,830 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:54:41,831 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:54:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,922 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,922 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:54:41,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:54:41,999 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:54:41,999 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:54:41,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:54:41,999 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:54:41,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:54:42,000 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:54:42,000 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:54:42,000 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:54:42,015 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191 places, 246 transitions [2019-12-28 03:54:55,064 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100969 states. [2019-12-28 03:54:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states. [2019-12-28 03:54:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-28 03:54:55,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:55,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:55,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1761614935, now seen corresponding path program 1 times [2019-12-28 03:54:55,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:55,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159406631] [2019-12-28 03:54:55,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:55,431 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-28 03:54:55,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159406631] [2019-12-28 03:54:55,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:55,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:54:55,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009923888] [2019-12-28 03:54:55,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:55,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:55,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-28 03:54:55,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:55,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:55,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:54:55,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:55,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:54:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:54:55,490 INFO L87 Difference]: Start difference. First operand 100969 states. Second operand 4 states. [2019-12-28 03:54:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:57,091 INFO L93 Difference]: Finished difference Result 101969 states and 411474 transitions. [2019-12-28 03:54:57,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:54:57,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-28 03:54:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:57,604 INFO L225 Difference]: With dead ends: 101969 [2019-12-28 03:54:57,604 INFO L226 Difference]: Without dead ends: 74593 [2019-12-28 03:54:57,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:55:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74593 states. [2019-12-28 03:55:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74593 to 74593. [2019-12-28 03:55:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-12-28 03:55:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 304546 transitions. [2019-12-28 03:55:04,303 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 304546 transitions. Word has length 36 [2019-12-28 03:55:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:04,303 INFO L462 AbstractCegarLoop]: Abstraction has 74593 states and 304546 transitions. [2019-12-28 03:55:04,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:55:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 304546 transitions. [2019-12-28 03:55:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:55:04,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:04,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:55:04,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash -776334369, now seen corresponding path program 1 times [2019-12-28 03:55:04,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:04,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881639702] [2019-12-28 03:55:04,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:04,459 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-28 03:55:04,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881639702] [2019-12-28 03:55:04,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:04,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:55:04,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339072375] [2019-12-28 03:55:04,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:04,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:04,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:55:04,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:04,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:55:04,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:55:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:55:04,472 INFO L87 Difference]: Start difference. First operand 74593 states and 304546 transitions. Second operand 5 states. [2019-12-28 03:55:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:08,787 INFO L93 Difference]: Finished difference Result 121639 states and 464551 transitions. [2019-12-28 03:55:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:55:08,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 03:55:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:09,402 INFO L225 Difference]: With dead ends: 121639 [2019-12-28 03:55:09,402 INFO L226 Difference]: Without dead ends: 121103 [2019-12-28 03:55:09,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:55:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121103 states. [2019-12-28 03:55:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121103 to 119213. [2019-12-28 03:55:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119213 states. [2019-12-28 03:55:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119213 states to 119213 states and 456891 transitions. [2019-12-28 03:55:18,698 INFO L78 Accepts]: Start accepts. Automaton has 119213 states and 456891 transitions. Word has length 48 [2019-12-28 03:55:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:18,700 INFO L462 AbstractCegarLoop]: Abstraction has 119213 states and 456891 transitions. [2019-12-28 03:55:18,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:55:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 119213 states and 456891 transitions. [2019-12-28 03:55:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:55:18,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:18,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:55:18,706 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1542620855, now seen corresponding path program 1 times [2019-12-28 03:55:18,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:18,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545886888] [2019-12-28 03:55:18,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:18,803 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-28 03:55:18,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545886888] [2019-12-28 03:55:18,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:18,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:55:18,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117655964] [2019-12-28 03:55:18,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:18,810 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:18,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 03:55:18,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:18,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:18,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:55:18,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:55:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:55:18,818 INFO L87 Difference]: Start difference. First operand 119213 states and 456891 transitions. Second operand 5 states. [2019-12-28 03:55:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:20,974 INFO L93 Difference]: Finished difference Result 149065 states and 560747 transitions. [2019-12-28 03:55:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:55:20,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 03:55:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:21,390 INFO L225 Difference]: With dead ends: 149065 [2019-12-28 03:55:21,390 INFO L226 Difference]: Without dead ends: 148561 [2019-12-28 03:55:21,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:55:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148561 states. [2019-12-28 03:55:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148561 to 131878. [2019-12-28 03:55:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131878 states. [2019-12-28 03:55:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131878 states to 131878 states and 501408 transitions. [2019-12-28 03:55:30,414 INFO L78 Accepts]: Start accepts. Automaton has 131878 states and 501408 transitions. Word has length 49 [2019-12-28 03:55:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:30,415 INFO L462 AbstractCegarLoop]: Abstraction has 131878 states and 501408 transitions. [2019-12-28 03:55:30,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:55:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 131878 states and 501408 transitions. [2019-12-28 03:55:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 03:55:30,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:30,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:55:30,427 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:30,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1726220477, now seen corresponding path program 1 times [2019-12-28 03:55:30,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:30,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614304848] [2019-12-28 03:55:30,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:30,482 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-28 03:55:30,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614304848] [2019-12-28 03:55:30,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:30,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:55:30,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198596858] [2019-12-28 03:55:30,484 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:30,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:30,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-28 03:55:30,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:30,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:55:30,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:55:30,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:55:30,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:55:30,498 INFO L87 Difference]: Start difference. First operand 131878 states and 501408 transitions. Second operand 3 states. [2019-12-28 03:55:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:32,287 INFO L93 Difference]: Finished difference Result 226103 states and 838073 transitions. [2019-12-28 03:55:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:55:32,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 03:55:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:38,718 INFO L225 Difference]: With dead ends: 226103 [2019-12-28 03:55:38,718 INFO L226 Difference]: Without dead ends: 226103 [2019-12-28 03:55:38,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:55:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226103 states. [2019-12-28 03:55:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226103 to 201720. [2019-12-28 03:55:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201720 states. [2019-12-28 03:55:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201720 states to 201720 states and 750697 transitions. [2019-12-28 03:55:45,396 INFO L78 Accepts]: Start accepts. Automaton has 201720 states and 750697 transitions. Word has length 51 [2019-12-28 03:55:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:55:45,396 INFO L462 AbstractCegarLoop]: Abstraction has 201720 states and 750697 transitions. [2019-12-28 03:55:45,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:55:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 201720 states and 750697 transitions. [2019-12-28 03:55:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:55:45,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:55:45,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:55:45,422 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:55:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:55:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2125163740, now seen corresponding path program 1 times [2019-12-28 03:55:45,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:55:45,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154838695] [2019-12-28 03:55:45,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:55:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:55:45,571 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-28 03:55:45,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154838695] [2019-12-28 03:55:45,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:55:45,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:55:45,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403714415] [2019-12-28 03:55:45,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:55:45,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:55:45,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 03:55:45,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:55:45,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:55:45,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:55:45,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:55:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:55:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:55:45,674 INFO L87 Difference]: Start difference. First operand 201720 states and 750697 transitions. Second operand 7 states. [2019-12-28 03:55:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:55:54,136 INFO L93 Difference]: Finished difference Result 257719 states and 956292 transitions. [2019-12-28 03:55:54,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:55:54,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 03:55:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:55:55,079 INFO L225 Difference]: With dead ends: 257719 [2019-12-28 03:55:55,080 INFO L226 Difference]: Without dead ends: 257719 [2019-12-28 03:55:55,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:55:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257719 states. [2019-12-28 03:56:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257719 to 241036. [2019-12-28 03:56:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241036 states. [2019-12-28 03:56:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241036 states to 241036 states and 894179 transitions. [2019-12-28 03:56:04,124 INFO L78 Accepts]: Start accepts. Automaton has 241036 states and 894179 transitions. Word has length 55 [2019-12-28 03:56:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:04,125 INFO L462 AbstractCegarLoop]: Abstraction has 241036 states and 894179 transitions. [2019-12-28 03:56:04,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:56:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 241036 states and 894179 transitions. [2019-12-28 03:56:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:56:04,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:04,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:04,185 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 372852197, now seen corresponding path program 1 times [2019-12-28 03:56:04,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:04,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843250872] [2019-12-28 03:56:04,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:04,353 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-28 03:56:04,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843250872] [2019-12-28 03:56:04,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:04,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:56:04,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536118251] [2019-12-28 03:56:04,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:04,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:04,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 03:56:04,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:04,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:56:04,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:56:04,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:56:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:56:04,393 INFO L87 Difference]: Start difference. First operand 241036 states and 894179 transitions. Second operand 8 states. [2019-12-28 03:56:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:08,768 INFO L93 Difference]: Finished difference Result 334522 states and 1202846 transitions. [2019-12-28 03:56:08,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:56:08,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 03:56:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:18,325 INFO L225 Difference]: With dead ends: 334522 [2019-12-28 03:56:18,325 INFO L226 Difference]: Without dead ends: 334522 [2019-12-28 03:56:18,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:56:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334522 states. [2019-12-28 03:56:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334522 to 278543. [2019-12-28 03:56:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278543 states. [2019-12-28 03:56:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278543 states to 278543 states and 1017057 transitions. [2019-12-28 03:56:36,541 INFO L78 Accepts]: Start accepts. Automaton has 278543 states and 1017057 transitions. Word has length 55 [2019-12-28 03:56:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:36,541 INFO L462 AbstractCegarLoop]: Abstraction has 278543 states and 1017057 transitions. [2019-12-28 03:56:36,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:56:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 278543 states and 1017057 transitions. [2019-12-28 03:56:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:56:36,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:36,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:36,565 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1260355878, now seen corresponding path program 1 times [2019-12-28 03:56:36,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:36,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032874558] [2019-12-28 03:56:36,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:36,661 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-28 03:56:36,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032874558] [2019-12-28 03:56:36,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:36,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:56:36,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [587079867] [2019-12-28 03:56:36,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:36,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:36,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 03:56:36,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:36,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:56:36,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:56:36,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:36,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:56:36,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:56:36,681 INFO L87 Difference]: Start difference. First operand 278543 states and 1017057 transitions. Second operand 4 states. [2019-12-28 03:56:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:36,829 INFO L93 Difference]: Finished difference Result 34538 states and 108800 transitions. [2019-12-28 03:56:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:56:36,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 03:56:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:36,873 INFO L225 Difference]: With dead ends: 34538 [2019-12-28 03:56:36,873 INFO L226 Difference]: Without dead ends: 26989 [2019-12-28 03:56:36,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:56:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26989 states. [2019-12-28 03:56:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26989 to 26730. [2019-12-28 03:56:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26730 states. [2019-12-28 03:56:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26730 states to 26730 states and 81037 transitions. [2019-12-28 03:56:37,239 INFO L78 Accepts]: Start accepts. Automaton has 26730 states and 81037 transitions. Word has length 55 [2019-12-28 03:56:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:37,239 INFO L462 AbstractCegarLoop]: Abstraction has 26730 states and 81037 transitions. [2019-12-28 03:56:37,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:56:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26730 states and 81037 transitions. [2019-12-28 03:56:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:56:37,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:37,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:37,242 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1217896248, now seen corresponding path program 1 times [2019-12-28 03:56:37,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:37,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621517057] [2019-12-28 03:56:37,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:37,319 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-28 03:56:37,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621517057] [2019-12-28 03:56:37,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:37,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:56:37,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1676073169] [2019-12-28 03:56:37,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:37,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:37,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 03:56:37,337 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:37,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:37,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:56:37,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:56:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:56:37,339 INFO L87 Difference]: Start difference. First operand 26730 states and 81037 transitions. Second operand 6 states. [2019-12-28 03:56:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:38,089 INFO L93 Difference]: Finished difference Result 31474 states and 93784 transitions. [2019-12-28 03:56:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:56:38,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 03:56:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:38,139 INFO L225 Difference]: With dead ends: 31474 [2019-12-28 03:56:38,140 INFO L226 Difference]: Without dead ends: 31411 [2019-12-28 03:56:38,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:56:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31411 states. [2019-12-28 03:56:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31411 to 26773. [2019-12-28 03:56:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26773 states. [2019-12-28 03:56:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26773 states to 26773 states and 81115 transitions. [2019-12-28 03:56:39,737 INFO L78 Accepts]: Start accepts. Automaton has 26773 states and 81115 transitions. Word has length 55 [2019-12-28 03:56:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:39,737 INFO L462 AbstractCegarLoop]: Abstraction has 26773 states and 81115 transitions. [2019-12-28 03:56:39,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:56:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26773 states and 81115 transitions. [2019-12-28 03:56:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 03:56:39,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:39,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:39,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1786247972, now seen corresponding path program 1 times [2019-12-28 03:56:39,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:39,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021592946] [2019-12-28 03:56:39,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:39,805 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-28 03:56:39,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021592946] [2019-12-28 03:56:39,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:39,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:56:39,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683227540] [2019-12-28 03:56:39,806 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:39,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:39,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 03:56:39,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:39,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:39,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:56:39,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:56:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:56:39,829 INFO L87 Difference]: Start difference. First operand 26773 states and 81115 transitions. Second operand 4 states. [2019-12-28 03:56:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:40,029 INFO L93 Difference]: Finished difference Result 29478 states and 89161 transitions. [2019-12-28 03:56:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:56:40,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-28 03:56:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:40,087 INFO L225 Difference]: With dead ends: 29478 [2019-12-28 03:56:40,088 INFO L226 Difference]: Without dead ends: 29478 [2019-12-28 03:56:40,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 03:56:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29478 states. [2019-12-28 03:56:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29478 to 27743. [2019-12-28 03:56:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27743 states. [2019-12-28 03:56:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27743 states to 27743 states and 83974 transitions. [2019-12-28 03:56:40,485 INFO L78 Accepts]: Start accepts. Automaton has 27743 states and 83974 transitions. Word has length 63 [2019-12-28 03:56:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:40,485 INFO L462 AbstractCegarLoop]: Abstraction has 27743 states and 83974 transitions. [2019-12-28 03:56:40,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:56:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27743 states and 83974 transitions. [2019-12-28 03:56:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 03:56:40,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:40,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:40,491 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash -765908989, now seen corresponding path program 1 times [2019-12-28 03:56:40,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:40,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783993624] [2019-12-28 03:56:40,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:40,557 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-28 03:56:40,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783993624] [2019-12-28 03:56:40,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:40,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:56:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853742916] [2019-12-28 03:56:40,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:40,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:40,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 03:56:40,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:40,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:40,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:56:40,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:40,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:56:40,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:56:40,580 INFO L87 Difference]: Start difference. First operand 27743 states and 83974 transitions. Second operand 6 states. [2019-12-28 03:56:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:41,284 INFO L93 Difference]: Finished difference Result 35252 states and 104342 transitions. [2019-12-28 03:56:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:56:41,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-28 03:56:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:41,335 INFO L225 Difference]: With dead ends: 35252 [2019-12-28 03:56:41,335 INFO L226 Difference]: Without dead ends: 35191 [2019-12-28 03:56:41,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:56:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35191 states. [2019-12-28 03:56:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35191 to 34420. [2019-12-28 03:56:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34420 states. [2019-12-28 03:56:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34420 states to 34420 states and 102076 transitions. [2019-12-28 03:56:42,128 INFO L78 Accepts]: Start accepts. Automaton has 34420 states and 102076 transitions. Word has length 63 [2019-12-28 03:56:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:42,128 INFO L462 AbstractCegarLoop]: Abstraction has 34420 states and 102076 transitions. [2019-12-28 03:56:42,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:56:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34420 states and 102076 transitions. [2019-12-28 03:56:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:56:42,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:42,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:42,137 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1293652052, now seen corresponding path program 1 times [2019-12-28 03:56:42,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:42,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711764708] [2019-12-28 03:56:42,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:42,183 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-28 03:56:42,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711764708] [2019-12-28 03:56:42,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:42,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:56:42,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677508642] [2019-12-28 03:56:42,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:42,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:42,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:56:42,211 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:42,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:42,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:56:42,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:56:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:56:42,213 INFO L87 Difference]: Start difference. First operand 34420 states and 102076 transitions. Second operand 3 states. [2019-12-28 03:56:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:42,419 INFO L93 Difference]: Finished difference Result 42956 states and 126097 transitions. [2019-12-28 03:56:42,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:56:42,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 03:56:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:42,481 INFO L225 Difference]: With dead ends: 42956 [2019-12-28 03:56:42,481 INFO L226 Difference]: Without dead ends: 42956 [2019-12-28 03:56:42,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:56:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42956 states. [2019-12-28 03:56:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42956 to 35387. [2019-12-28 03:56:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35387 states. [2019-12-28 03:56:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35387 states to 35387 states and 102964 transitions. [2019-12-28 03:56:43,407 INFO L78 Accepts]: Start accepts. Automaton has 35387 states and 102964 transitions. Word has length 69 [2019-12-28 03:56:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:43,407 INFO L462 AbstractCegarLoop]: Abstraction has 35387 states and 102964 transitions. [2019-12-28 03:56:43,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:56:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35387 states and 102964 transitions. [2019-12-28 03:56:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:56:43,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:43,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:43,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash -582300025, now seen corresponding path program 1 times [2019-12-28 03:56:43,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:43,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411505205] [2019-12-28 03:56:43,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:43,522 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-28 03:56:43,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411505205] [2019-12-28 03:56:43,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:43,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:56:43,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52911692] [2019-12-28 03:56:43,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:43,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:43,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 03:56:43,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:43,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:43,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:56:43,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:43,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:56:43,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:56:43,560 INFO L87 Difference]: Start difference. First operand 35387 states and 102964 transitions. Second operand 5 states. [2019-12-28 03:56:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:44,045 INFO L93 Difference]: Finished difference Result 40929 states and 118812 transitions. [2019-12-28 03:56:44,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:56:44,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 03:56:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:44,105 INFO L225 Difference]: With dead ends: 40929 [2019-12-28 03:56:44,105 INFO L226 Difference]: Without dead ends: 40929 [2019-12-28 03:56:44,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:56:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40929 states. [2019-12-28 03:56:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40929 to 39056. [2019-12-28 03:56:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39056 states. [2019-12-28 03:56:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 113480 transitions. [2019-12-28 03:56:44,629 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 113480 transitions. Word has length 75 [2019-12-28 03:56:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:44,629 INFO L462 AbstractCegarLoop]: Abstraction has 39056 states and 113480 transitions. [2019-12-28 03:56:44,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:56:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 113480 transitions. [2019-12-28 03:56:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:56:44,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:44,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:44,643 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1160510310, now seen corresponding path program 1 times [2019-12-28 03:56:44,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:44,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786016928] [2019-12-28 03:56:44,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:44,712 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-28 03:56:44,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786016928] [2019-12-28 03:56:44,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:44,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:56:44,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928471180] [2019-12-28 03:56:44,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:44,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:44,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 03:56:44,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:44,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:44,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:56:44,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:56:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:56:44,749 INFO L87 Difference]: Start difference. First operand 39056 states and 113480 transitions. Second operand 7 states. [2019-12-28 03:56:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:45,979 INFO L93 Difference]: Finished difference Result 43100 states and 124718 transitions. [2019-12-28 03:56:45,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:56:45,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 03:56:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:46,037 INFO L225 Difference]: With dead ends: 43100 [2019-12-28 03:56:46,037 INFO L226 Difference]: Without dead ends: 43023 [2019-12-28 03:56:46,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:56:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43023 states. [2019-12-28 03:56:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43023 to 36439. [2019-12-28 03:56:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36439 states. [2019-12-28 03:56:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 106972 transitions. [2019-12-28 03:56:46,531 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 106972 transitions. Word has length 75 [2019-12-28 03:56:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:46,531 INFO L462 AbstractCegarLoop]: Abstraction has 36439 states and 106972 transitions. [2019-12-28 03:56:46,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:56:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 106972 transitions. [2019-12-28 03:56:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 03:56:46,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:46,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:46,544 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:46,544 INFO L82 PathProgramCache]: Analyzing trace with hash 406738322, now seen corresponding path program 1 times [2019-12-28 03:56:46,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:46,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202146338] [2019-12-28 03:56:46,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:46,616 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-28 03:56:46,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202146338] [2019-12-28 03:56:46,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:46,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:56:46,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258671227] [2019-12-28 03:56:46,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:46,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:46,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 77 transitions. [2019-12-28 03:56:46,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:46,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:46,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:56:46,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:56:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:56:46,657 INFO L87 Difference]: Start difference. First operand 36439 states and 106972 transitions. Second operand 7 states. [2019-12-28 03:56:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:47,856 INFO L93 Difference]: Finished difference Result 48613 states and 140149 transitions. [2019-12-28 03:56:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:56:47,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-28 03:56:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:47,929 INFO L225 Difference]: With dead ends: 48613 [2019-12-28 03:56:47,929 INFO L226 Difference]: Without dead ends: 48565 [2019-12-28 03:56:47,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:56:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48565 states. [2019-12-28 03:56:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48565 to 40512. [2019-12-28 03:56:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40512 states. [2019-12-28 03:56:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40512 states to 40512 states and 117398 transitions. [2019-12-28 03:56:48,772 INFO L78 Accepts]: Start accepts. Automaton has 40512 states and 117398 transitions. Word has length 77 [2019-12-28 03:56:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:48,772 INFO L462 AbstractCegarLoop]: Abstraction has 40512 states and 117398 transitions. [2019-12-28 03:56:48,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:56:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40512 states and 117398 transitions. [2019-12-28 03:56:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:56:48,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:48,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:48,792 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1183066378, now seen corresponding path program 1 times [2019-12-28 03:56:48,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:48,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475767590] [2019-12-28 03:56:48,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:48,830 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-28 03:56:48,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475767590] [2019-12-28 03:56:48,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:48,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:56:48,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451374538] [2019-12-28 03:56:48,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:48,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:48,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 92 transitions. [2019-12-28 03:56:48,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:48,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:48,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:56:48,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:48,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:56:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:56:48,878 INFO L87 Difference]: Start difference. First operand 40512 states and 117398 transitions. Second operand 3 states. [2019-12-28 03:56:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:49,282 INFO L93 Difference]: Finished difference Result 49571 states and 141798 transitions. [2019-12-28 03:56:49,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:56:49,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-28 03:56:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:49,351 INFO L225 Difference]: With dead ends: 49571 [2019-12-28 03:56:49,351 INFO L226 Difference]: Without dead ends: 49571 [2019-12-28 03:56:49,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:56:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49571 states. [2019-12-28 03:56:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49571 to 45675. [2019-12-28 03:56:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45675 states. [2019-12-28 03:56:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45675 states to 45675 states and 131329 transitions. [2019-12-28 03:56:50,251 INFO L78 Accepts]: Start accepts. Automaton has 45675 states and 131329 transitions. Word has length 82 [2019-12-28 03:56:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:50,251 INFO L462 AbstractCegarLoop]: Abstraction has 45675 states and 131329 transitions. [2019-12-28 03:56:50,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:56:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 45675 states and 131329 transitions. [2019-12-28 03:56:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:56:50,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:56:50,284 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1797217747, now seen corresponding path program 1 times [2019-12-28 03:56:50,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:50,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280175750] [2019-12-28 03:56:50,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:50,345 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-28 03:56:50,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280175750] [2019-12-28 03:56:50,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:50,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:56:50,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068372009] [2019-12-28 03:56:50,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:50,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:50,458 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 315 transitions. [2019-12-28 03:56:50,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:50,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 03:56:50,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:56:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:56:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:56:50,523 INFO L87 Difference]: Start difference. First operand 45675 states and 131329 transitions. Second operand 7 states. [2019-12-28 03:56:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:51,123 INFO L93 Difference]: Finished difference Result 50506 states and 144515 transitions. [2019-12-28 03:56:51,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:56:51,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 03:56:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:51,201 INFO L225 Difference]: With dead ends: 50506 [2019-12-28 03:56:51,202 INFO L226 Difference]: Without dead ends: 50506 [2019-12-28 03:56:51,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:56:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50506 states. [2019-12-28 03:56:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50506 to 49663. [2019-12-28 03:56:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49663 states. [2019-12-28 03:56:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49663 states to 49663 states and 142083 transitions. [2019-12-28 03:56:52,259 INFO L78 Accepts]: Start accepts. Automaton has 49663 states and 142083 transitions. Word has length 83 [2019-12-28 03:56:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:52,259 INFO L462 AbstractCegarLoop]: Abstraction has 49663 states and 142083 transitions. [2019-12-28 03:56:52,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:56:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 49663 states and 142083 transitions. [2019-12-28 03:56:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:56:52,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:52,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:52,293 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash -279991596, now seen corresponding path program 1 times [2019-12-28 03:56:52,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:52,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918378874] [2019-12-28 03:56:52,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:52,335 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-28 03:56:52,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918378874] [2019-12-28 03:56:52,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:52,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:56:52,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331106182] [2019-12-28 03:56:52,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:52,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:52,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 315 transitions. [2019-12-28 03:56:52,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:52,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:56:52,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:56:52,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:56:52,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:56:52,498 INFO L87 Difference]: Start difference. First operand 49663 states and 142083 transitions. Second operand 5 states. [2019-12-28 03:56:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:53,158 INFO L93 Difference]: Finished difference Result 60693 states and 170203 transitions. [2019-12-28 03:56:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:56:53,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-28 03:56:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:53,242 INFO L225 Difference]: With dead ends: 60693 [2019-12-28 03:56:53,242 INFO L226 Difference]: Without dead ends: 60693 [2019-12-28 03:56:53,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:56:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60693 states. [2019-12-28 03:56:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60693 to 56625. [2019-12-28 03:56:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56625 states. [2019-12-28 03:56:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56625 states to 56625 states and 159736 transitions. [2019-12-28 03:56:54,395 INFO L78 Accepts]: Start accepts. Automaton has 56625 states and 159736 transitions. Word has length 83 [2019-12-28 03:56:54,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:54,395 INFO L462 AbstractCegarLoop]: Abstraction has 56625 states and 159736 transitions. [2019-12-28 03:56:54,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:56:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 56625 states and 159736 transitions. [2019-12-28 03:56:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:56:54,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:54,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:54,425 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -276703570, now seen corresponding path program 1 times [2019-12-28 03:56:54,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:54,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280540442] [2019-12-28 03:56:54,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:54,484 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-28 03:56:54,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280540442] [2019-12-28 03:56:54,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:54,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:56:54,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740452065] [2019-12-28 03:56:54,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:54,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:54,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-28 03:56:54,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:54,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:54,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:56:54,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:56:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:56:54,537 INFO L87 Difference]: Start difference. First operand 56625 states and 159736 transitions. Second operand 4 states. [2019-12-28 03:56:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:54,791 INFO L93 Difference]: Finished difference Result 59784 states and 166836 transitions. [2019-12-28 03:56:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:56:54,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-28 03:56:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:54,871 INFO L225 Difference]: With dead ends: 59784 [2019-12-28 03:56:54,871 INFO L226 Difference]: Without dead ends: 59784 [2019-12-28 03:56:54,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:56:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59784 states. [2019-12-28 03:56:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59784 to 56662. [2019-12-28 03:56:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56662 states. [2019-12-28 03:56:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56662 states to 56662 states and 158140 transitions. [2019-12-28 03:56:56,134 INFO L78 Accepts]: Start accepts. Automaton has 56662 states and 158140 transitions. Word has length 84 [2019-12-28 03:56:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:56,134 INFO L462 AbstractCegarLoop]: Abstraction has 56662 states and 158140 transitions. [2019-12-28 03:56:56,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:56:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 56662 states and 158140 transitions. [2019-12-28 03:56:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:56:56,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:56,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:56,163 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -65352657, now seen corresponding path program 1 times [2019-12-28 03:56:56,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:56,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152770736] [2019-12-28 03:56:56,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:56:56,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152770736] [2019-12-28 03:56:56,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:56,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:56:56,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456355442] [2019-12-28 03:56:56,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:56,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:56,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-28 03:56:56,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:56,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:56:56,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:56:56,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:56:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:56:56,286 INFO L87 Difference]: Start difference. First operand 56662 states and 158140 transitions. Second operand 5 states. [2019-12-28 03:56:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:56:57,345 INFO L93 Difference]: Finished difference Result 64151 states and 176361 transitions. [2019-12-28 03:56:57,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:56:57,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-28 03:56:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:56:57,430 INFO L225 Difference]: With dead ends: 64151 [2019-12-28 03:56:57,430 INFO L226 Difference]: Without dead ends: 64151 [2019-12-28 03:56:57,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:56:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64151 states. [2019-12-28 03:56:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64151 to 61941. [2019-12-28 03:56:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61941 states. [2019-12-28 03:56:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61941 states to 61941 states and 171191 transitions. [2019-12-28 03:56:58,610 INFO L78 Accepts]: Start accepts. Automaton has 61941 states and 171191 transitions. Word has length 84 [2019-12-28 03:56:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:56:58,611 INFO L462 AbstractCegarLoop]: Abstraction has 61941 states and 171191 transitions. [2019-12-28 03:56:58,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:56:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 61941 states and 171191 transitions. [2019-12-28 03:56:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:56:58,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:56:58,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:56:58,640 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:56:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:56:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1179411824, now seen corresponding path program 1 times [2019-12-28 03:56:58,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:56:58,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072128382] [2019-12-28 03:56:58,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:56:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:56:58,760 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-28 03:56:58,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072128382] [2019-12-28 03:56:58,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:56:58,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:56:58,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194881541] [2019-12-28 03:56:58,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:56:58,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:56:58,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-28 03:56:58,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:56:58,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:56:58,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:56:58,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:56:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:56:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:56:58,833 INFO L87 Difference]: Start difference. First operand 61941 states and 171191 transitions. Second operand 9 states. [2019-12-28 03:57:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:01,175 INFO L93 Difference]: Finished difference Result 99818 states and 275787 transitions. [2019-12-28 03:57:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 03:57:01,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-28 03:57:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:01,330 INFO L225 Difference]: With dead ends: 99818 [2019-12-28 03:57:01,331 INFO L226 Difference]: Without dead ends: 99500 [2019-12-28 03:57:01,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:57:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99500 states. [2019-12-28 03:57:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99500 to 83793. [2019-12-28 03:57:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83793 states. [2019-12-28 03:57:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83793 states to 83793 states and 231549 transitions. [2019-12-28 03:57:02,997 INFO L78 Accepts]: Start accepts. Automaton has 83793 states and 231549 transitions. Word has length 84 [2019-12-28 03:57:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:02,997 INFO L462 AbstractCegarLoop]: Abstraction has 83793 states and 231549 transitions. [2019-12-28 03:57:02,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:57:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 83793 states and 231549 transitions. [2019-12-28 03:57:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:57:03,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:03,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:03,036 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -617539535, now seen corresponding path program 1 times [2019-12-28 03:57:03,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:03,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746972315] [2019-12-28 03:57:03,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:03,148 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-28 03:57:03,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746972315] [2019-12-28 03:57:03,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:03,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:03,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360232766] [2019-12-28 03:57:03,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:03,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:03,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-28 03:57:03,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:03,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:03,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:03,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:03,201 INFO L87 Difference]: Start difference. First operand 83793 states and 231549 transitions. Second operand 8 states. [2019-12-28 03:57:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:06,332 INFO L93 Difference]: Finished difference Result 178613 states and 505336 transitions. [2019-12-28 03:57:06,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 03:57:06,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-28 03:57:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:06,624 INFO L225 Difference]: With dead ends: 178613 [2019-12-28 03:57:06,624 INFO L226 Difference]: Without dead ends: 178505 [2019-12-28 03:57:06,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-12-28 03:57:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178505 states. [2019-12-28 03:57:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178505 to 110513. [2019-12-28 03:57:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110513 states. [2019-12-28 03:57:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110513 states to 110513 states and 311403 transitions. [2019-12-28 03:57:09,191 INFO L78 Accepts]: Start accepts. Automaton has 110513 states and 311403 transitions. Word has length 84 [2019-12-28 03:57:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:09,191 INFO L462 AbstractCegarLoop]: Abstraction has 110513 states and 311403 transitions. [2019-12-28 03:57:09,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 110513 states and 311403 transitions. [2019-12-28 03:57:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:57:09,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:09,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:57:09,240 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 269964146, now seen corresponding path program 1 times [2019-12-28 03:57:09,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:09,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340802249] [2019-12-28 03:57:09,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:09,820 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-28 03:57:09,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340802249] [2019-12-28 03:57:09,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:09,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:09,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000023094] [2019-12-28 03:57:09,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:09,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:09,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 94 transitions. [2019-12-28 03:57:09,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:09,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:57:09,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:57:09,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:57:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:57:09,880 INFO L87 Difference]: Start difference. First operand 110513 states and 311403 transitions. Second operand 5 states. [2019-12-28 03:57:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:10,129 INFO L93 Difference]: Finished difference Result 45095 states and 107744 transitions. [2019-12-28 03:57:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:57:10,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-28 03:57:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:10,201 INFO L225 Difference]: With dead ends: 45095 [2019-12-28 03:57:10,201 INFO L226 Difference]: Without dead ends: 39743 [2019-12-28 03:57:10,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-28 03:57:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39743 states. [2019-12-28 03:57:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39743 to 32550. [2019-12-28 03:57:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32550 states. [2019-12-28 03:57:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32550 states to 32550 states and 77200 transitions. [2019-12-28 03:57:10,882 INFO L78 Accepts]: Start accepts. Automaton has 32550 states and 77200 transitions. Word has length 84 [2019-12-28 03:57:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:10,883 INFO L462 AbstractCegarLoop]: Abstraction has 32550 states and 77200 transitions. [2019-12-28 03:57:10,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:57:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32550 states and 77200 transitions. [2019-12-28 03:57:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:10,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:10,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:10,919 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1633083230, now seen corresponding path program 1 times [2019-12-28 03:57:10,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:10,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836917984] [2019-12-28 03:57:10,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:11,034 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-28 03:57:11,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836917984] [2019-12-28 03:57:11,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:11,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:11,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747880832] [2019-12-28 03:57:11,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:11,070 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:11,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 285 states and 456 transitions. [2019-12-28 03:57:11,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:11,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-28 03:57:11,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:57:11,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:57:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:57:11,410 INFO L87 Difference]: Start difference. First operand 32550 states and 77200 transitions. Second operand 12 states. [2019-12-28 03:57:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:12,087 INFO L93 Difference]: Finished difference Result 43587 states and 100851 transitions. [2019-12-28 03:57:12,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:57:12,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2019-12-28 03:57:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:12,132 INFO L225 Difference]: With dead ends: 43587 [2019-12-28 03:57:12,135 INFO L226 Difference]: Without dead ends: 43529 [2019-12-28 03:57:12,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:57:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43529 states. [2019-12-28 03:57:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43529 to 34140. [2019-12-28 03:57:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34140 states. [2019-12-28 03:57:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34140 states to 34140 states and 79729 transitions. [2019-12-28 03:57:12,816 INFO L78 Accepts]: Start accepts. Automaton has 34140 states and 79729 transitions. Word has length 112 [2019-12-28 03:57:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:12,816 INFO L462 AbstractCegarLoop]: Abstraction has 34140 states and 79729 transitions. [2019-12-28 03:57:12,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:57:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 34140 states and 79729 transitions. [2019-12-28 03:57:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:12,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:12,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:12,845 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1516270661, now seen corresponding path program 1 times [2019-12-28 03:57:12,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:12,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330469183] [2019-12-28 03:57:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:12,909 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-28 03:57:12,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330469183] [2019-12-28 03:57:12,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:12,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:12,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [162680092] [2019-12-28 03:57:12,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:12,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:13,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 364 transitions. [2019-12-28 03:57:13,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:13,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:57:13,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:13,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:13,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:13,254 INFO L87 Difference]: Start difference. First operand 34140 states and 79729 transitions. Second operand 7 states. [2019-12-28 03:57:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:14,050 INFO L93 Difference]: Finished difference Result 35958 states and 83701 transitions. [2019-12-28 03:57:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:57:14,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-28 03:57:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:14,091 INFO L225 Difference]: With dead ends: 35958 [2019-12-28 03:57:14,092 INFO L226 Difference]: Without dead ends: 35896 [2019-12-28 03:57:14,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:57:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2019-12-28 03:57:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 34146. [2019-12-28 03:57:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34146 states. [2019-12-28 03:57:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34146 states to 34146 states and 79742 transitions. [2019-12-28 03:57:14,505 INFO L78 Accepts]: Start accepts. Automaton has 34146 states and 79742 transitions. Word has length 112 [2019-12-28 03:57:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:14,505 INFO L462 AbstractCegarLoop]: Abstraction has 34146 states and 79742 transitions. [2019-12-28 03:57:14,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34146 states and 79742 transitions. [2019-12-28 03:57:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:14,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:14,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:14,744 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:14,744 INFO L82 PathProgramCache]: Analyzing trace with hash 843036348, now seen corresponding path program 2 times [2019-12-28 03:57:14,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:14,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371428153] [2019-12-28 03:57:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:14,871 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-28 03:57:14,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371428153] [2019-12-28 03:57:14,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:14,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:14,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937944929] [2019-12-28 03:57:14,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:14,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:15,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 364 transitions. [2019-12-28 03:57:15,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:15,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 03:57:15,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:57:15,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:57:15,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:57:15,257 INFO L87 Difference]: Start difference. First operand 34146 states and 79742 transitions. Second operand 10 states. [2019-12-28 03:57:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:16,464 INFO L93 Difference]: Finished difference Result 45199 states and 102865 transitions. [2019-12-28 03:57:16,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:57:16,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2019-12-28 03:57:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:16,547 INFO L225 Difference]: With dead ends: 45199 [2019-12-28 03:57:16,548 INFO L226 Difference]: Without dead ends: 45199 [2019-12-28 03:57:16,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:57:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45199 states. [2019-12-28 03:57:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45199 to 38168. [2019-12-28 03:57:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38168 states. [2019-12-28 03:57:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38168 states to 38168 states and 87539 transitions. [2019-12-28 03:57:17,428 INFO L78 Accepts]: Start accepts. Automaton has 38168 states and 87539 transitions. Word has length 112 [2019-12-28 03:57:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:17,428 INFO L462 AbstractCegarLoop]: Abstraction has 38168 states and 87539 transitions. [2019-12-28 03:57:17,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:57:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38168 states and 87539 transitions. [2019-12-28 03:57:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:17,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:17,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:17,477 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:17,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:17,478 INFO L82 PathProgramCache]: Analyzing trace with hash -79647235, now seen corresponding path program 1 times [2019-12-28 03:57:17,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:17,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57402420] [2019-12-28 03:57:17,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:17,561 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-28 03:57:17,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57402420] [2019-12-28 03:57:17,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:17,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:17,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228875765] [2019-12-28 03:57:17,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:17,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:18,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 364 transitions. [2019-12-28 03:57:18,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:18,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:57:18,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:57:18,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:57:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:18,183 INFO L87 Difference]: Start difference. First operand 38168 states and 87539 transitions. Second operand 6 states. [2019-12-28 03:57:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:18,525 INFO L93 Difference]: Finished difference Result 43450 states and 99209 transitions. [2019-12-28 03:57:18,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:57:18,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-28 03:57:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:18,590 INFO L225 Difference]: With dead ends: 43450 [2019-12-28 03:57:18,590 INFO L226 Difference]: Without dead ends: 43450 [2019-12-28 03:57:18,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43450 states. [2019-12-28 03:57:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43450 to 35145. [2019-12-28 03:57:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35145 states. [2019-12-28 03:57:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35145 states to 35145 states and 80302 transitions. [2019-12-28 03:57:19,187 INFO L78 Accepts]: Start accepts. Automaton has 35145 states and 80302 transitions. Word has length 112 [2019-12-28 03:57:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:19,187 INFO L462 AbstractCegarLoop]: Abstraction has 35145 states and 80302 transitions. [2019-12-28 03:57:19,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 35145 states and 80302 transitions. [2019-12-28 03:57:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:19,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:19,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:19,220 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1819828379, now seen corresponding path program 1 times [2019-12-28 03:57:19,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:19,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871312009] [2019-12-28 03:57:19,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:19,301 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-28 03:57:19,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871312009] [2019-12-28 03:57:19,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:19,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:19,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1291736656] [2019-12-28 03:57:19,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:19,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:19,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 364 transitions. [2019-12-28 03:57:19,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:19,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 03:57:19,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:19,500 INFO L87 Difference]: Start difference. First operand 35145 states and 80302 transitions. Second operand 8 states. [2019-12-28 03:57:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:20,214 INFO L93 Difference]: Finished difference Result 38722 states and 88056 transitions. [2019-12-28 03:57:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:57:20,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-12-28 03:57:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:20,258 INFO L225 Difference]: With dead ends: 38722 [2019-12-28 03:57:20,258 INFO L226 Difference]: Without dead ends: 38616 [2019-12-28 03:57:20,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:57:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38616 states. [2019-12-28 03:57:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38616 to 35120. [2019-12-28 03:57:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35120 states. [2019-12-28 03:57:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35120 states to 35120 states and 80155 transitions. [2019-12-28 03:57:20,954 INFO L78 Accepts]: Start accepts. Automaton has 35120 states and 80155 transitions. Word has length 112 [2019-12-28 03:57:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:20,955 INFO L462 AbstractCegarLoop]: Abstraction has 35120 states and 80155 transitions. [2019-12-28 03:57:20,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 35120 states and 80155 transitions. [2019-12-28 03:57:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:20,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:20,989 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1007934813, now seen corresponding path program 1 times [2019-12-28 03:57:20,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:20,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363190685] [2019-12-28 03:57:20,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:21,120 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-28 03:57:21,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363190685] [2019-12-28 03:57:21,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:21,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:21,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895068842] [2019-12-28 03:57:21,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:21,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:21,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 351 transitions. [2019-12-28 03:57:21,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:21,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:57:21,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:57:21,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:57:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:57:21,380 INFO L87 Difference]: Start difference. First operand 35120 states and 80155 transitions. Second operand 11 states. [2019-12-28 03:57:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:25,095 INFO L93 Difference]: Finished difference Result 69912 states and 157340 transitions. [2019-12-28 03:57:25,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-28 03:57:25,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2019-12-28 03:57:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:25,173 INFO L225 Difference]: With dead ends: 69912 [2019-12-28 03:57:25,173 INFO L226 Difference]: Without dead ends: 69858 [2019-12-28 03:57:25,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=1241, Unknown=0, NotChecked=0, Total=1560 [2019-12-28 03:57:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69858 states. [2019-12-28 03:57:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69858 to 42273. [2019-12-28 03:57:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42273 states. [2019-12-28 03:57:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42273 states to 42273 states and 96479 transitions. [2019-12-28 03:57:26,147 INFO L78 Accepts]: Start accepts. Automaton has 42273 states and 96479 transitions. Word has length 112 [2019-12-28 03:57:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:26,147 INFO L462 AbstractCegarLoop]: Abstraction has 42273 states and 96479 transitions. [2019-12-28 03:57:26,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:57:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 42273 states and 96479 transitions. [2019-12-28 03:57:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:26,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:26,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:26,185 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1917382491, now seen corresponding path program 1 times [2019-12-28 03:57:26,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:26,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306768690] [2019-12-28 03:57:26,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:26,311 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-28 03:57:26,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306768690] [2019-12-28 03:57:26,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:26,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:26,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225013830] [2019-12-28 03:57:26,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:26,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:26,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 351 transitions. [2019-12-28 03:57:26,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:26,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:57:26,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:26,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:26,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:26,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:26,530 INFO L87 Difference]: Start difference. First operand 42273 states and 96479 transitions. Second operand 8 states. [2019-12-28 03:57:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:26,809 INFO L93 Difference]: Finished difference Result 49795 states and 112089 transitions. [2019-12-28 03:57:26,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:57:26,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-12-28 03:57:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:26,862 INFO L225 Difference]: With dead ends: 49795 [2019-12-28 03:57:26,862 INFO L226 Difference]: Without dead ends: 49795 [2019-12-28 03:57:26,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:57:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49795 states. [2019-12-28 03:57:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49795 to 42823. [2019-12-28 03:57:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42823 states. [2019-12-28 03:57:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42823 states to 42823 states and 96920 transitions. [2019-12-28 03:57:27,372 INFO L78 Accepts]: Start accepts. Automaton has 42823 states and 96920 transitions. Word has length 112 [2019-12-28 03:57:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:27,372 INFO L462 AbstractCegarLoop]: Abstraction has 42823 states and 96920 transitions. [2019-12-28 03:57:27,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 42823 states and 96920 transitions. [2019-12-28 03:57:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-28 03:57:27,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:27,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:27,408 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash 645609253, now seen corresponding path program 1 times [2019-12-28 03:57:27,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:27,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227809882] [2019-12-28 03:57:27,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:27,520 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-28 03:57:27,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227809882] [2019-12-28 03:57:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:27,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:27,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463601778] [2019-12-28 03:57:27,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:27,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:27,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 351 transitions. [2019-12-28 03:57:27,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:27,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:27,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:27,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:27,986 INFO L87 Difference]: Start difference. First operand 42823 states and 96920 transitions. Second operand 7 states. [2019-12-28 03:57:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:28,223 INFO L93 Difference]: Finished difference Result 42670 states and 96410 transitions. [2019-12-28 03:57:28,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:57:28,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-28 03:57:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:28,272 INFO L225 Difference]: With dead ends: 42670 [2019-12-28 03:57:28,272 INFO L226 Difference]: Without dead ends: 42670 [2019-12-28 03:57:28,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42670 states. [2019-12-28 03:57:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42670 to 31679. [2019-12-28 03:57:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31679 states. [2019-12-28 03:57:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31679 states to 31679 states and 71757 transitions. [2019-12-28 03:57:28,741 INFO L78 Accepts]: Start accepts. Automaton has 31679 states and 71757 transitions. Word has length 112 [2019-12-28 03:57:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:28,741 INFO L462 AbstractCegarLoop]: Abstraction has 31679 states and 71757 transitions. [2019-12-28 03:57:28,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 31679 states and 71757 transitions. [2019-12-28 03:57:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:28,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:28,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:28,771 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:28,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash -333774747, now seen corresponding path program 1 times [2019-12-28 03:57:28,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:28,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946302140] [2019-12-28 03:57:28,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:28,857 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-28 03:57:28,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946302140] [2019-12-28 03:57:28,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:28,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:28,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378626957] [2019-12-28 03:57:28,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:28,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:29,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 366 transitions. [2019-12-28 03:57:29,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:29,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-28 03:57:29,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:57:29,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:57:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:57:29,159 INFO L87 Difference]: Start difference. First operand 31679 states and 71757 transitions. Second operand 12 states. [2019-12-28 03:57:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:30,162 INFO L93 Difference]: Finished difference Result 36866 states and 83277 transitions. [2019-12-28 03:57:30,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:57:30,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-12-28 03:57:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:30,202 INFO L225 Difference]: With dead ends: 36866 [2019-12-28 03:57:30,202 INFO L226 Difference]: Without dead ends: 36866 [2019-12-28 03:57:30,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:57:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states. [2019-12-28 03:57:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 34203. [2019-12-28 03:57:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34203 states. [2019-12-28 03:57:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34203 states to 34203 states and 77617 transitions. [2019-12-28 03:57:30,842 INFO L78 Accepts]: Start accepts. Automaton has 34203 states and 77617 transitions. Word has length 114 [2019-12-28 03:57:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:30,842 INFO L462 AbstractCegarLoop]: Abstraction has 34203 states and 77617 transitions. [2019-12-28 03:57:30,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:57:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34203 states and 77617 transitions. [2019-12-28 03:57:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:30,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:30,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:30,871 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1660322440, now seen corresponding path program 1 times [2019-12-28 03:57:30,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:30,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144441220] [2019-12-28 03:57:30,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:30,965 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-28 03:57:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144441220] [2019-12-28 03:57:30,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:30,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:30,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1161625382] [2019-12-28 03:57:30,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:30,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:31,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 287 states and 458 transitions. [2019-12-28 03:57:31,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:31,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:57:31,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:57:31,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:57:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:57:31,278 INFO L87 Difference]: Start difference. First operand 34203 states and 77617 transitions. Second operand 6 states. [2019-12-28 03:57:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:31,392 INFO L93 Difference]: Finished difference Result 34203 states and 77608 transitions. [2019-12-28 03:57:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:57:31,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-28 03:57:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:31,429 INFO L225 Difference]: With dead ends: 34203 [2019-12-28 03:57:31,429 INFO L226 Difference]: Without dead ends: 34203 [2019-12-28 03:57:31,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34203 states. [2019-12-28 03:57:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34203 to 34203. [2019-12-28 03:57:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34203 states. [2019-12-28 03:57:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34203 states to 34203 states and 77608 transitions. [2019-12-28 03:57:31,810 INFO L78 Accepts]: Start accepts. Automaton has 34203 states and 77608 transitions. Word has length 114 [2019-12-28 03:57:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:31,811 INFO L462 AbstractCegarLoop]: Abstraction has 34203 states and 77608 transitions. [2019-12-28 03:57:31,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:57:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 34203 states and 77608 transitions. [2019-12-28 03:57:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:31,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:31,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:31,842 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1747141175, now seen corresponding path program 1 times [2019-12-28 03:57:31,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:31,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438144399] [2019-12-28 03:57:31,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:31,927 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-28 03:57:31,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438144399] [2019-12-28 03:57:31,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:31,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:57:31,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1247933214] [2019-12-28 03:57:31,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:31,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:32,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 287 states and 458 transitions. [2019-12-28 03:57:32,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:32,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 03:57:32,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:57:32,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:57:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:32,499 INFO L87 Difference]: Start difference. First operand 34203 states and 77608 transitions. Second operand 7 states. [2019-12-28 03:57:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:33,032 INFO L93 Difference]: Finished difference Result 36294 states and 82197 transitions. [2019-12-28 03:57:33,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:57:33,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-28 03:57:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:33,073 INFO L225 Difference]: With dead ends: 36294 [2019-12-28 03:57:33,073 INFO L226 Difference]: Without dead ends: 36294 [2019-12-28 03:57:33,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:57:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36294 states. [2019-12-28 03:57:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36294 to 33349. [2019-12-28 03:57:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33349 states. [2019-12-28 03:57:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33349 states to 33349 states and 75677 transitions. [2019-12-28 03:57:33,464 INFO L78 Accepts]: Start accepts. Automaton has 33349 states and 75677 transitions. Word has length 114 [2019-12-28 03:57:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 33349 states and 75677 transitions. [2019-12-28 03:57:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:57:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33349 states and 75677 transitions. [2019-12-28 03:57:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:33,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:33,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:33,496 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -207576506, now seen corresponding path program 1 times [2019-12-28 03:57:33,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:33,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182453171] [2019-12-28 03:57:33,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:33,601 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-28 03:57:33,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182453171] [2019-12-28 03:57:33,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:33,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:57:33,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580659780] [2019-12-28 03:57:33,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:33,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:33,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 359 transitions. [2019-12-28 03:57:33,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:33,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 03:57:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:57:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:57:33,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:57:33,887 INFO L87 Difference]: Start difference. First operand 33349 states and 75677 transitions. Second operand 12 states. [2019-12-28 03:57:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:35,108 INFO L93 Difference]: Finished difference Result 38655 states and 87963 transitions. [2019-12-28 03:57:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 03:57:35,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-12-28 03:57:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:35,148 INFO L225 Difference]: With dead ends: 38655 [2019-12-28 03:57:35,149 INFO L226 Difference]: Without dead ends: 38655 [2019-12-28 03:57:35,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-12-28 03:57:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38655 states. [2019-12-28 03:57:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38655 to 29278. [2019-12-28 03:57:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29278 states. [2019-12-28 03:57:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29278 states to 29278 states and 66477 transitions. [2019-12-28 03:57:35,539 INFO L78 Accepts]: Start accepts. Automaton has 29278 states and 66477 transitions. Word has length 114 [2019-12-28 03:57:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:35,539 INFO L462 AbstractCegarLoop]: Abstraction has 29278 states and 66477 transitions. [2019-12-28 03:57:35,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:57:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 29278 states and 66477 transitions. [2019-12-28 03:57:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:35,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:35,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:35,771 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash -160487065, now seen corresponding path program 2 times [2019-12-28 03:57:35,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:35,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447488606] [2019-12-28 03:57:35,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:57:35,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447488606] [2019-12-28 03:57:35,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:35,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:35,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842771467] [2019-12-28 03:57:35,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:35,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:36,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 427 transitions. [2019-12-28 03:57:36,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:36,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:57:36,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:36,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:36,207 INFO L87 Difference]: Start difference. First operand 29278 states and 66477 transitions. Second operand 8 states. [2019-12-28 03:57:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:36,783 INFO L93 Difference]: Finished difference Result 32266 states and 73022 transitions. [2019-12-28 03:57:36,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:57:36,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-28 03:57:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:36,818 INFO L225 Difference]: With dead ends: 32266 [2019-12-28 03:57:36,818 INFO L226 Difference]: Without dead ends: 32266 [2019-12-28 03:57:36,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32266 states. [2019-12-28 03:57:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32266 to 29235. [2019-12-28 03:57:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29235 states. [2019-12-28 03:57:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29235 states to 29235 states and 66302 transitions. [2019-12-28 03:57:37,140 INFO L78 Accepts]: Start accepts. Automaton has 29235 states and 66302 transitions. Word has length 114 [2019-12-28 03:57:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:37,140 INFO L462 AbstractCegarLoop]: Abstraction has 29235 states and 66302 transitions. [2019-12-28 03:57:37,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29235 states and 66302 transitions. [2019-12-28 03:57:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:37,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:37,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:37,167 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1517791349, now seen corresponding path program 3 times [2019-12-28 03:57:37,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:37,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743721809] [2019-12-28 03:57:37,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:37,217 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-28 03:57:37,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743721809] [2019-12-28 03:57:37,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:37,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:57:37,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629883473] [2019-12-28 03:57:37,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:37,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:37,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 217 transitions. [2019-12-28 03:57:37,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:37,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:57:37,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:57:37,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:37,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:57:37,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:57:37,374 INFO L87 Difference]: Start difference. First operand 29235 states and 66302 transitions. Second operand 3 states. [2019-12-28 03:57:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:37,459 INFO L93 Difference]: Finished difference Result 36537 states and 82146 transitions. [2019-12-28 03:57:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:57:37,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-12-28 03:57:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:37,499 INFO L225 Difference]: With dead ends: 36537 [2019-12-28 03:57:37,499 INFO L226 Difference]: Without dead ends: 36537 [2019-12-28 03:57:37,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-28 03:57:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36537 states. [2019-12-28 03:57:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36537 to 36212. [2019-12-28 03:57:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36212 states. [2019-12-28 03:57:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36212 states to 36212 states and 81444 transitions. [2019-12-28 03:57:38,111 INFO L78 Accepts]: Start accepts. Automaton has 36212 states and 81444 transitions. Word has length 114 [2019-12-28 03:57:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:38,111 INFO L462 AbstractCegarLoop]: Abstraction has 36212 states and 81444 transitions. [2019-12-28 03:57:38,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:57:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 36212 states and 81444 transitions. [2019-12-28 03:57:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:38,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:38,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:38,156 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:38,156 INFO L82 PathProgramCache]: Analyzing trace with hash -665885578, now seen corresponding path program 1 times [2019-12-28 03:57:38,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:38,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779794886] [2019-12-28 03:57:38,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:38,281 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-28 03:57:38,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779794886] [2019-12-28 03:57:38,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:38,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:38,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545763889] [2019-12-28 03:57:38,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:38,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:38,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 217 transitions. [2019-12-28 03:57:38,411 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:38,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:57:38,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:57:38,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:38,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:57:38,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:57:38,515 INFO L87 Difference]: Start difference. First operand 36212 states and 81444 transitions. Second operand 10 states. [2019-12-28 03:57:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:39,454 INFO L93 Difference]: Finished difference Result 43152 states and 96712 transitions. [2019-12-28 03:57:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:57:39,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-12-28 03:57:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:39,502 INFO L225 Difference]: With dead ends: 43152 [2019-12-28 03:57:39,502 INFO L226 Difference]: Without dead ends: 43152 [2019-12-28 03:57:39,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:57:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-28 03:57:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 38168. [2019-12-28 03:57:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38168 states. [2019-12-28 03:57:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38168 states to 38168 states and 85785 transitions. [2019-12-28 03:57:39,953 INFO L78 Accepts]: Start accepts. Automaton has 38168 states and 85785 transitions. Word has length 114 [2019-12-28 03:57:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:39,953 INFO L462 AbstractCegarLoop]: Abstraction has 38168 states and 85785 transitions. [2019-12-28 03:57:39,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:57:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38168 states and 85785 transitions. [2019-12-28 03:57:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:39,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:39,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:39,987 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1079723378, now seen corresponding path program 1 times [2019-12-28 03:57:39,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:39,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640949154] [2019-12-28 03:57:39,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:40,080 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-28 03:57:40,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640949154] [2019-12-28 03:57:40,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:40,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:40,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [509508131] [2019-12-28 03:57:40,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:40,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:40,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 436 transitions. [2019-12-28 03:57:40,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:40,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:57:40,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:57:40,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:40,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:57:40,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:57:40,485 INFO L87 Difference]: Start difference. First operand 38168 states and 85785 transitions. Second operand 10 states. [2019-12-28 03:57:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:41,420 INFO L93 Difference]: Finished difference Result 42695 states and 96030 transitions. [2019-12-28 03:57:41,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:57:41,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-12-28 03:57:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:41,467 INFO L225 Difference]: With dead ends: 42695 [2019-12-28 03:57:41,467 INFO L226 Difference]: Without dead ends: 42695 [2019-12-28 03:57:41,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:57:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42695 states. [2019-12-28 03:57:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42695 to 37760. [2019-12-28 03:57:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37760 states. [2019-12-28 03:57:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37760 states to 37760 states and 84875 transitions. [2019-12-28 03:57:41,912 INFO L78 Accepts]: Start accepts. Automaton has 37760 states and 84875 transitions. Word has length 114 [2019-12-28 03:57:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:41,912 INFO L462 AbstractCegarLoop]: Abstraction has 37760 states and 84875 transitions. [2019-12-28 03:57:41,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:57:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 37760 states and 84875 transitions. [2019-12-28 03:57:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:41,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:41,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:41,945 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash 598555036, now seen corresponding path program 2 times [2019-12-28 03:57:41,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:41,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714533032] [2019-12-28 03:57:41,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:42,072 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-28 03:57:42,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714533032] [2019-12-28 03:57:42,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:42,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:42,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755412847] [2019-12-28 03:57:42,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:42,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:42,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 226 transitions. [2019-12-28 03:57:42,198 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:42,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:57:42,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:57:42,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:42,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:57:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:57:42,290 INFO L87 Difference]: Start difference. First operand 37760 states and 84875 transitions. Second operand 11 states. [2019-12-28 03:57:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:43,271 INFO L93 Difference]: Finished difference Result 44753 states and 100451 transitions. [2019-12-28 03:57:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:57:43,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2019-12-28 03:57:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:43,321 INFO L225 Difference]: With dead ends: 44753 [2019-12-28 03:57:43,321 INFO L226 Difference]: Without dead ends: 44753 [2019-12-28 03:57:43,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:57:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44753 states. [2019-12-28 03:57:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44753 to 36776. [2019-12-28 03:57:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36776 states. [2019-12-28 03:57:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36776 states to 36776 states and 82720 transitions. [2019-12-28 03:57:43,796 INFO L78 Accepts]: Start accepts. Automaton has 36776 states and 82720 transitions. Word has length 114 [2019-12-28 03:57:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:43,796 INFO L462 AbstractCegarLoop]: Abstraction has 36776 states and 82720 transitions. [2019-12-28 03:57:43,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:57:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36776 states and 82720 transitions. [2019-12-28 03:57:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:43,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:43,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:43,829 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:43,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash -432842779, now seen corresponding path program 4 times [2019-12-28 03:57:43,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:43,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095277818] [2019-12-28 03:57:43,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:43,978 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-28 03:57:43,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095277818] [2019-12-28 03:57:43,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:43,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:57:43,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604008733] [2019-12-28 03:57:43,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:44,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:44,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 262 transitions. [2019-12-28 03:57:44,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:44,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 03:57:44,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 03:57:44,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 03:57:44,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:57:44,505 INFO L87 Difference]: Start difference. First operand 36776 states and 82720 transitions. Second operand 13 states. [2019-12-28 03:57:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:46,011 INFO L93 Difference]: Finished difference Result 49895 states and 112826 transitions. [2019-12-28 03:57:46,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:57:46,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2019-12-28 03:57:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:46,067 INFO L225 Difference]: With dead ends: 49895 [2019-12-28 03:57:46,067 INFO L226 Difference]: Without dead ends: 49895 [2019-12-28 03:57:46,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:57:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49895 states. [2019-12-28 03:57:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49895 to 36488. [2019-12-28 03:57:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36488 states. [2019-12-28 03:57:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36488 states to 36488 states and 82124 transitions. [2019-12-28 03:57:46,552 INFO L78 Accepts]: Start accepts. Automaton has 36488 states and 82124 transitions. Word has length 114 [2019-12-28 03:57:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:46,552 INFO L462 AbstractCegarLoop]: Abstraction has 36488 states and 82124 transitions. [2019-12-28 03:57:46,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 03:57:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36488 states and 82124 transitions. [2019-12-28 03:57:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:46,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:46,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:46,583 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash -977113266, now seen corresponding path program 2 times [2019-12-28 03:57:46,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:46,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821265939] [2019-12-28 03:57:46,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:46,642 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-28 03:57:46,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821265939] [2019-12-28 03:57:46,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:46,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:57:46,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [938052762] [2019-12-28 03:57:46,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:46,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:46,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 402 transitions. [2019-12-28 03:57:46,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:47,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:57:47,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:57:47,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:57:47,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:57:47,001 INFO L87 Difference]: Start difference. First operand 36488 states and 82124 transitions. Second operand 8 states. [2019-12-28 03:57:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:47,831 INFO L93 Difference]: Finished difference Result 37234 states and 82968 transitions. [2019-12-28 03:57:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:57:47,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-28 03:57:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:47,870 INFO L225 Difference]: With dead ends: 37234 [2019-12-28 03:57:47,871 INFO L226 Difference]: Without dead ends: 37234 [2019-12-28 03:57:47,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:57:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37234 states. [2019-12-28 03:57:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37234 to 33544. [2019-12-28 03:57:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33544 states. [2019-12-28 03:57:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33544 states to 33544 states and 74911 transitions. [2019-12-28 03:57:48,428 INFO L78 Accepts]: Start accepts. Automaton has 33544 states and 74911 transitions. Word has length 114 [2019-12-28 03:57:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:48,428 INFO L462 AbstractCegarLoop]: Abstraction has 33544 states and 74911 transitions. [2019-12-28 03:57:48,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:57:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33544 states and 74911 transitions. [2019-12-28 03:57:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-28 03:57:48,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:48,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:48,459 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 448032188, now seen corresponding path program 3 times [2019-12-28 03:57:48,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:48,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474525979] [2019-12-28 03:57:48,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:48,529 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-28 03:57:48,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474525979] [2019-12-28 03:57:48,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:48,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:57:48,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2136629254] [2019-12-28 03:57:48,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:48,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:48,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 284 transitions. [2019-12-28 03:57:48,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:48,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:57:48,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:57:48,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:48,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:57:48,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:57:48,875 INFO L87 Difference]: Start difference. First operand 33544 states and 74911 transitions. Second operand 9 states. [2019-12-28 03:57:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:57:51,637 INFO L93 Difference]: Finished difference Result 46542 states and 102888 transitions. [2019-12-28 03:57:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 03:57:51,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-12-28 03:57:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:57:51,690 INFO L225 Difference]: With dead ends: 46542 [2019-12-28 03:57:51,690 INFO L226 Difference]: Without dead ends: 46506 [2019-12-28 03:57:51,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-12-28 03:57:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46506 states. [2019-12-28 03:57:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46506 to 35378. [2019-12-28 03:57:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35378 states. [2019-12-28 03:57:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35378 states to 35378 states and 78809 transitions. [2019-12-28 03:57:52,192 INFO L78 Accepts]: Start accepts. Automaton has 35378 states and 78809 transitions. Word has length 114 [2019-12-28 03:57:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:57:52,193 INFO L462 AbstractCegarLoop]: Abstraction has 35378 states and 78809 transitions. [2019-12-28 03:57:52,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:57:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 35378 states and 78809 transitions. [2019-12-28 03:57:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-28 03:57:52,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:57:52,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:57:52,225 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:57:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:57:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1850989116, now seen corresponding path program 1 times [2019-12-28 03:57:52,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:57:52,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392512790] [2019-12-28 03:57:52,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:57:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:57:52,376 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-28 03:57:52,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392512790] [2019-12-28 03:57:52,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:57:52,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 03:57:52,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983509718] [2019-12-28 03:57:52,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:57:52,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:57:52,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 476 transitions. [2019-12-28 03:57:52,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:57:52,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-28 03:57:52,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-28 03:57:52,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:57:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-28 03:57:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:57:52,963 INFO L87 Difference]: Start difference. First operand 35378 states and 78809 transitions. Second operand 17 states. Received shutdown request... [2019-12-28 03:57:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:57:53,692 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 03:57:53,698 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 03:57:53,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:57:53 BasicIcfg [2019-12-28 03:57:53,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:57:53,701 INFO L168 Benchmark]: Toolchain (without parser) took 193690.49 ms. Allocated memory was 146.3 MB in the beginning and 5.4 GB in the end (delta: 5.2 GB). Free memory was 100.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,701 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.95 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 155.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.63 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,702 INFO L168 Benchmark]: Boogie Preprocessor took 60.28 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,702 INFO L168 Benchmark]: RCFGBuilder took 871.76 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 93.9 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,703 INFO L168 Benchmark]: TraceAbstraction took 191922.39 ms. Allocated memory was 203.9 MB in the beginning and 5.4 GB in the end (delta: 5.2 GB). Free memory was 93.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-12-28 03:57:53,705 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.95 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 155.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.63 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.28 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.76 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 93.9 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191922.39 ms. Allocated memory was 203.9 MB in the beginning and 5.4 GB in the end (delta: 5.2 GB). Free memory was 93.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (35378states) and FLOYD_HOARE automaton (currently 15 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (652 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 (35378states) and FLOYD_HOARE automaton (currently 15 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (652 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: TIMEOUT, OverallTime: 191.6s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 77.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 19053 SDtfs, 25316 SDslu, 51842 SDs, 0 SdLazy, 24297 SolverSat, 1237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 291 SyntacticMatches, 55 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278543occurred 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: 86.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 392112 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3874 NumberOfCodeBlocks, 3874 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3831 ConstructedInterpolants, 0 QuantifiedInterpolants, 888033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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