/usr/bin/java -Xmx16000000000 -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-11af1e5 [2020-10-11 15:25:47,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:25:47,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:25:47,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:25:47,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:25:47,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:25:47,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:25:47,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:25:47,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:25:47,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:25:47,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:25:47,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:25:47,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:25:47,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:25:47,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:25:47,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:25:47,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:25:47,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:25:47,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:25:47,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:25:47,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:25:47,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:25:47,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:25:47,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:25:47,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:25:47,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:25:47,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:25:47,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:25:47,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:25:47,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:25:47,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:25:47,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:25:47,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:25:47,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:25:47,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:25:47,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:25:47,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:25:47,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:25:47,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:25:47,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:25:47,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:25:47,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:25:47,091 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:25:47,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:25:47,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:25:47,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:25:47,093 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:25:47,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:25:47,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:25:47,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:25:47,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:25:47,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:25:47,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:25:47,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:25:47,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:25:47,095 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:25:47,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:25:47,098 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:25:47,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:25:47,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:25:47,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:25:47,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:25:47,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:25:47,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:25:47,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:25:47,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:25:47,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:25:47,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:25:47,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:25:47,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:25:47,101 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:25:47,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:25:47,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:25:47,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:25:47,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:25:47,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:25:47,460 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:25:47,461 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-11 15:25:47,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5efe52f2/90009086e32b4fdb806292cffd4536a4/FLAG639c8438c [2020-10-11 15:25:48,096 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:25:48,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-11 15:25:48,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5efe52f2/90009086e32b4fdb806292cffd4536a4/FLAG639c8438c [2020-10-11 15:25:48,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5efe52f2/90009086e32b4fdb806292cffd4536a4 [2020-10-11 15:25:48,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:25:48,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:25:48,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:25:48,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:25:48,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:25:48,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:48" (1/1) ... [2020-10-11 15:25:48,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3470fc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:48, skipping insertion in model container [2020-10-11 15:25:48,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:48" (1/1) ... [2020-10-11 15:25:48,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:25:48,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:25:49,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:25:49,074 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:25:49,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:25:49,527 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:25:49,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49 WrapperNode [2020-10-11 15:25:49,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:25:49,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:25:49,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:25:49,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:25:49,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:25:49,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:25:49,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:25:49,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:25:49,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:25:49,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:25:49,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:25:49,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:25:49,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:25:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:25:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 15:25:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-11 15:25:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-11 15:25:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:25:49,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:25:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-11 15:25:49,788 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-11 15:25:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:25:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:25:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 15:25:49,791 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:25:50,534 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:25:50,535 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-11 15:25:50,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:50 BoogieIcfgContainer [2020-10-11 15:25:50,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:25:50,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:25:50,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:25:50,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:25:50,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:25:48" (1/3) ... [2020-10-11 15:25:50,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba20b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:50, skipping insertion in model container [2020-10-11 15:25:50,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49" (2/3) ... [2020-10-11 15:25:50,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba20b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:50, skipping insertion in model container [2020-10-11 15:25:50,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:50" (3/3) ... [2020-10-11 15:25:50,546 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-10-11 15:25:50,558 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:25:50,558 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:25:50,567 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-11 15:25:50,568 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:25:50,600 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,601 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,601 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,602 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,605 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,606 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,606 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,607 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,607 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,608 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,608 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,608 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,608 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,608 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,609 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,610 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,611 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,611 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,611 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,611 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,611 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,612 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,612 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,612 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,612 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,613 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,613 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,613 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,613 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,614 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,614 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,614 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,614 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,614 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,618 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,619 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,620 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,620 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,627 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,627 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,627 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,628 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,628 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,629 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:50,656 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-11 15:25:50,678 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:25:50,678 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:25:50,678 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:25:50,678 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:25:50,678 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:25:50,678 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:25:50,678 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:25:50,679 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:25:50,695 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:25:50,698 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions, 332 flow [2020-10-11 15:25:50,701 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 155 transitions, 332 flow [2020-10-11 15:25:50,703 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions, 332 flow [2020-10-11 15:25:50,778 INFO L129 PetriNetUnfolder]: 11/193 cut-off events. [2020-10-11 15:25:50,778 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-11 15:25:50,785 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-10-11 15:25:50,790 INFO L117 LiptonReduction]: Number of co-enabled transitions 2884 [2020-10-11 15:25:50,949 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:50,983 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:50,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-10-11 15:25:51,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:51,027 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:51,028 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:25:51,059 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:51,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:51,092 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:51,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:51,120 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:51,121 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:25:53,235 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:53,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:53,281 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:53,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:53,311 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:53,313 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:25:53,335 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:53,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:53,369 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:53,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:53,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:53,398 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:25:55,675 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:55,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:55,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-10-11 15:25:55,734 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:55,736 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:55,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:25:55,752 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:55,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:55,790 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:55,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:55,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-10-11 15:25:55,818 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:25:57,905 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:57,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:57,935 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:57,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:57,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:57,964 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:25:57,976 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:58,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:58,012 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:58,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:58,038 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:58,039 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:00,078 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,136 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,164 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,164 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:26:00,178 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,202 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,227 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:26:00,362 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,392 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,417 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:00,430 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,465 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:00,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:00,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-10-11 15:26:00,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:02,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-10-11 15:26:02,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:02,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-10-11 15:26:02,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:02,988 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:02,988 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:03,005 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:03,031 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,050 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:03,052 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,052 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:05,074 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:05,106 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:05,110 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:05,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:05,129 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:05,129 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:05,146 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:05,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:05,171 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:05,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:05,201 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:05,202 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:07,223 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:07,247 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:07,251 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:07,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:07,271 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:07,271 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:07,282 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:07,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:07,306 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:07,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:07,323 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:07,323 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:09,531 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,570 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,591 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,591 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:09,606 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,639 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,666 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,667 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:11,854 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:11,897 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:11,933 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,933 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:11,989 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:12,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:12,027 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:12,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:12,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:12,054 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:14,222 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:14,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:14,248 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:14,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:14,266 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:14,266 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:14,283 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:14,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:14,312 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:14,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:14,343 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:14,343 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:16,613 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,635 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:26:16,670 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,693 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,711 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-11 15:26:18,766 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:18,800 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:18,825 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,825 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:18,843 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:18,869 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:18,895 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,895 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:20,932 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:20,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:20,958 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:20,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:20,991 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:20,992 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:21,009 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:21,036 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:21,057 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,057 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:23,184 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:23,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:23,213 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:23,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:23,240 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:23,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:23,254 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:23,285 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:23,289 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:23,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:23,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:23,314 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:25,632 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:25,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:25,662 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:25,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:25,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:25,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:25,690 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:25,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:25,713 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:25,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:25,728 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:25,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:27,803 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:27,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:27,827 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:27,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:27,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:27,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:27,861 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:27,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:27,891 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:27,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:27,917 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:27,918 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:29,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-10-11 15:26:29,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:30,000 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:30,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-10-11 15:26:30,021 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-11 15:26:30,083 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:30,110 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:30,133 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,133 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:30,142 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:30,169 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:30,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:30,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:32,445 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:32,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,475 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:32,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,495 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:32,496 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:32,504 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:32,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,537 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:32,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:32,559 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:32,559 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-11 15:26:34,596 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,622 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,642 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,643 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:26:34,654 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,682 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,700 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,700 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:26:34,713 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,735 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,750 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,750 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:34,762 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,783 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:34,800 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:34,800 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:36,966 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:36,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:36,996 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:37,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:37,019 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:37,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-11 15:26:37,029 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:37,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:37,061 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:37,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:37,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-10-11 15:26:37,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:26:39,826 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:39,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,851 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:39,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,868 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:39,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:39,876 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:39,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,898 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:39,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:39,920 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:39,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:42,814 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2020-10-11 15:26:42,954 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-10-11 15:26:43,608 WARN L193 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2020-10-11 15:26:43,626 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:43,999 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-10-11 15:26:44,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:44,006 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:44,230 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-11 15:26:44,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:44,231 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:44,231 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2020-10-11 15:26:44,416 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-11 15:26:45,424 WARN L193 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2020-10-11 15:26:45,450 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:45,956 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-11 15:26:45,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:45,965 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:46,375 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-11 15:26:46,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:46,376 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-10-11 15:26:46,376 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-11 15:26:46,835 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-11 15:26:47,109 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-11 15:26:47,377 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-11 15:26:47,391 INFO L132 LiptonReduction]: Checked pairs total: 6656 [2020-10-11 15:26:47,392 INFO L134 LiptonReduction]: Total number of compositions: 167 [2020-10-11 15:26:47,399 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-11 15:26:47,427 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-11 15:26:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-11 15:26:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-11 15:26:47,436 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:47,436 INFO L421 BasicCegarLoop]: trace histogram [1] [2020-10-11 15:26:47,437 INFO L429 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-10-11 15:26:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 557, now seen corresponding path program 1 times [2020-10-11 15:26:47,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:47,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63659854] [2020-10-11 15:26:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:47,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63659854] [2020-10-11 15:26:47,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:47,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-11 15:26:47,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562698820] [2020-10-11 15:26:47,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-11 15:26:47,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-11 15:26:47,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-11 15:26:47,716 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-11 15:26:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:47,751 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-11 15:26:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-11 15:26:47,752 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-11 15:26:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:47,770 INFO L225 Difference]: With dead ends: 423 [2020-10-11 15:26:47,770 INFO L226 Difference]: Without dead ends: 385 [2020-10-11 15:26:47,771 INFO L673 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-10-11 15:26:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-11 15:26:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-11 15:26:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-11 15:26:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-11 15:26:47,849 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-11 15:26:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:47,850 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-11 15:26:47,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-11 15:26:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-11 15:26:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-11 15:26:47,851 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:47,851 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-11 15:26:47,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:26:47,851 INFO L429 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-10-11 15:26:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash 17154767, now seen corresponding path program 1 times [2020-10-11 15:26:47,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:47,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279094100] [2020-10-11 15:26:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:48,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279094100] [2020-10-11 15:26:48,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:48,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:26:48,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659869138] [2020-10-11 15:26:48,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:26:48,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:26:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:26:48,071 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-11 15:26:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:48,171 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-11 15:26:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:26:48,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-11 15:26:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:48,177 INFO L225 Difference]: With dead ends: 540 [2020-10-11 15:26:48,178 INFO L226 Difference]: Without dead ends: 540 [2020-10-11 15:26:48,178 INFO L673 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-10-11 15:26:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-11 15:26:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-11 15:26:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-11 15:26:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-11 15:26:48,211 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-11 15:26:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:48,211 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-11 15:26:48,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:26:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-11 15:26:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-11 15:26:48,212 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:48,212 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-11 15:26:48,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:26:48,213 INFO L429 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-10-11 15:26:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash -694138238, now seen corresponding path program 1 times [2020-10-11 15:26:48,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:48,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944424089] [2020-10-11 15:26:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:48,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944424089] [2020-10-11 15:26:48,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:48,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:26:48,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8631953] [2020-10-11 15:26:48,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:26:48,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:48,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:26:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:26:48,321 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-10-11 15:26:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:48,475 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-10-11 15:26:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:26:48,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-11 15:26:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:48,482 INFO L225 Difference]: With dead ends: 599 [2020-10-11 15:26:48,483 INFO L226 Difference]: Without dead ends: 514 [2020-10-11 15:26:48,483 INFO L673 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-10-11 15:26:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-11 15:26:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-11 15:26:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-11 15:26:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-11 15:26:48,515 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-11 15:26:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:48,515 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-11 15:26:48,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:26:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-11 15:26:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-11 15:26:48,517 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:48,517 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:48,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:26:48,518 INFO L429 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-10-11 15:26:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1786983460, now seen corresponding path program 1 times [2020-10-11 15:26:48,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:48,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526349935] [2020-10-11 15:26:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:48,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526349935] [2020-10-11 15:26:48,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:48,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:26:48,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944878740] [2020-10-11 15:26:48,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:26:48,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:26:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:26:48,586 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-11 15:26:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:48,607 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-11 15:26:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:26:48,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-11 15:26:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:48,610 INFO L225 Difference]: With dead ends: 162 [2020-10-11 15:26:48,610 INFO L226 Difference]: Without dead ends: 162 [2020-10-11 15:26:48,610 INFO L673 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-10-11 15:26:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-11 15:26:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-11 15:26:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-11 15:26:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-11 15:26:48,617 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-11 15:26:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:48,617 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-11 15:26:48,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:26:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-11 15:26:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:48,620 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:48,620 INFO L421 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-10-11 15:26:48,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:26:48,620 INFO L429 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-10-11 15:26:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167552, now seen corresponding path program 1 times [2020-10-11 15:26:48,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:48,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243253529] [2020-10-11 15:26:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:49,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243253529] [2020-10-11 15:26:49,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:49,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:26:49,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2293195] [2020-10-11 15:26:49,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 15:26:49,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 15:26:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-11 15:26:49,298 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 12 states. [2020-10-11 15:26:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:50,336 INFO L93 Difference]: Finished difference Result 424 states and 841 transitions. [2020-10-11 15:26:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 15:26:50,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-11 15:26:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:50,340 INFO L225 Difference]: With dead ends: 424 [2020-10-11 15:26:50,341 INFO L226 Difference]: Without dead ends: 424 [2020-10-11 15:26:50,341 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-10-11 15:26:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-11 15:26:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 264. [2020-10-11 15:26:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-10-11 15:26:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 563 transitions. [2020-10-11 15:26:50,351 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 563 transitions. Word has length 22 [2020-10-11 15:26:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:50,352 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 563 transitions. [2020-10-11 15:26:50,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 15:26:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 563 transitions. [2020-10-11 15:26:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:50,354 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:50,355 INFO L421 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-10-11 15:26:50,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:26:50,355 INFO L429 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-10-11 15:26:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1425167535, now seen corresponding path program 1 times [2020-10-11 15:26:50,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:50,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905728262] [2020-10-11 15:26:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:50,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905728262] [2020-10-11 15:26:50,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:50,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:26:50,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768246704] [2020-10-11 15:26:50,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:26:50,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:26:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:26:50,500 INFO L87 Difference]: Start difference. First operand 264 states and 563 transitions. Second operand 6 states. [2020-10-11 15:26:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:50,616 INFO L93 Difference]: Finished difference Result 158 states and 264 transitions. [2020-10-11 15:26:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:26:50,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-11 15:26:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:50,617 INFO L225 Difference]: With dead ends: 158 [2020-10-11 15:26:50,618 INFO L226 Difference]: Without dead ends: 158 [2020-10-11 15:26:50,618 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:26:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-11 15:26:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-11 15:26:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-11 15:26:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 264 transitions. [2020-10-11 15:26:50,623 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 264 transitions. Word has length 22 [2020-10-11 15:26:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:50,623 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 264 transitions. [2020-10-11 15:26:50,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:26:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 264 transitions. [2020-10-11 15:26:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:50,624 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:50,624 INFO L421 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-10-11 15:26:50,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:26:50,625 INFO L429 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-10-11 15:26:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 864306409, now seen corresponding path program 1 times [2020-10-11 15:26:50,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:50,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081916506] [2020-10-11 15:26:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:50,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081916506] [2020-10-11 15:26:50,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:50,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:26:50,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103605497] [2020-10-11 15:26:50,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:26:50,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:26:50,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:26:50,767 INFO L87 Difference]: Start difference. First operand 158 states and 264 transitions. Second operand 8 states. [2020-10-11 15:26:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:51,075 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2020-10-11 15:26:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:26:51,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 15:26:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:51,078 INFO L225 Difference]: With dead ends: 164 [2020-10-11 15:26:51,078 INFO L226 Difference]: Without dead ends: 164 [2020-10-11 15:26:51,079 INFO L673 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-10-11 15:26:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-11 15:26:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2020-10-11 15:26:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-11 15:26:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2020-10-11 15:26:51,084 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 22 [2020-10-11 15:26:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:51,084 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2020-10-11 15:26:51,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:26:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2020-10-11 15:26:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:51,085 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:51,085 INFO L421 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-10-11 15:26:51,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:26:51,086 INFO L429 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-10-11 15:26:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash -412491025, now seen corresponding path program 2 times [2020-10-11 15:26:51,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:51,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559345322] [2020-10-11 15:26:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:51,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559345322] [2020-10-11 15:26:51,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:51,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:51,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397385548] [2020-10-11 15:26:51,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:51,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:51,918 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand 14 states. [2020-10-11 15:26:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:52,892 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2020-10-11 15:26:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:26:52,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:26:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:52,894 INFO L225 Difference]: With dead ends: 179 [2020-10-11 15:26:52,894 INFO L226 Difference]: Without dead ends: 165 [2020-10-11 15:26:52,895 INFO L673 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-10-11 15:26:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-11 15:26:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-10-11 15:26:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-11 15:26:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2020-10-11 15:26:52,903 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 22 [2020-10-11 15:26:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:52,904 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2020-10-11 15:26:52,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2020-10-11 15:26:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:52,905 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:52,905 INFO L421 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-10-11 15:26:52,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:26:52,905 INFO L429 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-10-11 15:26:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash -524474255, now seen corresponding path program 3 times [2020-10-11 15:26:52,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:52,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481073111] [2020-10-11 15:26:52,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:53,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481073111] [2020-10-11 15:26:53,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:53,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:53,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334260075] [2020-10-11 15:26:53,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:53,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:53,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:53,827 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 14 states. [2020-10-11 15:26:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:54,805 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2020-10-11 15:26:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 15:26:54,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:26:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:54,808 INFO L225 Difference]: With dead ends: 176 [2020-10-11 15:26:54,808 INFO L226 Difference]: Without dead ends: 163 [2020-10-11 15:26:54,809 INFO L673 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-10-11 15:26:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-11 15:26:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-10-11 15:26:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-11 15:26:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2020-10-11 15:26:54,815 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 22 [2020-10-11 15:26:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:54,816 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2020-10-11 15:26:54,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2020-10-11 15:26:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:54,817 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:54,817 INFO L421 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-10-11 15:26:54,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:26:54,817 INFO L429 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-10-11 15:26:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1681973083, now seen corresponding path program 2 times [2020-10-11 15:26:54,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:54,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313499169] [2020-10-11 15:26:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:54,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313499169] [2020-10-11 15:26:54,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:54,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 15:26:54,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488332679] [2020-10-11 15:26:54,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:26:54,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:26:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:26:54,997 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand 11 states. [2020-10-11 15:26:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:55,600 INFO L93 Difference]: Finished difference Result 223 states and 354 transitions. [2020-10-11 15:26:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:26:55,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-11 15:26:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:55,603 INFO L225 Difference]: With dead ends: 223 [2020-10-11 15:26:55,603 INFO L226 Difference]: Without dead ends: 223 [2020-10-11 15:26:55,604 INFO L673 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-10-11 15:26:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-10-11 15:26:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 174. [2020-10-11 15:26:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-11 15:26:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 274 transitions. [2020-10-11 15:26:55,608 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 274 transitions. Word has length 22 [2020-10-11 15:26:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:55,609 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 274 transitions. [2020-10-11 15:26:55,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:26:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2020-10-11 15:26:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:55,610 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:55,610 INFO L421 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-10-11 15:26:55,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:26:55,610 INFO L429 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-10-11 15:26:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:55,611 INFO L82 PathProgramCache]: Analyzing trace with hash 671772819, now seen corresponding path program 4 times [2020-10-11 15:26:55,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:55,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772499942] [2020-10-11 15:26:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:56,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772499942] [2020-10-11 15:26:56,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:56,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:56,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213132403] [2020-10-11 15:26:56,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:56,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:56,416 INFO L87 Difference]: Start difference. First operand 174 states and 274 transitions. Second operand 14 states. [2020-10-11 15:26:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:57,369 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-10-11 15:26:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:26:57,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:26:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:57,372 INFO L225 Difference]: With dead ends: 188 [2020-10-11 15:26:57,372 INFO L226 Difference]: Without dead ends: 180 [2020-10-11 15:26:57,373 INFO L673 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-10-11 15:26:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-11 15:26:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2020-10-11 15:26:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-11 15:26:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 273 transitions. [2020-10-11 15:26:57,377 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 273 transitions. Word has length 22 [2020-10-11 15:26:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:57,378 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 273 transitions. [2020-10-11 15:26:57,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 273 transitions. [2020-10-11 15:26:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:57,379 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:57,379 INFO L421 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-10-11 15:26:57,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:26:57,379 INFO L429 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-10-11 15:26:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:57,380 INFO L82 PathProgramCache]: Analyzing trace with hash -481747075, now seen corresponding path program 5 times [2020-10-11 15:26:57,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:57,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672200298] [2020-10-11 15:26:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:58,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672200298] [2020-10-11 15:26:58,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:58,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:58,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160523772] [2020-10-11 15:26:58,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:58,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:58,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:58,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:58,125 INFO L87 Difference]: Start difference. First operand 174 states and 273 transitions. Second operand 14 states. [2020-10-11 15:26:58,477 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-10-11 15:26:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:59,346 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2020-10-11 15:26:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:26:59,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:26:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:59,348 INFO L225 Difference]: With dead ends: 187 [2020-10-11 15:26:59,348 INFO L226 Difference]: Without dead ends: 174 [2020-10-11 15:26:59,349 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:26:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-11 15:26:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-10-11 15:26:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-11 15:26:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 264 transitions. [2020-10-11 15:26:59,355 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 264 transitions. Word has length 22 [2020-10-11 15:26:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:59,356 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 264 transitions. [2020-10-11 15:26:59,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 264 transitions. [2020-10-11 15:26:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:26:59,359 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:59,360 INFO L421 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-10-11 15:26:59,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:26:59,360 INFO L429 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-10-11 15:26:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash 186432761, now seen corresponding path program 6 times [2020-10-11 15:26:59,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:59,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693048640] [2020-10-11 15:26:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:00,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693048640] [2020-10-11 15:27:00,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:00,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:00,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227488889] [2020-10-11 15:27:00,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:00,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:00,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:00,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:00,186 INFO L87 Difference]: Start difference. First operand 170 states and 264 transitions. Second operand 14 states. [2020-10-11 15:27:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:01,091 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2020-10-11 15:27:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:01,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:01,092 INFO L225 Difference]: With dead ends: 180 [2020-10-11 15:27:01,093 INFO L226 Difference]: Without dead ends: 166 [2020-10-11 15:27:01,093 INFO L673 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-10-11 15:27:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-10-11 15:27:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-10-11 15:27:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-11 15:27:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2020-10-11 15:27:01,098 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 22 [2020-10-11 15:27:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:01,098 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2020-10-11 15:27:01,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2020-10-11 15:27:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:01,099 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:01,099 INFO L421 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-10-11 15:27:01,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:27:01,099 INFO L429 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-10-11 15:27:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1728779239, now seen corresponding path program 7 times [2020-10-11 15:27:01,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:01,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84475107] [2020-10-11 15:27:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:01,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84475107] [2020-10-11 15:27:01,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:01,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:01,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776806019] [2020-10-11 15:27:01,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:01,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:01,933 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand 14 states. [2020-10-11 15:27:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:02,814 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2020-10-11 15:27:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:27:02,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:02,816 INFO L225 Difference]: With dead ends: 172 [2020-10-11 15:27:02,816 INFO L226 Difference]: Without dead ends: 152 [2020-10-11 15:27:02,817 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-11 15:27:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-11 15:27:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-11 15:27:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-11 15:27:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2020-10-11 15:27:02,821 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 22 [2020-10-11 15:27:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:02,822 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2020-10-11 15:27:02,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2020-10-11 15:27:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:02,822 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:02,823 INFO L421 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-10-11 15:27:02,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 15:27:02,823 INFO L429 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-10-11 15:27:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1510347584, now seen corresponding path program 2 times [2020-10-11 15:27:02,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:02,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687438113] [2020-10-11 15:27:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:03,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687438113] [2020-10-11 15:27:03,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:03,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:27:03,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608571488] [2020-10-11 15:27:03,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:27:03,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:03,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:27:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:27:03,100 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand 9 states. [2020-10-11 15:27:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:03,454 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2020-10-11 15:27:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:27:03,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-11 15:27:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:03,456 INFO L225 Difference]: With dead ends: 188 [2020-10-11 15:27:03,456 INFO L226 Difference]: Without dead ends: 171 [2020-10-11 15:27:03,457 INFO L673 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-10-11 15:27:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-11 15:27:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2020-10-11 15:27:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-11 15:27:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 217 transitions. [2020-10-11 15:27:03,461 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 217 transitions. Word has length 22 [2020-10-11 15:27:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:03,462 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 217 transitions. [2020-10-11 15:27:03,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:27:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 217 transitions. [2020-10-11 15:27:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:03,463 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:03,463 INFO L421 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-10-11 15:27:03,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 15:27:03,463 INFO L429 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-10-11 15:27:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688272, now seen corresponding path program 3 times [2020-10-11 15:27:03,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:03,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013551800] [2020-10-11 15:27:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:03,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013551800] [2020-10-11 15:27:03,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:03,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:27:03,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943136775] [2020-10-11 15:27:03,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:27:03,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:27:03,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:27:03,749 INFO L87 Difference]: Start difference. First operand 135 states and 217 transitions. Second operand 9 states. [2020-10-11 15:27:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:04,117 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2020-10-11 15:27:04,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:27:04,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-11 15:27:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:04,120 INFO L225 Difference]: With dead ends: 171 [2020-10-11 15:27:04,120 INFO L226 Difference]: Without dead ends: 171 [2020-10-11 15:27:04,121 INFO L673 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-10-11 15:27:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-11 15:27:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2020-10-11 15:27:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-11 15:27:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 226 transitions. [2020-10-11 15:27:04,125 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 226 transitions. Word has length 22 [2020-10-11 15:27:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:04,125 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 226 transitions. [2020-10-11 15:27:04,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:27:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2020-10-11 15:27:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:04,126 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:04,126 INFO L421 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-10-11 15:27:04,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 15:27:04,127 INFO L429 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-10-11 15:27:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1730688289, now seen corresponding path program 8 times [2020-10-11 15:27:04,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:04,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393282288] [2020-10-11 15:27:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:05,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393282288] [2020-10-11 15:27:05,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:05,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:05,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096158785] [2020-10-11 15:27:05,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:05,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:05,027 INFO L87 Difference]: Start difference. First operand 140 states and 226 transitions. Second operand 14 states. [2020-10-11 15:27:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:06,054 INFO L93 Difference]: Finished difference Result 171 states and 271 transitions. [2020-10-11 15:27:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:06,054 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:06,055 INFO L225 Difference]: With dead ends: 171 [2020-10-11 15:27:06,056 INFO L226 Difference]: Without dead ends: 143 [2020-10-11 15:27:06,056 INFO L673 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-10-11 15:27:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-11 15:27:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2020-10-11 15:27:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-11 15:27:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 225 transitions. [2020-10-11 15:27:06,060 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 225 transitions. Word has length 22 [2020-10-11 15:27:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:06,060 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 225 transitions. [2020-10-11 15:27:06,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 225 transitions. [2020-10-11 15:27:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:06,060 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:06,061 INFO L421 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-10-11 15:27:06,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 15:27:06,061 INFO L429 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-10-11 15:27:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655162, now seen corresponding path program 4 times [2020-10-11 15:27:06,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:06,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425336856] [2020-10-11 15:27:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:06,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425336856] [2020-10-11 15:27:06,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:06,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:27:06,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961245334] [2020-10-11 15:27:06,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:27:06,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:27:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:27:06,347 INFO L87 Difference]: Start difference. First operand 140 states and 225 transitions. Second operand 9 states. [2020-10-11 15:27:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:06,686 INFO L93 Difference]: Finished difference Result 176 states and 276 transitions. [2020-10-11 15:27:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 15:27:06,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-11 15:27:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:06,688 INFO L225 Difference]: With dead ends: 176 [2020-10-11 15:27:06,688 INFO L226 Difference]: Without dead ends: 176 [2020-10-11 15:27:06,689 INFO L673 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-10-11 15:27:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-11 15:27:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2020-10-11 15:27:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-11 15:27:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-10-11 15:27:06,693 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 22 [2020-10-11 15:27:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:06,693 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-10-11 15:27:06,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:27:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-10-11 15:27:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:06,694 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:06,694 INFO L421 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-10-11 15:27:06,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 15:27:06,694 INFO L429 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-10-11 15:27:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:06,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1523655179, now seen corresponding path program 9 times [2020-10-11 15:27:06,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:06,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328014150] [2020-10-11 15:27:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:07,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328014150] [2020-10-11 15:27:07,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:07,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:07,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7140437] [2020-10-11 15:27:07,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:07,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:07,623 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 14 states. [2020-10-11 15:27:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:08,641 INFO L93 Difference]: Finished difference Result 147 states and 237 transitions. [2020-10-11 15:27:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:08,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:08,643 INFO L225 Difference]: With dead ends: 147 [2020-10-11 15:27:08,643 INFO L226 Difference]: Without dead ends: 125 [2020-10-11 15:27:08,643 INFO L673 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-10-11 15:27:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-11 15:27:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2020-10-11 15:27:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-11 15:27:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 175 transitions. [2020-10-11 15:27:08,647 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 175 transitions. Word has length 22 [2020-10-11 15:27:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:08,647 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 175 transitions. [2020-10-11 15:27:08,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 175 transitions. [2020-10-11 15:27:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:08,648 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:08,648 INFO L421 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-10-11 15:27:08,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 15:27:08,649 INFO L429 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-10-11 15:27:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1986983371, now seen corresponding path program 10 times [2020-10-11 15:27:08,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:08,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659879072] [2020-10-11 15:27:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:09,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659879072] [2020-10-11 15:27:09,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:09,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:09,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484104138] [2020-10-11 15:27:09,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:09,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:09,397 INFO L87 Difference]: Start difference. First operand 109 states and 175 transitions. Second operand 14 states. [2020-10-11 15:27:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:10,434 INFO L93 Difference]: Finished difference Result 148 states and 232 transitions. [2020-10-11 15:27:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:27:10,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:10,436 INFO L225 Difference]: With dead ends: 148 [2020-10-11 15:27:10,436 INFO L226 Difference]: Without dead ends: 134 [2020-10-11 15:27:10,436 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-11 15:27:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-11 15:27:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2020-10-11 15:27:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-11 15:27:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 173 transitions. [2020-10-11 15:27:10,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 173 transitions. Word has length 22 [2020-10-11 15:27:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:10,439 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 173 transitions. [2020-10-11 15:27:10,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 173 transitions. [2020-10-11 15:27:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:10,440 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:10,440 INFO L421 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-10-11 15:27:10,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 15:27:10,441 INFO L429 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-10-11 15:27:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1039623051, now seen corresponding path program 11 times [2020-10-11 15:27:10,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:10,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367210215] [2020-10-11 15:27:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:11,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367210215] [2020-10-11 15:27:11,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:11,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:11,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695241379] [2020-10-11 15:27:11,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:11,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:11,233 INFO L87 Difference]: Start difference. First operand 109 states and 173 transitions. Second operand 14 states. [2020-10-11 15:27:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:12,167 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2020-10-11 15:27:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:27:12,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:12,169 INFO L225 Difference]: With dead ends: 140 [2020-10-11 15:27:12,169 INFO L226 Difference]: Without dead ends: 124 [2020-10-11 15:27:12,169 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-11 15:27:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2020-10-11 15:27:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-11 15:27:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 157 transitions. [2020-10-11 15:27:12,173 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 157 transitions. Word has length 22 [2020-10-11 15:27:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:12,173 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 157 transitions. [2020-10-11 15:27:12,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2020-10-11 15:27:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:12,174 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:12,174 INFO L421 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-10-11 15:27:12,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 15:27:12,174 INFO L429 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-10-11 15:27:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2100578423, now seen corresponding path program 12 times [2020-10-11 15:27:12,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:12,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295658564] [2020-10-11 15:27:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:13,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295658564] [2020-10-11 15:27:13,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:13,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:13,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939121598] [2020-10-11 15:27:13,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:13,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:13,056 INFO L87 Difference]: Start difference. First operand 99 states and 157 transitions. Second operand 14 states. [2020-10-11 15:27:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:14,018 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2020-10-11 15:27:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:14,018 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:14,019 INFO L225 Difference]: With dead ends: 138 [2020-10-11 15:27:14,020 INFO L226 Difference]: Without dead ends: 105 [2020-10-11 15:27:14,020 INFO L673 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-10-11 15:27:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-11 15:27:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-10-11 15:27:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-11 15:27:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2020-10-11 15:27:14,024 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 22 [2020-10-11 15:27:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:14,025 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2020-10-11 15:27:14,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2020-10-11 15:27:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:14,025 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:14,025 INFO L421 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-10-11 15:27:14,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 15:27:14,026 INFO L429 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-10-11 15:27:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1068559361, now seen corresponding path program 13 times [2020-10-11 15:27:14,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:14,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017898549] [2020-10-11 15:27:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:15,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017898549] [2020-10-11 15:27:15,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:15,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:15,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412283542] [2020-10-11 15:27:15,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:15,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:15,007 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand 14 states. [2020-10-11 15:27:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:16,022 INFO L93 Difference]: Finished difference Result 126 states and 193 transitions. [2020-10-11 15:27:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:16,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:16,024 INFO L225 Difference]: With dead ends: 126 [2020-10-11 15:27:16,024 INFO L226 Difference]: Without dead ends: 92 [2020-10-11 15:27:16,025 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-11 15:27:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2020-10-11 15:27:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-11 15:27:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2020-10-11 15:27:16,029 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 22 [2020-10-11 15:27:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:16,029 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2020-10-11 15:27:16,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2020-10-11 15:27:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:16,030 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:16,030 INFO L421 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-10-11 15:27:16,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 15:27:16,030 INFO L429 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-10-11 15:27:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:16,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1273870831, now seen corresponding path program 14 times [2020-10-11 15:27:16,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:16,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972227468] [2020-10-11 15:27:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:16,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972227468] [2020-10-11 15:27:16,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:16,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:16,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391917286] [2020-10-11 15:27:16,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:16,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:16,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:16,875 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand 14 states. [2020-10-11 15:27:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:17,732 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2020-10-11 15:27:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:17,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:17,733 INFO L225 Difference]: With dead ends: 95 [2020-10-11 15:27:17,733 INFO L226 Difference]: Without dead ends: 80 [2020-10-11 15:27:17,734 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-11 15:27:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-11 15:27:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-11 15:27:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2020-10-11 15:27:17,737 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 22 [2020-10-11 15:27:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:17,737 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2020-10-11 15:27:17,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2020-10-11 15:27:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:17,738 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:17,738 INFO L421 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-10-11 15:27:17,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 15:27:17,738 INFO L429 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-10-11 15:27:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash 341292095, now seen corresponding path program 15 times [2020-10-11 15:27:17,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:17,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392427343] [2020-10-11 15:27:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:18,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392427343] [2020-10-11 15:27:18,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:18,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:18,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688403909] [2020-10-11 15:27:18,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:18,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:18,597 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand 14 states. [2020-10-11 15:27:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:19,583 INFO L93 Difference]: Finished difference Result 110 states and 172 transitions. [2020-10-11 15:27:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:19,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:19,585 INFO L225 Difference]: With dead ends: 110 [2020-10-11 15:27:19,585 INFO L226 Difference]: Without dead ends: 77 [2020-10-11 15:27:19,586 INFO L673 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-10-11 15:27:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-11 15:27:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-11 15:27:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-11 15:27:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2020-10-11 15:27:19,589 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 22 [2020-10-11 15:27:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:19,589 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2020-10-11 15:27:19,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2020-10-11 15:27:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:19,589 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:19,590 INFO L421 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-10-11 15:27:19,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-11 15:27:19,590 INFO L429 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-10-11 15:27:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2099874535, now seen corresponding path program 16 times [2020-10-11 15:27:19,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:19,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377560062] [2020-10-11 15:27:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:20,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377560062] [2020-10-11 15:27:20,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:20,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:20,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028629819] [2020-10-11 15:27:20,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:20,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:20,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:20,482 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand 14 states. [2020-10-11 15:27:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:21,466 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2020-10-11 15:27:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:21,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:21,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:21,468 INFO L225 Difference]: With dead ends: 111 [2020-10-11 15:27:21,468 INFO L226 Difference]: Without dead ends: 80 [2020-10-11 15:27:21,469 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-11 15:27:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-10-11 15:27:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-11 15:27:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2020-10-11 15:27:21,473 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 22 [2020-10-11 15:27:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:21,473 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2020-10-11 15:27:21,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2020-10-11 15:27:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:21,474 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:21,474 INFO L421 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-10-11 15:27:21,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-11 15:27:21,475 INFO L429 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-10-11 15:27:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1892841425, now seen corresponding path program 17 times [2020-10-11 15:27:21,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:21,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702408086] [2020-10-11 15:27:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:22,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702408086] [2020-10-11 15:27:22,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:22,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:22,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104371139] [2020-10-11 15:27:22,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:22,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:22,361 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand 14 states. [2020-10-11 15:27:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:23,322 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2020-10-11 15:27:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:23,323 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:23,324 INFO L225 Difference]: With dead ends: 128 [2020-10-11 15:27:23,324 INFO L226 Difference]: Without dead ends: 103 [2020-10-11 15:27:23,324 INFO L673 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-10-11 15:27:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-11 15:27:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2020-10-11 15:27:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-11 15:27:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2020-10-11 15:27:23,328 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 22 [2020-10-11 15:27:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:23,328 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2020-10-11 15:27:23,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2020-10-11 15:27:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:23,329 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:23,329 INFO L421 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-10-11 15:27:23,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-11 15:27:23,329 INFO L429 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-10-11 15:27:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1938797679, now seen corresponding path program 18 times [2020-10-11 15:27:23,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:23,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224493716] [2020-10-11 15:27:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:24,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224493716] [2020-10-11 15:27:24,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:24,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:24,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446494967] [2020-10-11 15:27:24,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:24,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:24,077 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand 14 states. [2020-10-11 15:27:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:25,088 INFO L93 Difference]: Finished difference Result 134 states and 212 transitions. [2020-10-11 15:27:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:27:25,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:25,090 INFO L225 Difference]: With dead ends: 134 [2020-10-11 15:27:25,090 INFO L226 Difference]: Without dead ends: 117 [2020-10-11 15:27:25,090 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-11 15:27:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-11 15:27:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2020-10-11 15:27:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-11 15:27:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2020-10-11 15:27:25,093 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 22 [2020-10-11 15:27:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:25,093 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2020-10-11 15:27:25,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2020-10-11 15:27:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:25,094 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:25,094 INFO L421 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-10-11 15:27:25,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-11 15:27:25,094 INFO L429 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-10-11 15:27:25,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:25,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1408809297, now seen corresponding path program 19 times [2020-10-11 15:27:25,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:25,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585606339] [2020-10-11 15:27:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:26,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585606339] [2020-10-11 15:27:26,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:26,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:26,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872760964] [2020-10-11 15:27:26,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:26,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:26,075 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand 14 states. [2020-10-11 15:27:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:27,016 INFO L93 Difference]: Finished difference Result 126 states and 196 transitions. [2020-10-11 15:27:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:27:27,016 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:27,017 INFO L225 Difference]: With dead ends: 126 [2020-10-11 15:27:27,018 INFO L226 Difference]: Without dead ends: 107 [2020-10-11 15:27:27,018 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-11 15:27:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2020-10-11 15:27:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-11 15:27:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2020-10-11 15:27:27,021 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 22 [2020-10-11 15:27:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:27,022 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2020-10-11 15:27:27,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2020-10-11 15:27:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:27,022 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:27,022 INFO L421 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-10-11 15:27:27,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-11 15:27:27,023 INFO L429 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-10-11 15:27:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1825202627, now seen corresponding path program 20 times [2020-10-11 15:27:27,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:27,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503267524] [2020-10-11 15:27:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:28,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-10-11 15:27:28,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503267524] [2020-10-11 15:27:28,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:28,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:28,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043380846] [2020-10-11 15:27:28,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:28,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:28,048 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand 14 states. [2020-10-11 15:27:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:29,036 INFO L93 Difference]: Finished difference Result 123 states and 196 transitions. [2020-10-11 15:27:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:29,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:29,037 INFO L225 Difference]: With dead ends: 123 [2020-10-11 15:27:29,037 INFO L226 Difference]: Without dead ends: 87 [2020-10-11 15:27:29,038 INFO L673 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-10-11 15:27:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-11 15:27:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-10-11 15:27:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-11 15:27:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2020-10-11 15:27:29,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 22 [2020-10-11 15:27:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:29,041 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2020-10-11 15:27:29,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2020-10-11 15:27:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:29,042 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:29,042 INFO L421 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-10-11 15:27:29,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-11 15:27:29,042 INFO L429 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-10-11 15:27:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash -699373115, now seen corresponding path program 21 times [2020-10-11 15:27:29,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:29,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774030501] [2020-10-11 15:27:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:29,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774030501] [2020-10-11 15:27:29,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:29,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:29,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091638737] [2020-10-11 15:27:29,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:29,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:29,942 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand 14 states. [2020-10-11 15:27:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:30,943 INFO L93 Difference]: Finished difference Result 108 states and 168 transitions. [2020-10-11 15:27:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:30,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:30,945 INFO L225 Difference]: With dead ends: 108 [2020-10-11 15:27:30,945 INFO L226 Difference]: Without dead ends: 62 [2020-10-11 15:27:30,945 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-11 15:27:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-11 15:27:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-11 15:27:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2020-10-11 15:27:30,947 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 22 [2020-10-11 15:27:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:30,948 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2020-10-11 15:27:30,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2020-10-11 15:27:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:30,948 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:30,948 INFO L421 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-10-11 15:27:30,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-11 15:27:30,949 INFO L429 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-10-11 15:27:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash -675636301, now seen corresponding path program 22 times [2020-10-11 15:27:30,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:30,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313170586] [2020-10-11 15:27:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:31,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313170586] [2020-10-11 15:27:31,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:31,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:31,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962774830] [2020-10-11 15:27:31,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:31,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:31,820 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand 14 states. [2020-10-11 15:27:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:32,756 INFO L93 Difference]: Finished difference Result 92 states and 143 transitions. [2020-10-11 15:27:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:32,757 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:32,758 INFO L225 Difference]: With dead ends: 92 [2020-10-11 15:27:32,758 INFO L226 Difference]: Without dead ends: 61 [2020-10-11 15:27:32,759 INFO L673 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-10-11 15:27:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-11 15:27:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-11 15:27:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-11 15:27:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2020-10-11 15:27:32,761 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 22 [2020-10-11 15:27:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:32,761 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2020-10-11 15:27:32,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2020-10-11 15:27:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:32,762 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:32,762 INFO L421 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-10-11 15:27:32,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-11 15:27:32,762 INFO L429 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-10-11 15:27:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:32,763 INFO L82 PathProgramCache]: Analyzing trace with hash -882669411, now seen corresponding path program 23 times [2020-10-11 15:27:32,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:32,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731910710] [2020-10-11 15:27:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:33,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731910710] [2020-10-11 15:27:33,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:33,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:33,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078948657] [2020-10-11 15:27:33,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:33,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:33,623 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand 14 states. [2020-10-11 15:27:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:34,640 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2020-10-11 15:27:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:34,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:34,643 INFO L225 Difference]: With dead ends: 109 [2020-10-11 15:27:34,643 INFO L226 Difference]: Without dead ends: 84 [2020-10-11 15:27:34,643 INFO L673 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-10-11 15:27:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-11 15:27:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2020-10-11 15:27:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-11 15:27:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2020-10-11 15:27:34,646 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 22 [2020-10-11 15:27:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:34,646 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2020-10-11 15:27:34,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2020-10-11 15:27:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:34,647 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:34,647 INFO L421 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-10-11 15:27:34,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-11 15:27:34,647 INFO L429 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-10-11 15:27:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash -419341219, now seen corresponding path program 24 times [2020-10-11 15:27:34,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:34,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813869785] [2020-10-11 15:27:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:35,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813869785] [2020-10-11 15:27:35,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:35,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:35,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555695855] [2020-10-11 15:27:35,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:35,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:35,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:35,392 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand 14 states. [2020-10-11 15:27:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:36,344 INFO L93 Difference]: Finished difference Result 115 states and 180 transitions. [2020-10-11 15:27:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:27:36,345 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:36,346 INFO L225 Difference]: With dead ends: 115 [2020-10-11 15:27:36,346 INFO L226 Difference]: Without dead ends: 98 [2020-10-11 15:27:36,347 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-11 15:27:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-11 15:27:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2020-10-11 15:27:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-11 15:27:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2020-10-11 15:27:36,349 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 22 [2020-10-11 15:27:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:36,349 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2020-10-11 15:27:36,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2020-10-11 15:27:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:36,350 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:36,350 INFO L421 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-10-11 15:27:36,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-11 15:27:36,350 INFO L429 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-10-11 15:27:36,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1366701539, now seen corresponding path program 25 times [2020-10-11 15:27:36,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:36,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239774130] [2020-10-11 15:27:36,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:37,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239774130] [2020-10-11 15:27:37,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:37,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:37,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472297525] [2020-10-11 15:27:37,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:37,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:37,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:37,096 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand 14 states. [2020-10-11 15:27:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:37,903 INFO L93 Difference]: Finished difference Result 107 states and 164 transitions. [2020-10-11 15:27:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:27:37,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:37,905 INFO L225 Difference]: With dead ends: 107 [2020-10-11 15:27:37,905 INFO L226 Difference]: Without dead ends: 88 [2020-10-11 15:27:37,905 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-11 15:27:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-10-11 15:27:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-11 15:27:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 102 transitions. [2020-10-11 15:27:37,907 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 102 transitions. Word has length 22 [2020-10-11 15:27:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:37,908 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 102 transitions. [2020-10-11 15:27:37,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2020-10-11 15:27:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:37,908 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:37,908 INFO L421 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-10-11 15:27:37,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-11 15:27:37,908 INFO L429 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-10-11 15:27:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -305746167, now seen corresponding path program 26 times [2020-10-11 15:27:37,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:37,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102560583] [2020-10-11 15:27:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:38,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102560583] [2020-10-11 15:27:38,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:38,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:38,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401176281] [2020-10-11 15:27:38,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:38,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:38,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:38,770 INFO L87 Difference]: Start difference. First operand 65 states and 102 transitions. Second operand 14 states. [2020-10-11 15:27:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:39,663 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2020-10-11 15:27:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:39,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:39,664 INFO L225 Difference]: With dead ends: 95 [2020-10-11 15:27:39,664 INFO L226 Difference]: Without dead ends: 59 [2020-10-11 15:27:39,664 INFO L673 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-10-11 15:27:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-11 15:27:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-11 15:27:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-11 15:27:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 92 transitions. [2020-10-11 15:27:39,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 92 transitions. Word has length 22 [2020-10-11 15:27:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:39,669 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 92 transitions. [2020-10-11 15:27:39,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 92 transitions. [2020-10-11 15:27:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:39,669 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:39,669 INFO L421 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-10-11 15:27:39,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-11 15:27:39,670 INFO L429 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-10-11 15:27:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2008695741, now seen corresponding path program 27 times [2020-10-11 15:27:39,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:39,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057150268] [2020-10-11 15:27:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:40,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057150268] [2020-10-11 15:27:40,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:40,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:40,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664456481] [2020-10-11 15:27:40,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:40,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:40,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:40,602 INFO L87 Difference]: Start difference. First operand 59 states and 92 transitions. Second operand 14 states. [2020-10-11 15:27:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:41,543 INFO L93 Difference]: Finished difference Result 88 states and 136 transitions. [2020-10-11 15:27:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:41,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:41,544 INFO L225 Difference]: With dead ends: 88 [2020-10-11 15:27:41,545 INFO L226 Difference]: Without dead ends: 63 [2020-10-11 15:27:41,545 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-11 15:27:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-10-11 15:27:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-11 15:27:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2020-10-11 15:27:41,547 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 22 [2020-10-11 15:27:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:41,547 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2020-10-11 15:27:41,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2020-10-11 15:27:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:41,547 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:41,547 INFO L421 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-10-11 15:27:41,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-11 15:27:41,548 INFO L429 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-10-11 15:27:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 287585121, now seen corresponding path program 28 times [2020-10-11 15:27:41,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:41,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507994476] [2020-10-11 15:27:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:42,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507994476] [2020-10-11 15:27:42,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:42,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:42,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226475946] [2020-10-11 15:27:42,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:42,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:42,309 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 14 states. [2020-10-11 15:27:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:43,289 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2020-10-11 15:27:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:27:43,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:43,290 INFO L225 Difference]: With dead ends: 85 [2020-10-11 15:27:43,290 INFO L226 Difference]: Without dead ends: 68 [2020-10-11 15:27:43,290 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2020-10-11 15:27:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-11 15:27:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-10-11 15:27:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-11 15:27:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2020-10-11 15:27:43,293 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 22 [2020-10-11 15:27:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:43,293 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2020-10-11 15:27:43,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2020-10-11 15:27:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:43,294 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:43,294 INFO L421 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-10-11 15:27:43,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-11 15:27:43,294 INFO L429 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-10-11 15:27:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash -659775199, now seen corresponding path program 29 times [2020-10-11 15:27:43,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:43,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653148270] [2020-10-11 15:27:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:44,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653148270] [2020-10-11 15:27:44,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:44,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:44,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892729164] [2020-10-11 15:27:44,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:44,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:44,044 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 14 states. [2020-10-11 15:27:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:44,909 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2020-10-11 15:27:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:27:44,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:44,910 INFO L225 Difference]: With dead ends: 77 [2020-10-11 15:27:44,911 INFO L226 Difference]: Without dead ends: 58 [2020-10-11 15:27:44,911 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-11 15:27:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2020-10-11 15:27:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-11 15:27:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2020-10-11 15:27:44,914 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 22 [2020-10-11 15:27:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:44,914 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2020-10-11 15:27:44,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2020-10-11 15:27:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:27:44,915 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:27:44,915 INFO L421 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-10-11 15:27:44,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-11 15:27:44,915 INFO L429 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-10-11 15:27:44,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:27:44,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1650897763, now seen corresponding path program 30 times [2020-10-11 15:27:44,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:27:44,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551446024] [2020-10-11 15:27:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:27:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:27:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:27:45,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551446024] [2020-10-11 15:27:45,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:27:45,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:27:45,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792958773] [2020-10-11 15:27:45,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:27:45,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:27:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:27:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:27:45,960 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 14 states. [2020-10-11 15:27:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:27:46,839 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2020-10-11 15:27:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:27:46,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-11 15:27:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:27:46,840 INFO L225 Difference]: With dead ends: 48 [2020-10-11 15:27:46,840 INFO L226 Difference]: Without dead ends: 0 [2020-10-11 15:27:46,840 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:27:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-11 15:27:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-11 15:27:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-11 15:27:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-11 15:27:46,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-11 15:27:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:27:46,841 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-11 15:27:46,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:27:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-11 15:27:46,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-11 15:27:46,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-11 15:27:46,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:27:46 BasicIcfg [2020-10-11 15:27:46,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:27:46,850 INFO L168 Benchmark]: Toolchain (without parser) took 118546.96 ms. Allocated memory was 243.3 MB in the beginning and 825.8 MB in the end (delta: 582.5 MB). Free memory was 196.1 MB in the beginning and 464.0 MB in the end (delta: -267.9 MB). Peak memory consumption was 314.6 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:46,852 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 243.3 MB. Free memory is still 219.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:27:46,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1224.11 ms. Allocated memory was 243.3 MB in the beginning and 346.0 MB in the end (delta: 102.8 MB). Free memory was 196.1 MB in the beginning and 316.7 MB in the end (delta: -120.5 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:46,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.96 ms. Allocated memory is still 346.0 MB. Free memory was 316.7 MB in the beginning and 311.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:46,853 INFO L168 Benchmark]: Boogie Preprocessor took 92.39 ms. Allocated memory is still 346.0 MB. Free memory is still 311.8 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:27:46,853 INFO L168 Benchmark]: RCFGBuilder took 834.40 ms. Allocated memory is still 346.0 MB. Free memory was 311.8 MB in the beginning and 261.4 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:46,854 INFO L168 Benchmark]: TraceAbstraction took 116309.91 ms. Allocated memory was 346.0 MB in the beginning and 825.8 MB in the end (delta: 479.7 MB). Free memory was 261.4 MB in the beginning and 464.0 MB in the end (delta: -202.6 MB). Peak memory consumption was 277.1 MB. Max. memory is 14.2 GB. [2020-10-11 15:27:46,857 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.22 ms. Allocated memory is still 243.3 MB. Free memory is still 219.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1224.11 ms. Allocated memory was 243.3 MB in the beginning and 346.0 MB in the end (delta: 102.8 MB). Free memory was 196.1 MB in the beginning and 316.7 MB in the end (delta: -120.5 MB). Peak memory consumption was 109.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 79.96 ms. Allocated memory is still 346.0 MB. Free memory was 316.7 MB in the beginning and 311.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 92.39 ms. Allocated memory is still 346.0 MB. Free memory is still 311.8 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 834.40 ms. Allocated memory is still 346.0 MB. Free memory was 311.8 MB in the beginning and 261.4 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 116309.91 ms. Allocated memory was 346.0 MB in the beginning and 825.8 MB in the end (delta: 479.7 MB). Free memory was 261.4 MB in the beginning and 464.0 MB in the end (delta: -202.6 MB). Peak memory consumption was 277.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1927 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 48.0s, 164 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 56.6s, 151 PlacesBefore, 41 PlacesAfterwards, 155 TransitionsBefore, 40 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 7 FixpointIterations, 87 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 167 TotalNumberOfCompositions, 6656 MoverChecksTotal - 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: 116.1s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 56.7s, HoareTripleCheckerStatistics: 854 SDtfs, 1700 SDslu, 4176 SDs, 0 SdLazy, 10914 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 22 SyntacticMatches, 73 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 37.7s 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, 0.9s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 431956 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...