/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:28:56,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:28:56,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:28:56,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:28:56,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:28:56,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:28:56,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:28:56,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:28:56,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:28:56,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:28:56,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:28:56,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:28:56,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:28:56,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:28:56,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:28:56,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:28:56,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:28:56,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:28:56,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:28:56,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:28:56,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:28:56,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:28:56,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:28:56,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:28:56,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:28:56,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:28:56,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:28:56,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:28:56,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:28:56,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:28:56,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:28:56,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:28:56,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:28:56,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:28:56,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:28:56,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:28:56,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:28:56,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:28:56,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:28:56,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:28:56,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:28:56,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:28:56,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:28:56,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:28:56,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:28:56,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:28:56,838 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:28:56,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:28:56,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:28:56,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:28:56,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:28:56,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:28:56,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:28:56,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:28:56,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:28:56,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:28:56,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:28:56,840 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:28:56,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:28:56,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:28:56,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:28:56,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:28:56,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:28:56,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:28:56,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:28:56,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:28:56,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:28:56,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:28:56,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:28:56,842 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:28:56,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:28:56,843 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:28:56,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:28:57,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:28:57,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:28:57,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:28:57,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:28:57,141 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:28:57,142 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-27 18:28:57,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead84d7c8/bb3b0d618e51402e948206831332766c/FLAG7eb14f806 [2019-12-27 18:28:57,772 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:28:57,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-27 18:28:57,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead84d7c8/bb3b0d618e51402e948206831332766c/FLAG7eb14f806 [2019-12-27 18:28:58,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead84d7c8/bb3b0d618e51402e948206831332766c [2019-12-27 18:28:58,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:28:58,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:28:58,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:28:58,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:28:58,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:28:58,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:58,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113399e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58, skipping insertion in model container [2019-12-27 18:28:58,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:58,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:28:58,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:28:58,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:28:58,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:28:58,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:28:58,931 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:28:58,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58 WrapperNode [2019-12-27 18:28:58,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:28:58,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:28:58,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:28:58,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:28:58,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:58,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:28:59,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:28:59,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:28:59,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:28:59,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... [2019-12-27 18:28:59,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:28:59,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:28:59,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:28:59,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:28:59,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:28:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:28:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:28:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:28:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:28:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:28:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:28:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:28:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:28:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:28:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:28:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:28:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:28:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:28:59,144 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:29:00,118 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:29:00,120 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:29:00,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:00 BoogieIcfgContainer [2019-12-27 18:29:00,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:29:00,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:29:00,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:29:00,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:29:00,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:28:58" (1/3) ... [2019-12-27 18:29:00,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d03d40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:00, skipping insertion in model container [2019-12-27 18:29:00,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:58" (2/3) ... [2019-12-27 18:29:00,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d03d40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:00, skipping insertion in model container [2019-12-27 18:29:00,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:00" (3/3) ... [2019-12-27 18:29:00,135 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2019-12-27 18:29:00,146 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:29:00,147 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:29:00,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:29:00,158 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:29:00,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,270 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,270 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:00,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:29:00,323 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:29:00,323 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:29:00,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:29:00,323 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:29:00,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:29:00,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:29:00,324 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:29:00,324 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:29:00,341 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 18:29:00,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:29:00,448 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:29:00,449 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:29:00,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:29:00,495 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:29:00,551 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:29:00,551 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:29:00,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:29:00,582 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 18:29:00,583 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:29:06,154 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:29:06,274 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:29:06,631 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 18:29:06,631 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 18:29:06,635 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 18:29:24,696 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 18:29:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 18:29:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:29:24,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:29:24,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:29:24,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:29:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:29:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 18:29:24,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:29:24,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695851094] [2019-12-27 18:29:24,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:29:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:29:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:29:24,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695851094] [2019-12-27 18:29:24,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:29:24,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:29:24,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074241453] [2019-12-27 18:29:24,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:29:24,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:29:24,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:29:24,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:29:24,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:29:24,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:29:24,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:29:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:29:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:29:24,989 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 18:29:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:29:29,165 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 18:29:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:29:29,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:29:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:29:29,850 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 18:29:29,851 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 18:29:29,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:29:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 18:29:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 18:29:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 18:29:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 18:29:36,559 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 18:29:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:29:36,560 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 18:29:36,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:29:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 18:29:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:29:36,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:29:36,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:29:36,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:29:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:29:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 18:29:36,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:29:36,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362651012] [2019-12-27 18:29:36,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:29:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:29:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:29:36,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362651012] [2019-12-27 18:29:36,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:29:36,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:29:36,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1042904412] [2019-12-27 18:29:36,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:29:36,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:29:36,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:29:36,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:29:36,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:29:36,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:29:36,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:29:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:29:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:29:36,721 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 18:29:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:29:41,389 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 18:29:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:29:41,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:29:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:29:42,156 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 18:29:42,156 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 18:29:42,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:29:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 18:29:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 18:29:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 18:29:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 18:29:57,471 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 18:29:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:29:57,472 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 18:29:57,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:29:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 18:29:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:29:57,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:29:57,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:29:57,480 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:29:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:29:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 18:29:57,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:29:57,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649392310] [2019-12-27 18:29:57,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:29:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:29:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:29:57,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649392310] [2019-12-27 18:29:57,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:29:57,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:29:57,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [622899720] [2019-12-27 18:29:57,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:29:57,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:29:57,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:29:57,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:29:57,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:29:57,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:29:57,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:29:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:29:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:29:57,575 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 18:29:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:29:57,713 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 18:29:57,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:29:57,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:29:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:29:57,789 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 18:29:57,789 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 18:29:57,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:29:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 18:29:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 18:29:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 18:29:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 18:29:58,404 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 18:29:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:29:58,405 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 18:29:58,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:29:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 18:29:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 18:29:58,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:29:58,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:29:58,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:29:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:29:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 18:29:58,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:29:58,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575545658] [2019-12-27 18:29:58,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:29:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:29:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:29:58,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575545658] [2019-12-27 18:29:58,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:29:58,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:29:58,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261219731] [2019-12-27 18:29:58,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:29:58,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:29:58,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 18:29:58,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:29:58,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:29:58,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:29:58,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:29:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:29:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:29:58,502 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 18:30:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:00,251 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 18:30:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:30:00,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 18:30:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:00,348 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 18:30:00,348 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 18:30:00,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:30:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 18:30:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 18:30:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 18:30:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 18:30:01,108 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 18:30:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:01,109 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 18:30:01,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:30:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 18:30:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:30:01,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:01,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:01,119 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 18:30:01,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:01,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602699350] [2019-12-27 18:30:01,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:01,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-27 18:30:01,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602699350] [2019-12-27 18:30:01,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:01,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:30:01,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580347370] [2019-12-27 18:30:01,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:01,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:01,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 18:30:01,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:01,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:01,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:30:01,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:30:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:30:01,233 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 18:30:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:02,185 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 18:30:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:30:02,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:30:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:02,304 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 18:30:02,304 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 18:30:02,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:30:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 18:30:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 18:30:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 18:30:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 18:30:05,403 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 18:30:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:05,403 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 18:30:05,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:30:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 18:30:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:30:05,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:05,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:05,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:05,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 18:30:05,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:05,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829079598] [2019-12-27 18:30:05,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:05,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829079598] [2019-12-27 18:30:05,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:05,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:05,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1112517310] [2019-12-27 18:30:05,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:05,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:05,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:30:05,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:05,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:30:05,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:30:05,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:30:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:05,539 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 5 states. [2019-12-27 18:30:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:05,627 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 18:30:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:30:05,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:30:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:05,650 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 18:30:05,650 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 18:30:05,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 18:30:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 18:30:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 18:30:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 18:30:05,921 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 18:30:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:05,921 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 18:30:05,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:30:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 18:30:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 18:30:05,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:05,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:05,932 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 18:30:05,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:05,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331371516] [2019-12-27 18:30:05,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:06,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331371516] [2019-12-27 18:30:06,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:06,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:30:06,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922907986] [2019-12-27 18:30:06,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:06,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:06,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 18:30:06,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:06,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:06,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:30:06,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:06,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:30:06,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:30:06,042 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 18:30:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:06,597 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 18:30:06,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:30:06,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 18:30:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:06,633 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 18:30:06,633 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 18:30:06,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:30:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 18:30:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 18:30:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 18:30:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 18:30:07,224 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 18:30:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:07,224 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 18:30:07,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:30:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 18:30:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 18:30:07,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:07,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] [2019-12-27 18:30:07,242 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 18:30:07,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:07,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410455231] [2019-12-27 18:30:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:07,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410455231] [2019-12-27 18:30:07,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:07,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:30:07,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163280008] [2019-12-27 18:30:07,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:07,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:07,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 18:30:07,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:07,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:07,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:30:07,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:30:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:30:07,429 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 8 states. [2019-12-27 18:30:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:08,665 INFO L93 Difference]: Finished difference Result 24561 states and 72020 transitions. [2019-12-27 18:30:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:30:08,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 18:30:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:08,699 INFO L225 Difference]: With dead ends: 24561 [2019-12-27 18:30:08,699 INFO L226 Difference]: Without dead ends: 24561 [2019-12-27 18:30:08,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:30:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-27 18:30:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 17437. [2019-12-27 18:30:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-12-27 18:30:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 52503 transitions. [2019-12-27 18:30:09,002 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 52503 transitions. Word has length 33 [2019-12-27 18:30:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:09,003 INFO L462 AbstractCegarLoop]: Abstraction has 17437 states and 52503 transitions. [2019-12-27 18:30:09,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:30:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 52503 transitions. [2019-12-27 18:30:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 18:30:09,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:09,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:09,021 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash -147828206, now seen corresponding path program 2 times [2019-12-27 18:30:09,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:09,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345097103] [2019-12-27 18:30:09,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:09,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345097103] [2019-12-27 18:30:09,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:09,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:30:09,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907731226] [2019-12-27 18:30:09,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:09,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:09,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 85 transitions. [2019-12-27 18:30:09,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:09,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:09,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:30:09,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:30:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:30:09,135 INFO L87 Difference]: Start difference. First operand 17437 states and 52503 transitions. Second operand 7 states. [2019-12-27 18:30:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:10,359 INFO L93 Difference]: Finished difference Result 24299 states and 71228 transitions. [2019-12-27 18:30:10,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:30:10,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 18:30:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:10,393 INFO L225 Difference]: With dead ends: 24299 [2019-12-27 18:30:10,393 INFO L226 Difference]: Without dead ends: 24299 [2019-12-27 18:30:10,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:30:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-27 18:30:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 16666. [2019-12-27 18:30:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 18:30:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 18:30:10,940 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 18:30:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:10,940 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 18:30:10,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:30:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 18:30:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:30:10,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:10,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:10,960 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 18:30:10,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:10,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088573922] [2019-12-27 18:30:10,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:11,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088573922] [2019-12-27 18:30:11,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:11,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:30:11,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970984832] [2019-12-27 18:30:11,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:11,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:11,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 18:30:11,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:11,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:11,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:11,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:11,108 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-27 18:30:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:11,185 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-27 18:30:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:11,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 18:30:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:11,219 INFO L225 Difference]: With dead ends: 16665 [2019-12-27 18:30:11,219 INFO L226 Difference]: Without dead ends: 16665 [2019-12-27 18:30:11,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-27 18:30:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-27 18:30:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-27 18:30:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-27 18:30:11,573 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-27 18:30:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:11,573 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-27 18:30:11,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-27 18:30:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:30:11,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:11,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:11,597 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-27 18:30:11,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:11,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777164873] [2019-12-27 18:30:11,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:11,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777164873] [2019-12-27 18:30:11,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:11,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:11,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [516330478] [2019-12-27 18:30:11,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:11,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:11,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 198 transitions. [2019-12-27 18:30:11,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:11,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:30:11,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:30:11,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:30:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:30:11,734 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-27 18:30:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:11,872 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-27 18:30:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:30:11,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 18:30:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:11,903 INFO L225 Difference]: With dead ends: 31503 [2019-12-27 18:30:11,903 INFO L226 Difference]: Without dead ends: 16332 [2019-12-27 18:30:11,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-27 18:30:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-27 18:30:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-27 18:30:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-27 18:30:12,361 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-27 18:30:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:12,361 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-27 18:30:12,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:30:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-27 18:30:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:30:12,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:12,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:12,391 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-27 18:30:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41770056] [2019-12-27 18:30:12,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:12,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41770056] [2019-12-27 18:30:12,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:12,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:30:12,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535754107] [2019-12-27 18:30:12,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:12,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:12,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 324 transitions. [2019-12-27 18:30:12,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:12,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:30:12,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:30:12,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:30:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:30:12,814 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 11 states. [2019-12-27 18:30:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:14,230 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-27 18:30:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:30:14,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 18:30:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:14,262 INFO L225 Difference]: With dead ends: 22499 [2019-12-27 18:30:14,263 INFO L226 Difference]: Without dead ends: 22499 [2019-12-27 18:30:14,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:30:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-27 18:30:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-27 18:30:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-27 18:30:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-27 18:30:14,578 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-27 18:30:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:14,578 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-27 18:30:14,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:30:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-27 18:30:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:30:14,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:14,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:14,599 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:14,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:14,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-27 18:30:14,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:14,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374902898] [2019-12-27 18:30:14,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:14,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374902898] [2019-12-27 18:30:14,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:14,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:30:14,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368877309] [2019-12-27 18:30:14,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:14,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:14,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 365 transitions. [2019-12-27 18:30:14,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:14,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:30:14,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:30:14,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:30:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:30:14,766 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 7 states. [2019-12-27 18:30:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:14,880 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-27 18:30:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:30:14,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 18:30:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:14,914 INFO L225 Difference]: With dead ends: 19781 [2019-12-27 18:30:14,914 INFO L226 Difference]: Without dead ends: 19287 [2019-12-27 18:30:14,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:30:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-27 18:30:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-27 18:30:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-27 18:30:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-27 18:30:15,215 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-27 18:30:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:15,216 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-27 18:30:15,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:30:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-27 18:30:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:15,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:15,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:15,245 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-27 18:30:15,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:15,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072353201] [2019-12-27 18:30:15,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:15,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072353201] [2019-12-27 18:30:15,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:15,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:15,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500219547] [2019-12-27 18:30:15,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:15,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:15,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 18:30:15,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:15,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:30:15,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:15,700 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-27 18:30:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:15,809 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-27 18:30:15,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:15,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:30:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:15,846 INFO L225 Difference]: With dead ends: 27408 [2019-12-27 18:30:15,846 INFO L226 Difference]: Without dead ends: 27408 [2019-12-27 18:30:15,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-27 18:30:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-27 18:30:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-27 18:30:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-27 18:30:16,198 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-27 18:30:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:16,199 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-27 18:30:16,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-27 18:30:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:16,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:16,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:16,229 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-27 18:30:16,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:16,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770942793] [2019-12-27 18:30:16,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:16,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770942793] [2019-12-27 18:30:16,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:16,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:30:16,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [545391026] [2019-12-27 18:30:16,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:16,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:16,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 440 transitions. [2019-12-27 18:30:16,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:16,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:30:16,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:30:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:30:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:30:16,683 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 11 states. [2019-12-27 18:30:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:17,423 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-27 18:30:17,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:30:17,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 18:30:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:17,485 INFO L225 Difference]: With dead ends: 61323 [2019-12-27 18:30:17,485 INFO L226 Difference]: Without dead ends: 42147 [2019-12-27 18:30:17,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:30:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-27 18:30:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-27 18:30:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-27 18:30:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-27 18:30:18,186 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-27 18:30:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:18,186 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-27 18:30:18,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:30:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-27 18:30:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:18,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:18,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:18,218 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:18,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-27 18:30:18,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:18,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067145860] [2019-12-27 18:30:18,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:18,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-27 18:30:18,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067145860] [2019-12-27 18:30:18,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:18,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:30:18,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142283949] [2019-12-27 18:30:18,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:18,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:18,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 18:30:18,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:18,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:30:18,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:30:18,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:30:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:30:18,729 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 10 states. [2019-12-27 18:30:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:20,694 INFO L93 Difference]: Finished difference Result 128757 states and 391175 transitions. [2019-12-27 18:30:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:30:20,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 18:30:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:20,959 INFO L225 Difference]: With dead ends: 128757 [2019-12-27 18:30:20,960 INFO L226 Difference]: Without dead ends: 99708 [2019-12-27 18:30:20,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:30:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99708 states. [2019-12-27 18:30:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99708 to 27716. [2019-12-27 18:30:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-27 18:30:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-27 18:30:22,305 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-27 18:30:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:22,305 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-27 18:30:22,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:30:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-27 18:30:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:22,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:22,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:22,334 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-27 18:30:22,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784132146] [2019-12-27 18:30:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:22,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784132146] [2019-12-27 18:30:22,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:22,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:30:22,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199660128] [2019-12-27 18:30:22,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:22,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:22,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 444 transitions. [2019-12-27 18:30:22,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:22,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:30:22,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:30:22,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:30:22,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:30:22,787 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 11 states. [2019-12-27 18:30:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:25,152 INFO L93 Difference]: Finished difference Result 79547 states and 242842 transitions. [2019-12-27 18:30:25,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:30:25,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 18:30:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:25,254 INFO L225 Difference]: With dead ends: 79547 [2019-12-27 18:30:25,254 INFO L226 Difference]: Without dead ends: 70269 [2019-12-27 18:30:25,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:30:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70269 states. [2019-12-27 18:30:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70269 to 28024. [2019-12-27 18:30:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-27 18:30:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-27 18:30:25,996 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-27 18:30:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:25,996 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-27 18:30:25,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:30:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-27 18:30:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:26,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:26,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:26,025 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-27 18:30:26,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:26,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551767029] [2019-12-27 18:30:26,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:26,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551767029] [2019-12-27 18:30:26,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:26,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:26,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7717217] [2019-12-27 18:30:26,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:26,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:26,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 307 transitions. [2019-12-27 18:30:26,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:26,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:26,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:26,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:26,302 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-27 18:30:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:26,448 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-27 18:30:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:26,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:30:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:26,495 INFO L225 Difference]: With dead ends: 33789 [2019-12-27 18:30:26,495 INFO L226 Difference]: Without dead ends: 33789 [2019-12-27 18:30:26,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-27 18:30:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-27 18:30:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-27 18:30:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-27 18:30:27,227 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-27 18:30:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:27,227 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-27 18:30:27,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-27 18:30:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:27,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:27,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:27,268 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-27 18:30:27,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:27,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848343437] [2019-12-27 18:30:27,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:27,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848343437] [2019-12-27 18:30:27,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:27,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:30:27,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20616937] [2019-12-27 18:30:27,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:27,351 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:27,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 18:30:27,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:27,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:30:27,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:30:27,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:30:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:30:27,672 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-27 18:30:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:28,008 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-27 18:30:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:30:28,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 18:30:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:28,077 INFO L225 Difference]: With dead ends: 45817 [2019-12-27 18:30:28,077 INFO L226 Difference]: Without dead ends: 45817 [2019-12-27 18:30:28,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-27 18:30:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-27 18:30:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-27 18:30:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-27 18:30:28,673 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-27 18:30:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:28,674 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-27 18:30:28,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:30:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-27 18:30:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:28,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:28,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:28,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-27 18:30:28,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:28,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852529450] [2019-12-27 18:30:28,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:28,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852529450] [2019-12-27 18:30:28,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:28,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:30:28,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634412435] [2019-12-27 18:30:28,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:28,810 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:29,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 470 transitions. [2019-12-27 18:30:29,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:29,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 18:30:29,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:30:29,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:30:29,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:30:29,368 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 12 states. [2019-12-27 18:30:31,723 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-27 18:30:32,451 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-27 18:30:33,552 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 18:30:33,872 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 18:30:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:35,058 INFO L93 Difference]: Finished difference Result 176351 states and 542548 transitions. [2019-12-27 18:30:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 18:30:35,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 18:30:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:35,705 INFO L225 Difference]: With dead ends: 176351 [2019-12-27 18:30:35,705 INFO L226 Difference]: Without dead ends: 135201 [2019-12-27 18:30:35,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=583, Invalid=2173, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 18:30:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135201 states. [2019-12-27 18:30:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135201 to 36528. [2019-12-27 18:30:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36528 states. [2019-12-27 18:30:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36528 states to 36528 states and 115782 transitions. [2019-12-27 18:30:36,976 INFO L78 Accepts]: Start accepts. Automaton has 36528 states and 115782 transitions. Word has length 65 [2019-12-27 18:30:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:36,976 INFO L462 AbstractCegarLoop]: Abstraction has 36528 states and 115782 transitions. [2019-12-27 18:30:36,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:30:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 36528 states and 115782 transitions. [2019-12-27 18:30:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:37,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:37,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:37,018 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-27 18:30:37,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:37,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009105877] [2019-12-27 18:30:37,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:37,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009105877] [2019-12-27 18:30:37,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:37,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:37,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298480685] [2019-12-27 18:30:37,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:37,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:37,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 309 transitions. [2019-12-27 18:30:37,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:37,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:37,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:37,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:37,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:37,288 INFO L87 Difference]: Start difference. First operand 36528 states and 115782 transitions. Second operand 3 states. [2019-12-27 18:30:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:37,552 INFO L93 Difference]: Finished difference Result 48794 states and 153716 transitions. [2019-12-27 18:30:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:37,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:30:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:37,630 INFO L225 Difference]: With dead ends: 48794 [2019-12-27 18:30:37,630 INFO L226 Difference]: Without dead ends: 48794 [2019-12-27 18:30:37,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48794 states. [2019-12-27 18:30:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48794 to 36605. [2019-12-27 18:30:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36605 states. [2019-12-27 18:30:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36605 states to 36605 states and 116125 transitions. [2019-12-27 18:30:38,534 INFO L78 Accepts]: Start accepts. Automaton has 36605 states and 116125 transitions. Word has length 65 [2019-12-27 18:30:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:38,534 INFO L462 AbstractCegarLoop]: Abstraction has 36605 states and 116125 transitions. [2019-12-27 18:30:38,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 36605 states and 116125 transitions. [2019-12-27 18:30:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:38,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:38,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:38,577 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-27 18:30:38,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:38,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502544123] [2019-12-27 18:30:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:38,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502544123] [2019-12-27 18:30:38,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:38,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:30:38,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441491416] [2019-12-27 18:30:38,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:38,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:38,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 332 transitions. [2019-12-27 18:30:38,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:39,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:30:39,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:30:39,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:39,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:30:39,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:30:39,035 INFO L87 Difference]: Start difference. First operand 36605 states and 116125 transitions. Second operand 12 states. [2019-12-27 18:30:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:41,638 INFO L93 Difference]: Finished difference Result 93704 states and 292312 transitions. [2019-12-27 18:30:41,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 18:30:41,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 18:30:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:41,789 INFO L225 Difference]: With dead ends: 93704 [2019-12-27 18:30:41,790 INFO L226 Difference]: Without dead ends: 93704 [2019-12-27 18:30:41,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:30:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93704 states. [2019-12-27 18:30:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93704 to 39400. [2019-12-27 18:30:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39400 states. [2019-12-27 18:30:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39400 states to 39400 states and 124815 transitions. [2019-12-27 18:30:43,194 INFO L78 Accepts]: Start accepts. Automaton has 39400 states and 124815 transitions. Word has length 65 [2019-12-27 18:30:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:43,195 INFO L462 AbstractCegarLoop]: Abstraction has 39400 states and 124815 transitions. [2019-12-27 18:30:43,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:30:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39400 states and 124815 transitions. [2019-12-27 18:30:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:43,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:43,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] [2019-12-27 18:30:43,240 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-27 18:30:43,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:43,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882046805] [2019-12-27 18:30:43,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:43,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882046805] [2019-12-27 18:30:43,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:43,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:30:43,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171073798] [2019-12-27 18:30:43,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:43,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:43,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 18:30:43,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:43,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:30:43,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:30:43,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:30:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:43,586 INFO L87 Difference]: Start difference. First operand 39400 states and 124815 transitions. Second operand 5 states. [2019-12-27 18:30:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:44,446 INFO L93 Difference]: Finished difference Result 58405 states and 180549 transitions. [2019-12-27 18:30:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:30:44,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 18:30:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:44,542 INFO L225 Difference]: With dead ends: 58405 [2019-12-27 18:30:44,542 INFO L226 Difference]: Without dead ends: 58185 [2019-12-27 18:30:44,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:30:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58185 states. [2019-12-27 18:30:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58185 to 45891. [2019-12-27 18:30:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45891 states. [2019-12-27 18:30:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45891 states to 45891 states and 144960 transitions. [2019-12-27 18:30:45,679 INFO L78 Accepts]: Start accepts. Automaton has 45891 states and 144960 transitions. Word has length 65 [2019-12-27 18:30:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:45,680 INFO L462 AbstractCegarLoop]: Abstraction has 45891 states and 144960 transitions. [2019-12-27 18:30:45,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:30:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45891 states and 144960 transitions. [2019-12-27 18:30:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:45,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:45,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:45,735 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:45,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-27 18:30:45,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:45,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041456611] [2019-12-27 18:30:45,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:45,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041456611] [2019-12-27 18:30:45,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:45,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:45,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602461616] [2019-12-27 18:30:45,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:45,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:46,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 18:30:46,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:46,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:46,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:46,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:46,050 INFO L87 Difference]: Start difference. First operand 45891 states and 144960 transitions. Second operand 3 states. [2019-12-27 18:30:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:46,293 INFO L93 Difference]: Finished difference Result 45891 states and 144959 transitions. [2019-12-27 18:30:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:46,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:30:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:46,397 INFO L225 Difference]: With dead ends: 45891 [2019-12-27 18:30:46,397 INFO L226 Difference]: Without dead ends: 45891 [2019-12-27 18:30:46,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45891 states. [2019-12-27 18:30:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45891 to 40039. [2019-12-27 18:30:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40039 states. [2019-12-27 18:30:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40039 states to 40039 states and 128485 transitions. [2019-12-27 18:30:47,172 INFO L78 Accepts]: Start accepts. Automaton has 40039 states and 128485 transitions. Word has length 65 [2019-12-27 18:30:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:47,173 INFO L462 AbstractCegarLoop]: Abstraction has 40039 states and 128485 transitions. [2019-12-27 18:30:47,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 40039 states and 128485 transitions. [2019-12-27 18:30:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:30:47,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:47,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:47,221 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-27 18:30:47,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:47,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650461847] [2019-12-27 18:30:47,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:47,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650461847] [2019-12-27 18:30:47,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:47,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:30:47,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436820703] [2019-12-27 18:30:47,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:47,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:47,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 274 transitions. [2019-12-27 18:30:47,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:47,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:30:47,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:30:47,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:47,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:30:47,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:30:47,703 INFO L87 Difference]: Start difference. First operand 40039 states and 128485 transitions. Second operand 14 states. [2019-12-27 18:30:48,591 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 18:30:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:50,870 INFO L93 Difference]: Finished difference Result 68046 states and 211900 transitions. [2019-12-27 18:30:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:30:50,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 18:30:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:50,982 INFO L225 Difference]: With dead ends: 68046 [2019-12-27 18:30:50,982 INFO L226 Difference]: Without dead ends: 67927 [2019-12-27 18:30:50,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:30:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67927 states. [2019-12-27 18:30:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67927 to 40101. [2019-12-27 18:30:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40101 states. [2019-12-27 18:30:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40101 states to 40101 states and 127820 transitions. [2019-12-27 18:30:51,894 INFO L78 Accepts]: Start accepts. Automaton has 40101 states and 127820 transitions. Word has length 66 [2019-12-27 18:30:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:51,894 INFO L462 AbstractCegarLoop]: Abstraction has 40101 states and 127820 transitions. [2019-12-27 18:30:51,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:30:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 40101 states and 127820 transitions. [2019-12-27 18:30:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:30:51,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:51,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:51,942 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-27 18:30:51,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:51,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381564536] [2019-12-27 18:30:51,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:52,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381564536] [2019-12-27 18:30:52,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:52,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:52,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130138518] [2019-12-27 18:30:52,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:52,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:52,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 266 transitions. [2019-12-27 18:30:52,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:52,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:30:52,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:52,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:52,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:52,187 INFO L87 Difference]: Start difference. First operand 40101 states and 127820 transitions. Second operand 3 states. [2019-12-27 18:30:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:52,301 INFO L93 Difference]: Finished difference Result 33585 states and 104714 transitions. [2019-12-27 18:30:52,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:52,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 18:30:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:52,350 INFO L225 Difference]: With dead ends: 33585 [2019-12-27 18:30:52,350 INFO L226 Difference]: Without dead ends: 33585 [2019-12-27 18:30:52,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33585 states. [2019-12-27 18:30:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33585 to 31957. [2019-12-27 18:30:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31957 states. [2019-12-27 18:30:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31957 states to 31957 states and 99507 transitions. [2019-12-27 18:30:53,074 INFO L78 Accepts]: Start accepts. Automaton has 31957 states and 99507 transitions. Word has length 66 [2019-12-27 18:30:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:53,074 INFO L462 AbstractCegarLoop]: Abstraction has 31957 states and 99507 transitions. [2019-12-27 18:30:53,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31957 states and 99507 transitions. [2019-12-27 18:30:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:30:53,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:53,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:53,112 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2087745019, now seen corresponding path program 1 times [2019-12-27 18:30:53,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:53,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606005089] [2019-12-27 18:30:53,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:53,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606005089] [2019-12-27 18:30:53,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:53,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:53,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532726648] [2019-12-27 18:30:53,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:53,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:53,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 315 states and 643 transitions. [2019-12-27 18:30:53,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:53,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:30:53,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:30:53,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:30:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:30:53,512 INFO L87 Difference]: Start difference. First operand 31957 states and 99507 transitions. Second operand 4 states. [2019-12-27 18:30:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:53,686 INFO L93 Difference]: Finished difference Result 31957 states and 99259 transitions. [2019-12-27 18:30:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:30:53,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 18:30:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:53,735 INFO L225 Difference]: With dead ends: 31957 [2019-12-27 18:30:53,735 INFO L226 Difference]: Without dead ends: 31957 [2019-12-27 18:30:53,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31957 states. [2019-12-27 18:30:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31957 to 26169. [2019-12-27 18:30:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26169 states. [2019-12-27 18:30:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26169 states to 26169 states and 81296 transitions. [2019-12-27 18:30:54,209 INFO L78 Accepts]: Start accepts. Automaton has 26169 states and 81296 transitions. Word has length 67 [2019-12-27 18:30:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 26169 states and 81296 transitions. [2019-12-27 18:30:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:30:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26169 states and 81296 transitions. [2019-12-27 18:30:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:30:54,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:54,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:54,239 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-27 18:30:54,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:54,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492082049] [2019-12-27 18:30:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:54,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492082049] [2019-12-27 18:30:54,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:54,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 18:30:54,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423775071] [2019-12-27 18:30:54,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:54,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:55,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 18:30:55,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:56,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 18:30:56,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 18:30:56,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 18:30:57,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 18:30:57,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:30:57,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 18:30:57,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 18:30:57,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 18:30:57,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:30:57,460 INFO L87 Difference]: Start difference. First operand 26169 states and 81296 transitions. Second operand 34 states. [2019-12-27 18:31:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:07,879 INFO L93 Difference]: Finished difference Result 45351 states and 138561 transitions. [2019-12-27 18:31:07,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-27 18:31:07,880 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 18:31:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:07,940 INFO L225 Difference]: With dead ends: 45351 [2019-12-27 18:31:07,940 INFO L226 Difference]: Without dead ends: 41379 [2019-12-27 18:31:07,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 11 SyntacticMatches, 17 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3026 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1614, Invalid=9306, Unknown=0, NotChecked=0, Total=10920 [2019-12-27 18:31:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41379 states. [2019-12-27 18:31:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41379 to 27005. [2019-12-27 18:31:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27005 states. [2019-12-27 18:31:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27005 states to 27005 states and 83587 transitions. [2019-12-27 18:31:08,599 INFO L78 Accepts]: Start accepts. Automaton has 27005 states and 83587 transitions. Word has length 67 [2019-12-27 18:31:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:08,599 INFO L462 AbstractCegarLoop]: Abstraction has 27005 states and 83587 transitions. [2019-12-27 18:31:08,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 18:31:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 27005 states and 83587 transitions. [2019-12-27 18:31:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:31:08,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:08,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:08,628 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 2 times [2019-12-27 18:31:08,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:08,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727999958] [2019-12-27 18:31:08,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:09,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727999958] [2019-12-27 18:31:09,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:09,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:31:09,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16882615] [2019-12-27 18:31:09,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:09,070 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:09,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 344 states and 711 transitions. [2019-12-27 18:31:09,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:10,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:10,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:10,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:10,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:10,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:31:11,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 18:31:11,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 18:31:11,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 18:31:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:31:11,329 INFO L87 Difference]: Start difference. First operand 27005 states and 83587 transitions. Second operand 32 states. [2019-12-27 18:31:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:25,065 INFO L93 Difference]: Finished difference Result 68431 states and 208770 transitions. [2019-12-27 18:31:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 18:31:25,066 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2019-12-27 18:31:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:25,149 INFO L225 Difference]: With dead ends: 68431 [2019-12-27 18:31:25,150 INFO L226 Difference]: Without dead ends: 54681 [2019-12-27 18:31:25,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 11 SyntacticMatches, 19 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2449 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1119, Invalid=7071, Unknown=0, NotChecked=0, Total=8190 [2019-12-27 18:31:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54681 states. [2019-12-27 18:31:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54681 to 29364. [2019-12-27 18:31:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29364 states. [2019-12-27 18:31:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29364 states to 29364 states and 90356 transitions. [2019-12-27 18:31:25,773 INFO L78 Accepts]: Start accepts. Automaton has 29364 states and 90356 transitions. Word has length 67 [2019-12-27 18:31:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:25,773 INFO L462 AbstractCegarLoop]: Abstraction has 29364 states and 90356 transitions. [2019-12-27 18:31:25,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 18:31:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29364 states and 90356 transitions. [2019-12-27 18:31:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:31:25,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:25,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:25,805 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1363751709, now seen corresponding path program 3 times [2019-12-27 18:31:25,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:25,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848980289] [2019-12-27 18:31:25,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:26,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848980289] [2019-12-27 18:31:26,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:26,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:31:26,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922661394] [2019-12-27 18:31:26,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:26,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:27,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 386 states and 816 transitions. [2019-12-27 18:31:27,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:27,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:28,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:28,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:31:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:31:28,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:31:28,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 54 times. [2019-12-27 18:31:28,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 18:31:28,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 18:31:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:31:28,996 INFO L87 Difference]: Start difference. First operand 29364 states and 90356 transitions. Second operand 34 states. [2019-12-27 18:32:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:00,517 INFO L93 Difference]: Finished difference Result 93378 states and 281584 transitions. [2019-12-27 18:32:00,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-27 18:32:00,517 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 18:32:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:00,647 INFO L225 Difference]: With dead ends: 93378 [2019-12-27 18:32:00,647 INFO L226 Difference]: Without dead ends: 85341 [2019-12-27 18:32:00,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 18 SyntacticMatches, 19 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12279 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=4354, Invalid=30802, Unknown=0, NotChecked=0, Total=35156 [2019-12-27 18:32:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85341 states. [2019-12-27 18:32:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85341 to 35118. [2019-12-27 18:32:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35118 states. [2019-12-27 18:32:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35118 states to 35118 states and 108487 transitions. [2019-12-27 18:32:01,574 INFO L78 Accepts]: Start accepts. Automaton has 35118 states and 108487 transitions. Word has length 67 [2019-12-27 18:32:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:01,574 INFO L462 AbstractCegarLoop]: Abstraction has 35118 states and 108487 transitions. [2019-12-27 18:32:01,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 18:32:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 35118 states and 108487 transitions. [2019-12-27 18:32:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:32:01,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:01,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:01,620 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 4 times [2019-12-27 18:32:01,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:01,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752864090] [2019-12-27 18:32:01,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:02,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752864090] [2019-12-27 18:32:02,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:02,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 18:32:02,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478333960] [2019-12-27 18:32:02,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:02,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:02,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 352 states and 737 transitions. [2019-12-27 18:32:02,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:03,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:03,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:32:03,946 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-27 18:32:04,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 49 times. [2019-12-27 18:32:04,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 18:32:04,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 18:32:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:32:04,329 INFO L87 Difference]: Start difference. First operand 35118 states and 108487 transitions. Second operand 33 states. [2019-12-27 18:32:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:32:17,906 INFO L93 Difference]: Finished difference Result 66317 states and 200290 transitions. [2019-12-27 18:32:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 18:32:17,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-12-27 18:32:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:32:18,001 INFO L225 Difference]: With dead ends: 66317 [2019-12-27 18:32:18,001 INFO L226 Difference]: Without dead ends: 60412 [2019-12-27 18:32:18,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 14 SyntacticMatches, 24 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1275, Invalid=7097, Unknown=0, NotChecked=0, Total=8372 [2019-12-27 18:32:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60412 states. [2019-12-27 18:32:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60412 to 35476. [2019-12-27 18:32:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35476 states. [2019-12-27 18:32:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35476 states to 35476 states and 109474 transitions. [2019-12-27 18:32:18,932 INFO L78 Accepts]: Start accepts. Automaton has 35476 states and 109474 transitions. Word has length 67 [2019-12-27 18:32:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:32:18,932 INFO L462 AbstractCegarLoop]: Abstraction has 35476 states and 109474 transitions. [2019-12-27 18:32:18,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 18:32:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35476 states and 109474 transitions. [2019-12-27 18:32:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:32:18,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:32:18,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:32:18,970 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:32:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:32:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 5 times [2019-12-27 18:32:18,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:32:18,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887122654] [2019-12-27 18:32:18,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:32:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:32:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:32:19,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887122654] [2019-12-27 18:32:19,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:32:19,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:32:19,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050728015] [2019-12-27 18:32:19,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:32:19,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:32:19,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 394 states and 842 transitions. [2019-12-27 18:32:19,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:32:20,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:20,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:20,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:32:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:32:21,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:32:21,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 59 times. [2019-12-27 18:32:21,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 18:32:21,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:32:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 18:32:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:32:21,688 INFO L87 Difference]: Start difference. First operand 35476 states and 109474 transitions. Second operand 35 states. Received shutdown request... [2019-12-27 18:32:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-27 18:32:40,959 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:32:40,961 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:32:40,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:32:40 BasicIcfg [2019-12-27 18:32:40,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:32:40,963 INFO L168 Benchmark]: Toolchain (without parser) took 222932.91 ms. Allocated memory was 145.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.5 MB in the beginning and 1.1 GB in the end (delta: -966.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,964 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 896.19 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 155.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.07 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,965 INFO L168 Benchmark]: Boogie Preprocessor took 37.67 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,966 INFO L168 Benchmark]: RCFGBuilder took 1067.02 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,966 INFO L168 Benchmark]: TraceAbstraction took 220839.02 ms. Allocated memory was 201.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -968.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 18:32:40,969 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 896.19 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 155.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.07 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.67 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1067.02 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220839.02 ms. Allocated memory was 201.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -968.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (35476states) and FLOYD_HOARE automaton (currently 107 states, 35 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 131 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (35476states) and FLOYD_HOARE automaton (currently 107 states, 35 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 131 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: TIMEOUT, OverallTime: 220.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 128.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7819 SDtfs, 18765 SDslu, 35674 SDs, 0 SdLazy, 55558 SolverSat, 1662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1305 GetRequests, 258 SyntacticMatches, 168 SemanticMatches, 878 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27363 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 551350 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1554 ConstructedInterpolants, 0 QuantifiedInterpolants, 356590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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