/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-60655ea [2020-09-15 00:29:54,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-15 00:29:54,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-15 00:29:54,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-15 00:29:54,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-15 00:29:54,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-15 00:29:54,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-15 00:29:54,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-15 00:29:54,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-15 00:29:54,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-15 00:29:54,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-15 00:29:54,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-15 00:29:54,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-15 00:29:54,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-15 00:29:54,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-15 00:29:54,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-15 00:29:54,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-15 00:29:54,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-15 00:29:54,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-15 00:29:55,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-15 00:29:55,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-15 00:29:55,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-15 00:29:55,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-15 00:29:55,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-15 00:29:55,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-15 00:29:55,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-15 00:29:55,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-15 00:29:55,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-15 00:29:55,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-15 00:29:55,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-15 00:29:55,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-15 00:29:55,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-15 00:29:55,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-15 00:29:55,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-15 00:29:55,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-15 00:29:55,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-15 00:29:55,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-15 00:29:55,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-15 00:29:55,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-15 00:29:55,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-15 00:29:55,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-15 00:29:55,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-15 00:29:55,091 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-15 00:29:55,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-15 00:29:55,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-15 00:29:55,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-15 00:29:55,094 INFO L138 SettingsManager]: * Use SBE=true [2020-09-15 00:29:55,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-15 00:29:55,094 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-15 00:29:55,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-15 00:29:55,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-15 00:29:55,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-15 00:29:55,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-15 00:29:55,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-15 00:29:55,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-15 00:29:55,097 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-15 00:29:55,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-15 00:29:55,097 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-15 00:29:55,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-15 00:29:55,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-15 00:29:55,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-15 00:29:55,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-15 00:29:55,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-15 00:29:55,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-15 00:29:55,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-15 00:29:55,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-15 00:29:55,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-15 00:29:55,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-15 00:29:55,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-15 00:29:55,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-15 00:29:55,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-15 00:29:55,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-15 00:29:55,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-15 00:29:55,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-15 00:29:55,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-15 00:29:55,639 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-15 00:29:55,639 INFO L275 PluginConnector]: CDTParser initialized [2020-09-15 00:29:55,641 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-09-15 00:29:55,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72605d3bc/ee9cda37ed7e4bae8792294e96e1c592/FLAGa10d658bc [2020-09-15 00:29:56,430 INFO L306 CDTParser]: Found 1 translation units. [2020-09-15 00:29:56,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-09-15 00:29:56,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72605d3bc/ee9cda37ed7e4bae8792294e96e1c592/FLAGa10d658bc [2020-09-15 00:29:56,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/72605d3bc/ee9cda37ed7e4bae8792294e96e1c592 [2020-09-15 00:29:56,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-15 00:29:56,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-15 00:29:56,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-15 00:29:56,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-15 00:29:56,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-15 00:29:56,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:29:56" (1/1) ... [2020-09-15 00:29:56,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ccb127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:56, skipping insertion in model container [2020-09-15 00:29:56,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:29:56" (1/1) ... [2020-09-15 00:29:56,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-15 00:29:56,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-15 00:29:57,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 00:29:57,644 INFO L203 MainTranslator]: Completed pre-run [2020-09-15 00:29:57,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 00:29:58,110 INFO L208 MainTranslator]: Completed translation [2020-09-15 00:29:58,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58 WrapperNode [2020-09-15 00:29:58,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-15 00:29:58,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-15 00:29:58,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-15 00:29:58,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-15 00:29:58,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-15 00:29:58,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-15 00:29:58,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-15 00:29:58,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-15 00:29:58,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... [2020-09-15 00:29:58,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-15 00:29:58,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-15 00:29:58,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-15 00:29:58,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-15 00:29:58,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-15 00:29:58,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-15 00:29:58,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-15 00:29:58,371 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-15 00:29:58,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-15 00:29:58,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-15 00:29:58,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-15 00:29:58,372 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-15 00:29:58,373 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-15 00:29:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-15 00:29:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-15 00:29:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-15 00:29:58,379 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-15 00:29:59,065 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-15 00:29:59,066 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-15 00:29:59,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:29:59 BoogieIcfgContainer [2020-09-15 00:29:59,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-15 00:29:59,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-15 00:29:59,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-15 00:29:59,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-15 00:29:59,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 12:29:56" (1/3) ... [2020-09-15 00:29:59,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a4d9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:29:59, skipping insertion in model container [2020-09-15 00:29:59,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:29:58" (2/3) ... [2020-09-15 00:29:59,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a4d9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:29:59, skipping insertion in model container [2020-09-15 00:29:59,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:29:59" (3/3) ... [2020-09-15 00:29:59,082 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-09-15 00:29:59,094 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-15 00:29:59,095 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-15 00:29:59,106 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-15 00:29:59,107 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-15 00:29:59,146 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,147 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,150 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,150 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,150 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,150 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,151 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,151 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,151 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,151 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,152 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,152 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,152 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,152 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,153 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,153 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,153 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,153 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,154 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,154 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,154 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,155 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,155 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,156 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,156 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,156 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,156 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,157 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,157 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,157 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,157 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,158 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,158 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,158 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,158 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,158 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,159 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,159 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,159 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,159 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,160 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,160 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,160 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,160 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,161 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,161 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,161 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,162 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,162 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,162 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,162 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,166 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,166 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,167 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,167 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,167 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,167 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,167 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,173 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,174 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,174 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,174 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,174 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,174 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,175 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,175 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,175 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,176 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,187 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,189 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,189 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,190 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:29:59,235 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-15 00:29:59,262 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-15 00:29:59,263 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-15 00:29:59,263 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-15 00:29:59,263 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-15 00:29:59,263 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-15 00:29:59,264 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-15 00:29:59,264 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-15 00:29:59,264 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-15 00:29:59,287 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions, 332 flow [2020-09-15 00:29:59,290 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions, 332 flow [2020-09-15 00:29:59,411 INFO L129 PetriNetUnfolder]: 11/193 cut-off events. [2020-09-15 00:29:59,412 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 00:29:59,420 INFO L80 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-15 00:29:59,440 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions, 332 flow [2020-09-15 00:29:59,504 INFO L129 PetriNetUnfolder]: 11/193 cut-off events. [2020-09-15 00:29:59,505 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 00:29:59,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-09-15 00:29:59,509 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2884 [2020-09-15 00:29:59,511 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-15 00:29:59,688 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:29:59,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:29:59,733 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:29:59,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:29:59,757 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:29:59,758 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-15 00:29:59,776 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:29:59,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:29:59,813 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:29:59,836 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:29:59,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:29:59,838 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-15 00:30:01,937 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:01,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:01,990 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:02,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:02,020 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:02,020 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:02,046 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:02,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:02,088 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:02,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:02,118 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:02,118 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:04,437 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:04,472 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:04,478 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:04,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:04,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:04,508 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:04,525 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:04,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:04,562 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:04,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:04,587 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:04,587 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:06,677 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:06,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:06,710 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:06,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:06,730 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:06,731 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-15 00:30:06,757 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:06,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:06,793 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:06,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:06,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:06,816 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-15 00:30:09,026 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:09,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:09,057 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:09,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:09,081 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:09,082 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:09,099 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:09,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:09,128 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:09,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:09,162 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:09,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:11,691 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:11,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:11,723 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:11,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:11,755 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:11,755 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:11,780 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:11,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:11,810 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:11,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:11,834 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:11,835 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-15 00:30:13,862 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:13,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:13,890 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:13,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:13,923 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:13,923 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:13,938 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:13,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:13,971 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:13,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:13,992 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:13,993 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:16,012 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:16,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:16,042 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:16,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:16,061 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:16,061 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:16,076 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:16,097 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:16,101 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:16,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:16,119 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:16,119 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:18,322 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:18,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:18,357 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:18,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:18,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:18,383 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:18,399 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:18,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:18,434 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:18,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:18,468 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:18,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-15 00:30:20,659 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:20,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:20,688 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:20,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:20,718 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:20,718 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-15 00:30:20,729 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:20,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:20,767 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:20,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:20,792 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:20,793 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:22,984 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:23,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:23,029 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:23,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:23,063 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:23,063 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:23,079 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:23,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:23,117 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:23,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:23,146 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:23,146 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:25,512 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:25,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:25,540 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:25,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:25,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:25,563 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:25,576 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:25,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:25,604 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:25,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:25,625 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:25,625 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:27,641 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:27,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:27,669 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:27,690 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:27,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:27,692 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:27,710 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:27,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:27,744 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:27,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:27,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:27,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:29,912 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:29,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:29,950 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:29,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:29,974 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:29,975 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:29,988 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:30,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:30,021 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:30,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:30,044 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:30,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:32,410 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:32,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:32,434 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:32,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:32,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:32,462 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:32,480 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:32,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:32,504 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:32,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:32,523 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:32,523 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:34,619 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:34,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:34,648 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:34,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:34,670 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:34,671 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:34,686 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:34,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:34,714 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:34,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:34,738 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:34,739 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:36,798 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:36,821 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:36,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,838 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-09-15 00:30:36,909 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:36,933 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:36,952 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,952 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:36,972 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:36,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:36,997 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:37,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:37,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:37,016 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:39,312 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:39,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:39,339 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:39,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:39,365 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:39,365 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:39,375 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:39,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:39,405 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:39,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:39,434 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:39,435 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-09-15 00:30:41,502 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:41,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:41,529 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:41,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:41,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:41,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-15 00:30:41,559 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:41,584 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:41,589 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:41,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:41,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:41,612 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-09-15 00:30:43,689 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:43,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:43,718 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:43,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:43,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:43,746 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-15 00:30:43,757 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:43,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:43,791 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:43,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:43,817 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:43,818 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-09-15 00:30:45,913 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:45,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:45,966 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:45,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:45,985 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:45,985 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-09-15 00:30:45,996 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:46,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:46,023 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:46,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:46,046 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:46,047 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-15 00:30:48,892 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:48,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:48,920 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:48,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:48,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:48,941 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-09-15 00:30:48,951 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:48,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:48,975 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,003 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:49,004 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,004 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-09-15 00:30:51,920 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2020-09-15 00:30:52,126 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-09-15 00:30:52,983 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2020-09-15 00:30:52,997 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:53,260 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-09-15 00:30:53,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:53,267 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:53,486 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-09-15 00:30:53,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:53,488 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:53,488 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2020-09-15 00:30:53,709 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-09-15 00:30:54,938 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2020-09-15 00:30:54,964 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:55,525 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-09-15 00:30:55,525 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:55,534 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,069 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-15 00:30:56,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:56,071 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,071 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-09-15 00:30:56,578 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-15 00:30:56,831 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-09-15 00:30:57,071 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-09-15 00:30:57,084 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5170 [2020-09-15 00:30:57,084 INFO L214 etLargeBlockEncoding]: Total number of compositions: 162 [2020-09-15 00:30:57,088 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-09-15 00:30:57,119 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-09-15 00:30:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-09-15 00:30:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-15 00:30:57,130 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:30:57,131 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-15 00:30:57,132 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:30:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:30:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash 557, now seen corresponding path program 1 times [2020-09-15 00:30:57,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:30:57,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317194208] [2020-09-15 00:30:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:30:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:30:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:30:57,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317194208] [2020-09-15 00:30:57,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:30:57,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-15 00:30:57,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234753286] [2020-09-15 00:30:57,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-15 00:30:57,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:30:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-15 00:30:57,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-15 00:30:57,484 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-09-15 00:30:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:30:57,524 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-09-15 00:30:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-15 00:30:57,526 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-15 00:30:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:30:57,545 INFO L225 Difference]: With dead ends: 423 [2020-09-15 00:30:57,546 INFO L226 Difference]: Without dead ends: 385 [2020-09-15 00:30:57,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-15 00:30:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-09-15 00:30:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-09-15 00:30:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-09-15 00:30:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-09-15 00:30:57,633 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-09-15 00:30:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:30:57,633 INFO L479 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-09-15 00:30:57,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-15 00:30:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-09-15 00:30:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-15 00:30:57,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:30:57,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-15 00:30:57,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-15 00:30:57,635 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:30:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:30:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash 17154767, now seen corresponding path program 1 times [2020-09-15 00:30:57,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:30:57,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918055524] [2020-09-15 00:30:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:30:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:30:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:30:57,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918055524] [2020-09-15 00:30:57,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:30:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 00:30:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176882919] [2020-09-15 00:30:57,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 00:30:57,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:30:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 00:30:57,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 00:30:57,921 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-09-15 00:30:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:30:58,026 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-09-15 00:30:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 00:30:58,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-15 00:30:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:30:58,034 INFO L225 Difference]: With dead ends: 540 [2020-09-15 00:30:58,034 INFO L226 Difference]: Without dead ends: 540 [2020-09-15 00:30:58,035 INFO L675 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 [2020-09-15 00:30:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-09-15 00:30:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-09-15 00:30:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-09-15 00:30:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-09-15 00:30:58,073 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-09-15 00:30:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:30:58,073 INFO L479 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-09-15 00:30:58,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 00:30:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-09-15 00:30:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-09-15 00:30:58,074 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:30:58,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-09-15 00:30:58,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-15 00:30:58,075 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:30:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:30:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash -694138238, now seen corresponding path program 1 times [2020-09-15 00:30:58,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:30:58,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908732409] [2020-09-15 00:30:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:30:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:30:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:30:58,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908732409] [2020-09-15 00:30:58,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:30:58,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-15 00:30:58,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353253419] [2020-09-15 00:30:58,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-15 00:30:58,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:30:58,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-15 00:30:58,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-15 00:30:58,257 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-09-15 00:30:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:30:58,441 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-09-15 00:30:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-15 00:30:58,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-09-15 00:30:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:30:58,446 INFO L225 Difference]: With dead ends: 599 [2020-09-15 00:30:58,446 INFO L226 Difference]: Without dead ends: 514 [2020-09-15 00:30:58,447 INFO L675 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 [2020-09-15 00:30:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-09-15 00:30:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-09-15 00:30:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-09-15 00:30:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-09-15 00:30:58,469 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-09-15 00:30:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:30:58,469 INFO L479 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-09-15 00:30:58,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-15 00:30:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-09-15 00:30:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-15 00:30:58,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:30:58,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:30:58,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-15 00:30:58,472 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:30:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:30:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1786983460, now seen corresponding path program 1 times [2020-09-15 00:30:58,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:30:58,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382102226] [2020-09-15 00:30:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:30:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:30:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:30:58,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382102226] [2020-09-15 00:30:58,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:30:58,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-15 00:30:58,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481163367] [2020-09-15 00:30:58,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 00:30:58,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:30:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 00:30:58,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 00:30:58,593 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-09-15 00:30:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:30:58,610 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-09-15 00:30:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 00:30:58,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-15 00:30:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:30:58,612 INFO L225 Difference]: With dead ends: 162 [2020-09-15 00:30:58,613 INFO L226 Difference]: Without dead ends: 162 [2020-09-15 00:30:58,613 INFO L675 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 [2020-09-15 00:30:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-15 00:30:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-09-15 00:30:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-15 00:30:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-09-15 00:30:58,619 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-09-15 00:30:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:30:58,619 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-09-15 00:30:58,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 00:30:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-09-15 00:30:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:30:58,622 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:30:58,622 INFO L422 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] [2020-09-15 00:30:58,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-15 00:30:58,622 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:30:58,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:30:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167552, now seen corresponding path program 1 times [2020-09-15 00:30:58,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:30:58,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421818386] [2020-09-15 00:30:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:30:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:30:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:30:59,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421818386] [2020-09-15 00:30:59,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:30:59,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 00:30:59,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77549449] [2020-09-15 00:30:59,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-15 00:30:59,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:30:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-15 00:30:59,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-15 00:30:59,302 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 12 states. [2020-09-15 00:31:00,338 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-09-15 00:31:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:00,647 INFO L93 Difference]: Finished difference Result 424 states and 841 transitions. [2020-09-15 00:31:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-15 00:31:00,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-09-15 00:31:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:00,651 INFO L225 Difference]: With dead ends: 424 [2020-09-15 00:31:00,651 INFO L226 Difference]: Without dead ends: 424 [2020-09-15 00:31:00,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-09-15 00:31:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-09-15 00:31:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 264. [2020-09-15 00:31:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-09-15 00:31:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 563 transitions. [2020-09-15 00:31:00,662 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 563 transitions. Word has length 22 [2020-09-15 00:31:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:00,663 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 563 transitions. [2020-09-15 00:31:00,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-15 00:31:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 563 transitions. [2020-09-15 00:31:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:00,665 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:00,665 INFO L422 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] [2020-09-15 00:31:00,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-15 00:31:00,666 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167535, now seen corresponding path program 1 times [2020-09-15 00:31:00,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:00,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860589457] [2020-09-15 00:31:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:00,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860589457] [2020-09-15 00:31:00,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:00,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-15 00:31:00,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48272120] [2020-09-15 00:31:00,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-15 00:31:00,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-15 00:31:00,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-15 00:31:00,985 INFO L87 Difference]: Start difference. First operand 264 states and 563 transitions. Second operand 6 states. [2020-09-15 00:31:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:01,108 INFO L93 Difference]: Finished difference Result 158 states and 264 transitions. [2020-09-15 00:31:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-15 00:31:01,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-15 00:31:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:01,110 INFO L225 Difference]: With dead ends: 158 [2020-09-15 00:31:01,111 INFO L226 Difference]: Without dead ends: 158 [2020-09-15 00:31:01,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-09-15 00:31:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-09-15 00:31:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-09-15 00:31:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-09-15 00:31:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 264 transitions. [2020-09-15 00:31:01,116 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 264 transitions. Word has length 22 [2020-09-15 00:31:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:01,117 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 264 transitions. [2020-09-15 00:31:01,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-15 00:31:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 264 transitions. [2020-09-15 00:31:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:01,118 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:01,119 INFO L422 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] [2020-09-15 00:31:01,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-15 00:31:01,119 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash 864306409, now seen corresponding path program 1 times [2020-09-15 00:31:01,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:01,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415446415] [2020-09-15 00:31:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:01,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415446415] [2020-09-15 00:31:01,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:01,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 00:31:01,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691771512] [2020-09-15 00:31:01,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 00:31:01,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:01,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 00:31:01,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-15 00:31:01,389 INFO L87 Difference]: Start difference. First operand 158 states and 264 transitions. Second operand 8 states. [2020-09-15 00:31:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:01,730 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2020-09-15 00:31:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 00:31:01,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-15 00:31:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:01,732 INFO L225 Difference]: With dead ends: 164 [2020-09-15 00:31:01,732 INFO L226 Difference]: Without dead ends: 164 [2020-09-15 00:31:01,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-15 00:31:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-09-15 00:31:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2020-09-15 00:31:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-09-15 00:31:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2020-09-15 00:31:01,737 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 22 [2020-09-15 00:31:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:01,738 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2020-09-15 00:31:01,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 00:31:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2020-09-15 00:31:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:01,739 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:01,739 INFO L422 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] [2020-09-15 00:31:01,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-15 00:31:01,739 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -412491025, now seen corresponding path program 2 times [2020-09-15 00:31:01,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:01,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773886036] [2020-09-15 00:31:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:02,452 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-09-15 00:31:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:02,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773886036] [2020-09-15 00:31:02,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:02,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:02,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205688133] [2020-09-15 00:31:02,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:02,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:02,757 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand 14 states. [2020-09-15 00:31:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:03,856 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2020-09-15 00:31:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:03,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:03,858 INFO L225 Difference]: With dead ends: 179 [2020-09-15 00:31:03,859 INFO L226 Difference]: Without dead ends: 165 [2020-09-15 00:31:03,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-09-15 00:31:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-09-15 00:31:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-09-15 00:31:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2020-09-15 00:31:03,870 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 22 [2020-09-15 00:31:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:03,870 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2020-09-15 00:31:03,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2020-09-15 00:31:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:03,871 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:03,871 INFO L422 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] [2020-09-15 00:31:03,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-15 00:31:03,872 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:03,872 INFO L82 PathProgramCache]: Analyzing trace with hash -524474255, now seen corresponding path program 3 times [2020-09-15 00:31:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:03,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332381418] [2020-09-15 00:31:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:04,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332381418] [2020-09-15 00:31:04,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:04,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134997333] [2020-09-15 00:31:04,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:04,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:04,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:04,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:04,809 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 14 states. [2020-09-15 00:31:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:05,968 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2020-09-15 00:31:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-15 00:31:05,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:05,971 INFO L225 Difference]: With dead ends: 176 [2020-09-15 00:31:05,972 INFO L226 Difference]: Without dead ends: 163 [2020-09-15 00:31:05,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-09-15 00:31:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-09-15 00:31:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-09-15 00:31:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-15 00:31:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2020-09-15 00:31:05,977 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 22 [2020-09-15 00:31:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:05,977 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2020-09-15 00:31:05,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2020-09-15 00:31:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:05,978 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:05,979 INFO L422 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] [2020-09-15 00:31:05,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-15 00:31:05,979 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1681973083, now seen corresponding path program 2 times [2020-09-15 00:31:05,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:05,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865456511] [2020-09-15 00:31:05,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:06,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865456511] [2020-09-15 00:31:06,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:06,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-15 00:31:06,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452128747] [2020-09-15 00:31:06,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-15 00:31:06,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-15 00:31:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-15 00:31:06,314 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand 11 states. [2020-09-15 00:31:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:06,990 INFO L93 Difference]: Finished difference Result 223 states and 354 transitions. [2020-09-15 00:31:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:06,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-15 00:31:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:06,993 INFO L225 Difference]: With dead ends: 223 [2020-09-15 00:31:06,993 INFO L226 Difference]: Without dead ends: 223 [2020-09-15 00:31:06,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2020-09-15 00:31:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-09-15 00:31:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 174. [2020-09-15 00:31:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-09-15 00:31:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 274 transitions. [2020-09-15 00:31:06,999 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 274 transitions. Word has length 22 [2020-09-15 00:31:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:06,999 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 274 transitions. [2020-09-15 00:31:07,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-15 00:31:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2020-09-15 00:31:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:07,001 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:07,001 INFO L422 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] [2020-09-15 00:31:07,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-15 00:31:07,001 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 671772819, now seen corresponding path program 4 times [2020-09-15 00:31:07,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:07,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216166893] [2020-09-15 00:31:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:07,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216166893] [2020-09-15 00:31:07,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:07,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:07,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549973674] [2020-09-15 00:31:07,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:07,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:07,823 INFO L87 Difference]: Start difference. First operand 174 states and 274 transitions. Second operand 14 states. [2020-09-15 00:31:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:08,895 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-09-15 00:31:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:08,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:08,897 INFO L225 Difference]: With dead ends: 188 [2020-09-15 00:31:08,897 INFO L226 Difference]: Without dead ends: 180 [2020-09-15 00:31:08,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-09-15 00:31:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2020-09-15 00:31:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-09-15 00:31:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 273 transitions. [2020-09-15 00:31:08,902 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 273 transitions. Word has length 22 [2020-09-15 00:31:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:08,902 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 273 transitions. [2020-09-15 00:31:08,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 273 transitions. [2020-09-15 00:31:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:08,905 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:08,905 INFO L422 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] [2020-09-15 00:31:08,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-15 00:31:08,905 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash -481747075, now seen corresponding path program 5 times [2020-09-15 00:31:08,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:08,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439937254] [2020-09-15 00:31:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:09,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439937254] [2020-09-15 00:31:09,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:09,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:09,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047873607] [2020-09-15 00:31:09,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:09,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:09,772 INFO L87 Difference]: Start difference. First operand 174 states and 273 transitions. Second operand 14 states. [2020-09-15 00:31:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:10,808 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2020-09-15 00:31:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:10,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:10,810 INFO L225 Difference]: With dead ends: 187 [2020-09-15 00:31:10,810 INFO L226 Difference]: Without dead ends: 174 [2020-09-15 00:31:10,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-09-15 00:31:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-09-15 00:31:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-09-15 00:31:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 264 transitions. [2020-09-15 00:31:10,815 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 264 transitions. Word has length 22 [2020-09-15 00:31:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:10,816 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 264 transitions. [2020-09-15 00:31:10,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 264 transitions. [2020-09-15 00:31:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:10,817 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:10,817 INFO L422 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] [2020-09-15 00:31:10,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-15 00:31:10,817 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:10,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:10,818 INFO L82 PathProgramCache]: Analyzing trace with hash 186432761, now seen corresponding path program 6 times [2020-09-15 00:31:10,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:10,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751449358] [2020-09-15 00:31:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:11,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751449358] [2020-09-15 00:31:11,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:11,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:11,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865642963] [2020-09-15 00:31:11,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:11,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:11,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:11,575 INFO L87 Difference]: Start difference. First operand 170 states and 264 transitions. Second operand 14 states. [2020-09-15 00:31:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:12,691 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2020-09-15 00:31:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:12,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:12,694 INFO L225 Difference]: With dead ends: 180 [2020-09-15 00:31:12,694 INFO L226 Difference]: Without dead ends: 166 [2020-09-15 00:31:12,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-09-15 00:31:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-09-15 00:31:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-09-15 00:31:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2020-09-15 00:31:12,698 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 22 [2020-09-15 00:31:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:12,699 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2020-09-15 00:31:12,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2020-09-15 00:31:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:12,700 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:12,700 INFO L422 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] [2020-09-15 00:31:12,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-15 00:31:12,700 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1728779239, now seen corresponding path program 7 times [2020-09-15 00:31:12,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:12,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698011458] [2020-09-15 00:31:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:13,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698011458] [2020-09-15 00:31:13,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:13,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:13,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498662153] [2020-09-15 00:31:13,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:13,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:13,423 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand 14 states. [2020-09-15 00:31:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:14,507 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2020-09-15 00:31:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:14,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:14,509 INFO L225 Difference]: With dead ends: 172 [2020-09-15 00:31:14,509 INFO L226 Difference]: Without dead ends: 152 [2020-09-15 00:31:14,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-09-15 00:31:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-15 00:31:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-09-15 00:31:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-09-15 00:31:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2020-09-15 00:31:14,515 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 22 [2020-09-15 00:31:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:14,515 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2020-09-15 00:31:14,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2020-09-15 00:31:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:14,516 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:14,516 INFO L422 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] [2020-09-15 00:31:14,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-15 00:31:14,516 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:14,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1510347584, now seen corresponding path program 2 times [2020-09-15 00:31:14,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:14,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572907724] [2020-09-15 00:31:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:14,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572907724] [2020-09-15 00:31:14,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:14,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 00:31:14,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184850477] [2020-09-15 00:31:14,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-15 00:31:14,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-15 00:31:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-15 00:31:14,870 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand 9 states. [2020-09-15 00:31:15,222 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-09-15 00:31:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:15,338 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-09-15 00:31:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 00:31:15,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-15 00:31:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:15,340 INFO L225 Difference]: With dead ends: 188 [2020-09-15 00:31:15,340 INFO L226 Difference]: Without dead ends: 171 [2020-09-15 00:31:15,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-15 00:31:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2020-09-15 00:31:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-09-15 00:31:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 217 transitions. [2020-09-15 00:31:15,347 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 217 transitions. Word has length 22 [2020-09-15 00:31:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:15,348 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 217 transitions. [2020-09-15 00:31:15,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-15 00:31:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 217 transitions. [2020-09-15 00:31:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:15,348 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:15,349 INFO L422 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] [2020-09-15 00:31:15,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-15 00:31:15,349 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688272, now seen corresponding path program 3 times [2020-09-15 00:31:15,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:15,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622781608] [2020-09-15 00:31:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:15,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622781608] [2020-09-15 00:31:15,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:15,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 00:31:15,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108893712] [2020-09-15 00:31:15,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-15 00:31:15,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:15,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-15 00:31:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-15 00:31:15,774 INFO L87 Difference]: Start difference. First operand 135 states and 217 transitions. Second operand 9 states. [2020-09-15 00:31:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:16,219 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2020-09-15 00:31:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 00:31:16,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-15 00:31:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:16,221 INFO L225 Difference]: With dead ends: 171 [2020-09-15 00:31:16,222 INFO L226 Difference]: Without dead ends: 171 [2020-09-15 00:31:16,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-15 00:31:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2020-09-15 00:31:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-15 00:31:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 226 transitions. [2020-09-15 00:31:16,226 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 226 transitions. Word has length 22 [2020-09-15 00:31:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:16,226 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 226 transitions. [2020-09-15 00:31:16,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-15 00:31:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2020-09-15 00:31:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:16,227 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:16,227 INFO L422 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] [2020-09-15 00:31:16,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-15 00:31:16,228 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688289, now seen corresponding path program 8 times [2020-09-15 00:31:16,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:16,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227288947] [2020-09-15 00:31:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:17,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227288947] [2020-09-15 00:31:17,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:17,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:17,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764074861] [2020-09-15 00:31:17,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:17,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:17,338 INFO L87 Difference]: Start difference. First operand 140 states and 226 transitions. Second operand 14 states. [2020-09-15 00:31:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:18,698 INFO L93 Difference]: Finished difference Result 171 states and 271 transitions. [2020-09-15 00:31:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:18,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:18,701 INFO L225 Difference]: With dead ends: 171 [2020-09-15 00:31:18,701 INFO L226 Difference]: Without dead ends: 143 [2020-09-15 00:31:18,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-09-15 00:31:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2020-09-15 00:31:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-15 00:31:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 225 transitions. [2020-09-15 00:31:18,706 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 225 transitions. Word has length 22 [2020-09-15 00:31:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:18,706 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 225 transitions. [2020-09-15 00:31:18,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 225 transitions. [2020-09-15 00:31:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:18,707 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:18,707 INFO L422 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] [2020-09-15 00:31:18,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-15 00:31:18,708 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:18,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:18,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655162, now seen corresponding path program 4 times [2020-09-15 00:31:18,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:18,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354437258] [2020-09-15 00:31:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:19,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354437258] [2020-09-15 00:31:19,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:19,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 00:31:19,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235528404] [2020-09-15 00:31:19,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-15 00:31:19,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-15 00:31:19,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-15 00:31:19,102 INFO L87 Difference]: Start difference. First operand 140 states and 225 transitions. Second operand 9 states. [2020-09-15 00:31:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:19,471 INFO L93 Difference]: Finished difference Result 176 states and 276 transitions. [2020-09-15 00:31:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-15 00:31:19,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-15 00:31:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:19,473 INFO L225 Difference]: With dead ends: 176 [2020-09-15 00:31:19,474 INFO L226 Difference]: Without dead ends: 176 [2020-09-15 00:31:19,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-09-15 00:31:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2020-09-15 00:31:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-15 00:31:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-09-15 00:31:19,478 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 22 [2020-09-15 00:31:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:19,478 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-09-15 00:31:19,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-15 00:31:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-09-15 00:31:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:19,479 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:19,479 INFO L422 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] [2020-09-15 00:31:19,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-15 00:31:19,480 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655179, now seen corresponding path program 9 times [2020-09-15 00:31:19,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:19,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991224823] [2020-09-15 00:31:19,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:20,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991224823] [2020-09-15 00:31:20,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:20,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:20,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651908247] [2020-09-15 00:31:20,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:20,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:20,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:20,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:20,356 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 14 states. [2020-09-15 00:31:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:21,562 INFO L93 Difference]: Finished difference Result 147 states and 237 transitions. [2020-09-15 00:31:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:21,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:21,565 INFO L225 Difference]: With dead ends: 147 [2020-09-15 00:31:21,565 INFO L226 Difference]: Without dead ends: 125 [2020-09-15 00:31:21,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-09-15 00:31:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2020-09-15 00:31:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-15 00:31:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 175 transitions. [2020-09-15 00:31:21,569 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 175 transitions. Word has length 22 [2020-09-15 00:31:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:21,569 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 175 transitions. [2020-09-15 00:31:21,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 175 transitions. [2020-09-15 00:31:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:21,570 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:21,570 INFO L422 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] [2020-09-15 00:31:21,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-15 00:31:21,570 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1986983371, now seen corresponding path program 10 times [2020-09-15 00:31:21,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:21,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684485368] [2020-09-15 00:31:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:22,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684485368] [2020-09-15 00:31:22,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:22,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:22,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565154664] [2020-09-15 00:31:22,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:22,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:22,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:22,274 INFO L87 Difference]: Start difference. First operand 109 states and 175 transitions. Second operand 14 states. [2020-09-15 00:31:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:23,470 INFO L93 Difference]: Finished difference Result 148 states and 232 transitions. [2020-09-15 00:31:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-15 00:31:23,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:23,472 INFO L225 Difference]: With dead ends: 148 [2020-09-15 00:31:23,472 INFO L226 Difference]: Without dead ends: 134 [2020-09-15 00:31:23,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-09-15 00:31:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-09-15 00:31:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2020-09-15 00:31:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-15 00:31:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 173 transitions. [2020-09-15 00:31:23,476 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 173 transitions. Word has length 22 [2020-09-15 00:31:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:23,477 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 173 transitions. [2020-09-15 00:31:23,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 173 transitions. [2020-09-15 00:31:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:23,477 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:23,477 INFO L422 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] [2020-09-15 00:31:23,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-15 00:31:23,478 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:23,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1039623051, now seen corresponding path program 11 times [2020-09-15 00:31:23,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:23,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980423242] [2020-09-15 00:31:23,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:24,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980423242] [2020-09-15 00:31:24,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:24,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:24,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761102589] [2020-09-15 00:31:24,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:24,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:24,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:24,235 INFO L87 Difference]: Start difference. First operand 109 states and 173 transitions. Second operand 14 states. [2020-09-15 00:31:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:25,353 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2020-09-15 00:31:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:25,354 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:25,355 INFO L225 Difference]: With dead ends: 140 [2020-09-15 00:31:25,355 INFO L226 Difference]: Without dead ends: 124 [2020-09-15 00:31:25,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-15 00:31:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2020-09-15 00:31:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-15 00:31:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 157 transitions. [2020-09-15 00:31:25,359 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 157 transitions. Word has length 22 [2020-09-15 00:31:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:25,359 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 157 transitions. [2020-09-15 00:31:25,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2020-09-15 00:31:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:25,360 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:25,360 INFO L422 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] [2020-09-15 00:31:25,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-15 00:31:25,360 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2100578423, now seen corresponding path program 12 times [2020-09-15 00:31:25,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:25,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953920684] [2020-09-15 00:31:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:26,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953920684] [2020-09-15 00:31:26,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:26,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:26,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415903564] [2020-09-15 00:31:26,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:26,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:26,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:26,263 INFO L87 Difference]: Start difference. First operand 99 states and 157 transitions. Second operand 14 states. [2020-09-15 00:31:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:27,387 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2020-09-15 00:31:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:27,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:27,390 INFO L225 Difference]: With dead ends: 138 [2020-09-15 00:31:27,390 INFO L226 Difference]: Without dead ends: 105 [2020-09-15 00:31:27,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-15 00:31:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-09-15 00:31:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-15 00:31:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2020-09-15 00:31:27,393 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 22 [2020-09-15 00:31:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:27,393 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2020-09-15 00:31:27,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2020-09-15 00:31:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:27,394 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:27,394 INFO L422 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] [2020-09-15 00:31:27,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-15 00:31:27,395 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:27,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1068559361, now seen corresponding path program 13 times [2020-09-15 00:31:27,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:27,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937074816] [2020-09-15 00:31:27,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:28,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937074816] [2020-09-15 00:31:28,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:28,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:28,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28714112] [2020-09-15 00:31:28,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:28,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:28,316 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand 14 states. [2020-09-15 00:31:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:29,462 INFO L93 Difference]: Finished difference Result 126 states and 193 transitions. [2020-09-15 00:31:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:29,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:29,464 INFO L225 Difference]: With dead ends: 126 [2020-09-15 00:31:29,464 INFO L226 Difference]: Without dead ends: 92 [2020-09-15 00:31:29,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-15 00:31:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2020-09-15 00:31:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-09-15 00:31:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2020-09-15 00:31:29,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 22 [2020-09-15 00:31:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:29,467 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2020-09-15 00:31:29,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2020-09-15 00:31:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:29,468 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:29,468 INFO L422 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] [2020-09-15 00:31:29,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-15 00:31:29,469 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1273870831, now seen corresponding path program 14 times [2020-09-15 00:31:29,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:29,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137929806] [2020-09-15 00:31:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:30,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137929806] [2020-09-15 00:31:30,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:30,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:30,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614598380] [2020-09-15 00:31:30,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:30,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:30,201 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand 14 states. [2020-09-15 00:31:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:31,190 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2020-09-15 00:31:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:31,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:31,191 INFO L225 Difference]: With dead ends: 95 [2020-09-15 00:31:31,191 INFO L226 Difference]: Without dead ends: 80 [2020-09-15 00:31:31,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-15 00:31:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-15 00:31:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-15 00:31:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2020-09-15 00:31:31,194 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 22 [2020-09-15 00:31:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:31,195 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2020-09-15 00:31:31,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2020-09-15 00:31:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:31,195 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:31,196 INFO L422 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] [2020-09-15 00:31:31,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-15 00:31:31,196 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 341292095, now seen corresponding path program 15 times [2020-09-15 00:31:31,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:31,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571218344] [2020-09-15 00:31:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:32,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571218344] [2020-09-15 00:31:32,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:32,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:32,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777156154] [2020-09-15 00:31:32,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:32,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:32,101 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand 14 states. [2020-09-15 00:31:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:33,224 INFO L93 Difference]: Finished difference Result 110 states and 172 transitions. [2020-09-15 00:31:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:33,225 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:33,226 INFO L225 Difference]: With dead ends: 110 [2020-09-15 00:31:33,227 INFO L226 Difference]: Without dead ends: 77 [2020-09-15 00:31:33,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-09-15 00:31:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-09-15 00:31:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-15 00:31:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2020-09-15 00:31:33,230 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 22 [2020-09-15 00:31:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:33,231 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2020-09-15 00:31:33,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2020-09-15 00:31:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:33,231 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:33,231 INFO L422 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] [2020-09-15 00:31:33,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-15 00:31:33,232 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:33,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2099874535, now seen corresponding path program 16 times [2020-09-15 00:31:33,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:33,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275457548] [2020-09-15 00:31:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:34,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275457548] [2020-09-15 00:31:34,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:34,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:34,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124721004] [2020-09-15 00:31:34,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:34,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:34,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:34,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:34,141 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand 14 states. [2020-09-15 00:31:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:35,352 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2020-09-15 00:31:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:35,353 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:35,354 INFO L225 Difference]: With dead ends: 111 [2020-09-15 00:31:35,354 INFO L226 Difference]: Without dead ends: 80 [2020-09-15 00:31:35,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-15 00:31:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-09-15 00:31:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-15 00:31:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2020-09-15 00:31:35,357 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 22 [2020-09-15 00:31:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:35,359 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2020-09-15 00:31:35,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2020-09-15 00:31:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:35,361 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:35,361 INFO L422 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] [2020-09-15 00:31:35,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-15 00:31:35,361 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1892841425, now seen corresponding path program 17 times [2020-09-15 00:31:35,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:35,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996739932] [2020-09-15 00:31:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:36,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996739932] [2020-09-15 00:31:36,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:36,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:36,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166447596] [2020-09-15 00:31:36,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:36,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:36,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:36,253 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand 14 states. [2020-09-15 00:31:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:37,380 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2020-09-15 00:31:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:37,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:37,382 INFO L225 Difference]: With dead ends: 128 [2020-09-15 00:31:37,382 INFO L226 Difference]: Without dead ends: 103 [2020-09-15 00:31:37,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-15 00:31:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2020-09-15 00:31:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-15 00:31:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2020-09-15 00:31:37,385 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 22 [2020-09-15 00:31:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:37,386 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2020-09-15 00:31:37,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2020-09-15 00:31:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:37,386 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:37,386 INFO L422 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] [2020-09-15 00:31:37,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-15 00:31:37,386 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1938797679, now seen corresponding path program 18 times [2020-09-15 00:31:37,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:37,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733936590] [2020-09-15 00:31:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:38,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733936590] [2020-09-15 00:31:38,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:38,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:38,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840829493] [2020-09-15 00:31:38,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:38,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:38,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:38,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:38,113 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand 14 states. [2020-09-15 00:31:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:39,293 INFO L93 Difference]: Finished difference Result 134 states and 212 transitions. [2020-09-15 00:31:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-15 00:31:39,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:39,295 INFO L225 Difference]: With dead ends: 134 [2020-09-15 00:31:39,295 INFO L226 Difference]: Without dead ends: 117 [2020-09-15 00:31:39,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-09-15 00:31:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-15 00:31:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2020-09-15 00:31:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-15 00:31:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2020-09-15 00:31:39,298 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 22 [2020-09-15 00:31:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:39,298 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2020-09-15 00:31:39,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2020-09-15 00:31:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:39,299 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:39,299 INFO L422 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] [2020-09-15 00:31:39,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-15 00:31:39,300 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1408809297, now seen corresponding path program 19 times [2020-09-15 00:31:39,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:39,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211376290] [2020-09-15 00:31:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:40,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211376290] [2020-09-15 00:31:40,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:40,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:40,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990426118] [2020-09-15 00:31:40,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:40,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:40,031 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand 14 states. [2020-09-15 00:31:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:41,044 INFO L93 Difference]: Finished difference Result 126 states and 196 transitions. [2020-09-15 00:31:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:41,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:41,047 INFO L225 Difference]: With dead ends: 126 [2020-09-15 00:31:41,047 INFO L226 Difference]: Without dead ends: 107 [2020-09-15 00:31:41,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-09-15 00:31:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2020-09-15 00:31:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-15 00:31:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-09-15 00:31:41,051 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 22 [2020-09-15 00:31:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:41,051 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-09-15 00:31:41,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2020-09-15 00:31:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:41,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:41,052 INFO L422 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] [2020-09-15 00:31:41,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-15 00:31:41,053 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1825202627, now seen corresponding path program 20 times [2020-09-15 00:31:41,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:41,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4425410] [2020-09-15 00:31:41,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:41,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4425410] [2020-09-15 00:31:41,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:41,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:41,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673896729] [2020-09-15 00:31:41,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:41,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:41,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:41,970 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 14 states. [2020-09-15 00:31:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:43,096 INFO L93 Difference]: Finished difference Result 123 states and 196 transitions. [2020-09-15 00:31:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:43,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:43,097 INFO L225 Difference]: With dead ends: 123 [2020-09-15 00:31:43,097 INFO L226 Difference]: Without dead ends: 87 [2020-09-15 00:31:43,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-09-15 00:31:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-09-15 00:31:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-15 00:31:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2020-09-15 00:31:43,101 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 22 [2020-09-15 00:31:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:43,102 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2020-09-15 00:31:43,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2020-09-15 00:31:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:43,102 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:43,102 INFO L422 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] [2020-09-15 00:31:43,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-15 00:31:43,103 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -699373115, now seen corresponding path program 21 times [2020-09-15 00:31:43,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:43,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15209558] [2020-09-15 00:31:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:44,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15209558] [2020-09-15 00:31:44,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:44,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:44,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552673165] [2020-09-15 00:31:44,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:44,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:44,043 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand 14 states. [2020-09-15 00:31:44,725 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-09-15 00:31:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:45,245 INFO L93 Difference]: Finished difference Result 108 states and 168 transitions. [2020-09-15 00:31:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:45,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:45,247 INFO L225 Difference]: With dead ends: 108 [2020-09-15 00:31:45,247 INFO L226 Difference]: Without dead ends: 62 [2020-09-15 00:31:45,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-09-15 00:31:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-09-15 00:31:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-15 00:31:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2020-09-15 00:31:45,251 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 22 [2020-09-15 00:31:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:45,251 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2020-09-15 00:31:45,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2020-09-15 00:31:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:45,252 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:45,252 INFO L422 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] [2020-09-15 00:31:45,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-15 00:31:45,252 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash -675636301, now seen corresponding path program 22 times [2020-09-15 00:31:45,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:45,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597271837] [2020-09-15 00:31:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:46,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597271837] [2020-09-15 00:31:46,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:46,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:46,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35720955] [2020-09-15 00:31:46,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:46,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:46,217 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand 14 states. [2020-09-15 00:31:46,849 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-09-15 00:31:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:47,351 INFO L93 Difference]: Finished difference Result 92 states and 143 transitions. [2020-09-15 00:31:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:47,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:47,353 INFO L225 Difference]: With dead ends: 92 [2020-09-15 00:31:47,353 INFO L226 Difference]: Without dead ends: 61 [2020-09-15 00:31:47,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-15 00:31:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-09-15 00:31:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-15 00:31:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2020-09-15 00:31:47,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 22 [2020-09-15 00:31:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:47,356 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2020-09-15 00:31:47,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2020-09-15 00:31:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:47,357 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:47,357 INFO L422 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] [2020-09-15 00:31:47,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-15 00:31:47,357 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash -882669411, now seen corresponding path program 23 times [2020-09-15 00:31:47,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:47,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085512575] [2020-09-15 00:31:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:48,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085512575] [2020-09-15 00:31:48,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:48,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:48,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186734040] [2020-09-15 00:31:48,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:48,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:48,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:48,245 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand 14 states. [2020-09-15 00:31:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:49,319 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2020-09-15 00:31:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:49,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:49,321 INFO L225 Difference]: With dead ends: 109 [2020-09-15 00:31:49,322 INFO L226 Difference]: Without dead ends: 84 [2020-09-15 00:31:49,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-09-15 00:31:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2020-09-15 00:31:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-15 00:31:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2020-09-15 00:31:49,326 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 22 [2020-09-15 00:31:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:49,326 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2020-09-15 00:31:49,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2020-09-15 00:31:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:49,327 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:49,327 INFO L422 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] [2020-09-15 00:31:49,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-15 00:31:49,327 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -419341219, now seen corresponding path program 24 times [2020-09-15 00:31:49,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:49,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596306538] [2020-09-15 00:31:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:50,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596306538] [2020-09-15 00:31:50,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:50,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:50,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106946394] [2020-09-15 00:31:50,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:50,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:50,047 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand 14 states. [2020-09-15 00:31:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:51,185 INFO L93 Difference]: Finished difference Result 115 states and 180 transitions. [2020-09-15 00:31:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-15 00:31:51,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:51,187 INFO L225 Difference]: With dead ends: 115 [2020-09-15 00:31:51,187 INFO L226 Difference]: Without dead ends: 98 [2020-09-15 00:31:51,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-09-15 00:31:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-15 00:31:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2020-09-15 00:31:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-15 00:31:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2020-09-15 00:31:51,191 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 22 [2020-09-15 00:31:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:51,191 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2020-09-15 00:31:51,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2020-09-15 00:31:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:51,192 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:51,192 INFO L422 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] [2020-09-15 00:31:51,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-15 00:31:51,192 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1366701539, now seen corresponding path program 25 times [2020-09-15 00:31:51,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:51,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193752193] [2020-09-15 00:31:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:51,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193752193] [2020-09-15 00:31:51,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:51,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:51,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280421119] [2020-09-15 00:31:51,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:51,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:51,996 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand 14 states. [2020-09-15 00:31:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:53,451 INFO L93 Difference]: Finished difference Result 107 states and 164 transitions. [2020-09-15 00:31:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:53,452 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:53,453 INFO L225 Difference]: With dead ends: 107 [2020-09-15 00:31:53,453 INFO L226 Difference]: Without dead ends: 88 [2020-09-15 00:31:53,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-15 00:31:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-09-15 00:31:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-15 00:31:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2020-09-15 00:31:53,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 22 [2020-09-15 00:31:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:53,458 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2020-09-15 00:31:53,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2020-09-15 00:31:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:53,459 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:53,459 INFO L422 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] [2020-09-15 00:31:53,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-15 00:31:53,460 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash -305746167, now seen corresponding path program 26 times [2020-09-15 00:31:53,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:53,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412668455] [2020-09-15 00:31:53,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:54,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412668455] [2020-09-15 00:31:54,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:54,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:54,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716182542] [2020-09-15 00:31:54,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:54,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:54,480 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand 14 states. [2020-09-15 00:31:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:55,535 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-09-15 00:31:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:55,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:55,537 INFO L225 Difference]: With dead ends: 95 [2020-09-15 00:31:55,537 INFO L226 Difference]: Without dead ends: 59 [2020-09-15 00:31:55,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-15 00:31:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-09-15 00:31:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-15 00:31:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 92 transitions. [2020-09-15 00:31:55,541 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 92 transitions. Word has length 22 [2020-09-15 00:31:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:55,541 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 92 transitions. [2020-09-15 00:31:55,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 92 transitions. [2020-09-15 00:31:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:55,542 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:55,542 INFO L422 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] [2020-09-15 00:31:55,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-15 00:31:55,542 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2008695741, now seen corresponding path program 27 times [2020-09-15 00:31:55,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:55,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741261874] [2020-09-15 00:31:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:56,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741261874] [2020-09-15 00:31:56,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:56,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:56,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034621240] [2020-09-15 00:31:56,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:56,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:56,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:56,395 INFO L87 Difference]: Start difference. First operand 59 states and 92 transitions. Second operand 14 states. [2020-09-15 00:31:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:57,615 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2020-09-15 00:31:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:57,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:57,617 INFO L225 Difference]: With dead ends: 88 [2020-09-15 00:31:57,617 INFO L226 Difference]: Without dead ends: 63 [2020-09-15 00:31:57,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-15 00:31:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-09-15 00:31:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-15 00:31:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2020-09-15 00:31:57,619 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 22 [2020-09-15 00:31:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:57,620 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2020-09-15 00:31:57,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2020-09-15 00:31:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:57,620 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:57,621 INFO L422 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] [2020-09-15 00:31:57,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-15 00:31:57,622 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 287585121, now seen corresponding path program 28 times [2020-09-15 00:31:57,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:57,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220363860] [2020-09-15 00:31:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:58,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220363860] [2020-09-15 00:31:58,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:58,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:58,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870244238] [2020-09-15 00:31:58,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:58,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:58,379 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 14 states. [2020-09-15 00:31:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:59,628 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2020-09-15 00:31:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-15 00:31:59,629 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:31:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:59,630 INFO L225 Difference]: With dead ends: 85 [2020-09-15 00:31:59,630 INFO L226 Difference]: Without dead ends: 68 [2020-09-15 00:31:59,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-09-15 00:31:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-15 00:31:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-09-15 00:31:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-15 00:31:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2020-09-15 00:31:59,633 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 22 [2020-09-15 00:31:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:59,634 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2020-09-15 00:31:59,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2020-09-15 00:31:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:31:59,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:59,634 INFO L422 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] [2020-09-15 00:31:59,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-15 00:31:59,635 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:31:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -659775199, now seen corresponding path program 29 times [2020-09-15 00:31:59,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:59,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864150046] [2020-09-15 00:31:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:32:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:32:00,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864150046] [2020-09-15 00:32:00,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:32:00,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:32:00,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627142362] [2020-09-15 00:32:00,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:32:00,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:32:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:32:00,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:32:00,374 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 14 states. [2020-09-15 00:32:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:32:01,399 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2020-09-15 00:32:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:32:01,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:32:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:32:01,401 INFO L225 Difference]: With dead ends: 77 [2020-09-15 00:32:01,401 INFO L226 Difference]: Without dead ends: 58 [2020-09-15 00:32:01,402 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:32:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-15 00:32:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2020-09-15 00:32:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-09-15 00:32:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2020-09-15 00:32:01,404 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 22 [2020-09-15 00:32:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:32:01,404 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2020-09-15 00:32:01,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:32:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2020-09-15 00:32:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-15 00:32:01,405 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:32:01,405 INFO L422 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] [2020-09-15 00:32:01,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-15 00:32:01,405 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 00:32:01,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:32:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1650897763, now seen corresponding path program 30 times [2020-09-15 00:32:01,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:32:01,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289326298] [2020-09-15 00:32:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:32:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:32:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:32:02,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289326298] [2020-09-15 00:32:02,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:32:02,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:32:02,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828062831] [2020-09-15 00:32:02,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:32:02,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:32:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:32:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:32:02,378 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 14 states. [2020-09-15 00:32:03,293 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-15 00:32:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:32:03,468 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2020-09-15 00:32:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:32:03,469 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-09-15 00:32:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:32:03,469 INFO L225 Difference]: With dead ends: 48 [2020-09-15 00:32:03,469 INFO L226 Difference]: Without dead ends: 0 [2020-09-15 00:32:03,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:32:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-15 00:32:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-15 00:32:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-15 00:32:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-15 00:32:03,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-09-15 00:32:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:32:03,470 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-15 00:32:03,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:32:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-15 00:32:03,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-15 00:32:03,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-15 00:32:03,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 12:32:03 BasicIcfg [2020-09-15 00:32:03,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-15 00:32:03,484 INFO L168 Benchmark]: Toolchain (without parser) took 126852.69 ms. Allocated memory was 138.4 MB in the beginning and 546.3 MB in the end (delta: 407.9 MB). Free memory was 99.1 MB in the beginning and 162.1 MB in the end (delta: -63.1 MB). Peak memory consumption was 344.8 MB. Max. memory is 7.1 GB. [2020-09-15 00:32:03,485 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-15 00:32:03,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1473.83 ms. Allocated memory was 138.4 MB in the beginning and 233.3 MB in the end (delta: 94.9 MB). Free memory was 98.4 MB in the beginning and 167.5 MB in the end (delta: -69.1 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. [2020-09-15 00:32:03,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.48 ms. Allocated memory is still 233.3 MB. Free memory was 167.5 MB in the beginning and 164.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-15 00:32:03,487 INFO L168 Benchmark]: Boogie Preprocessor took 54.33 ms. Allocated memory is still 233.3 MB. Free memory was 164.5 MB in the beginning and 161.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-15 00:32:03,487 INFO L168 Benchmark]: RCFGBuilder took 819.17 ms. Allocated memory is still 233.3 MB. Free memory was 161.6 MB in the beginning and 113.4 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2020-09-15 00:32:03,487 INFO L168 Benchmark]: TraceAbstraction took 124409.82 ms. Allocated memory was 233.3 MB in the beginning and 546.3 MB in the end (delta: 313.0 MB). Free memory was 113.4 MB in the beginning and 162.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. [2020-09-15 00:32:03,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1473.83 ms. Allocated memory was 138.4 MB in the beginning and 233.3 MB in the end (delta: 94.9 MB). Free memory was 98.4 MB in the beginning and 167.5 MB in the end (delta: -69.1 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.48 ms. Allocated memory is still 233.3 MB. Free memory was 167.5 MB in the beginning and 164.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.33 ms. Allocated memory is still 233.3 MB. Free memory was 164.5 MB in the beginning and 161.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.17 ms. Allocated memory is still 233.3 MB. Free memory was 161.6 MB in the beginning and 113.4 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124409.82 ms. Allocated memory was 233.3 MB in the beginning and 546.3 MB in the end (delta: 313.0 MB). Free memory was 113.4 MB in the beginning and 162.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 57.7s, 151 ProgramPointsBefore, 41 ProgramPointsAfterwards, 155 TransitionsBefore, 40 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 8 FixpointIterations, 87 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 1477 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 47.9s, 0 MoverChecksTotal, 5170 CheckedPairsTotal, 162 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 124.2s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 57.8s, HoareTripleCheckerStatistics: 854 SDtfs, 1700 SDslu, 4176 SDs, 0 SdLazy, 10914 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 23 SyntacticMatches, 72 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 742 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 400414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...