/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 00:53:30,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 00:53:30,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 00:53:31,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 00:53:31,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 00:53:31,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 00:53:31,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 00:53:31,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 00:53:31,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 00:53:31,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 00:53:31,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 00:53:31,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 00:53:31,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 00:53:31,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 00:53:31,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 00:53:31,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 00:53:31,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 00:53:31,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 00:53:31,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 00:53:31,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 00:53:31,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 00:53:31,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 00:53:31,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 00:53:31,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 00:53:31,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 00:53:31,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 00:53:31,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 00:53:31,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 00:53:31,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 00:53:31,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 00:53:31,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 00:53:31,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 00:53:31,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 00:53:31,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 00:53:31,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 00:53:31,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 00:53:31,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 00:53:31,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 00:53:31,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 00:53:31,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 00:53:31,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 00:53:31,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-12 00:53:31,166 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 00:53:31,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 00:53:31,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 00:53:31,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 00:53:31,173 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 00:53:31,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 00:53:31,173 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 00:53:31,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 00:53:31,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 00:53:31,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 00:53:31,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 00:53:31,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 00:53:31,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 00:53:31,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 00:53:31,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 00:53:31,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 00:53:31,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 00:53:31,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 00:53:31,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 00:53:31,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 00:53:31,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 00:53:31,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:53:31,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 00:53:31,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 00:53:31,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 00:53:31,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 00:53:31,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 00:53:31,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 00:53:31,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-12 00:53:31,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 00:53:31,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 00:53:31,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 00:53:31,693 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 00:53:31,694 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 00:53:31,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-11-12 00:53:31,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285b03e70/6c2dfb0fa8174175b2b6dbf554f68851/FLAG4ef5f6c70 [2020-11-12 00:53:32,651 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 00:53:32,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-11-12 00:53:32,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285b03e70/6c2dfb0fa8174175b2b6dbf554f68851/FLAG4ef5f6c70 [2020-11-12 00:53:32,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285b03e70/6c2dfb0fa8174175b2b6dbf554f68851 [2020-11-12 00:53:32,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 00:53:32,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 00:53:32,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 00:53:32,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 00:53:32,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 00:53:32,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:32" (1/1) ... [2020-11-12 00:53:32,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55199930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:32, skipping insertion in model container [2020-11-12 00:53:32,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:32" (1/1) ... [2020-11-12 00:53:32,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 00:53:32,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 00:53:33,133 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-12 00:53:33,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:53:33,833 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 00:53:33,850 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-12 00:53:33,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:53:34,115 INFO L208 MainTranslator]: Completed translation [2020-11-12 00:53:34,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34 WrapperNode [2020-11-12 00:53:34,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 00:53:34,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 00:53:34,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 00:53:34,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 00:53:34,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 00:53:34,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 00:53:34,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 00:53:34,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 00:53:34,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (1/1) ... [2020-11-12 00:53:34,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 00:53:34,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 00:53:34,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 00:53:34,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 00:53:34,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (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-11-12 00:53:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-11-12 00:53:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-11-12 00:53:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 00:53:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-12 00:53:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 00:53:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-12 00:53:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 00:53:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-12 00:53:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-12 00:53:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 00:53:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 00:53:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 00:53:34,449 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 00:53:35,548 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 00:53:35,548 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-11-12 00:53:35,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:35 BoogieIcfgContainer [2020-11-12 00:53:35,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 00:53:35,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 00:53:35,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 00:53:35,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 00:53:35,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:53:32" (1/3) ... [2020-11-12 00:53:35,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e2ccd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:35, skipping insertion in model container [2020-11-12 00:53:35,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:34" (2/3) ... [2020-11-12 00:53:35,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e2ccd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:35, skipping insertion in model container [2020-11-12 00:53:35,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:35" (3/3) ... [2020-11-12 00:53:35,563 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2020-11-12 00:53:35,584 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 00:53:35,584 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 00:53:35,588 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-11-12 00:53:35,590 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 00:53:35,715 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,715 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,715 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,716 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,716 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,716 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,716 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,716 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,717 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,717 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,717 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,717 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,718 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,718 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,718 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,718 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,719 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,719 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,719 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,719 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,720 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,720 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,720 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,720 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,720 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,721 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,721 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,721 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,721 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,721 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,721 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,722 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,722 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,722 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,722 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,722 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,723 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,723 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,723 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,723 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,723 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,724 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,724 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,724 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,724 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,724 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,725 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,725 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,725 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,725 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,725 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,725 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,726 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,726 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,726 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,726 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,726 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,726 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,727 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,727 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,727 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,727 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,727 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,728 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,728 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,728 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,728 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,728 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,728 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,729 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,729 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,729 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,729 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,729 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,730 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,730 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,730 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,730 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,730 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,730 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,731 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,731 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,731 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,731 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,731 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,732 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,732 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,732 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,732 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,732 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,732 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,733 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,733 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,733 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,733 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,733 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,734 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,734 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,734 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,734 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,734 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,735 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,735 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,735 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,735 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,736 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,736 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,736 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,736 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,736 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,737 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,737 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,737 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,737 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,737 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,738 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,738 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,738 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,738 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,738 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,739 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,739 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,739 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,739 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,739 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,740 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,740 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,740 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,740 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,740 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,741 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,741 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,741 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,741 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,741 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,742 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,742 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,742 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,742 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,742 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,743 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,743 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,743 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,743 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,743 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,744 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,744 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,744 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,744 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,745 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,745 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,745 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,745 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,745 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,746 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,746 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,746 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,746 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,746 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,746 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,747 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,747 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,747 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,747 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,747 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,748 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,748 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,748 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,748 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,748 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,749 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,749 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,749 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,749 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,749 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,750 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,750 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,750 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,750 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,750 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,751 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,751 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,751 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,751 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,752 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,752 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,752 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,752 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,752 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,752 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,753 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,753 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,753 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,753 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,753 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,754 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,754 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,754 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,754 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,754 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,754 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,755 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,755 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,755 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,755 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,755 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,756 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,756 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,756 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,756 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,756 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,756 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,757 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,757 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,757 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,757 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,757 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,758 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,758 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,758 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,758 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,758 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,759 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,759 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,759 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,759 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,759 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,759 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,760 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,760 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,760 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,760 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,761 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,761 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,761 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,761 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,761 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,762 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,765 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,766 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,766 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,766 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,766 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,766 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,767 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,767 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,767 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,767 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,768 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,768 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,768 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,768 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,768 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,769 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,769 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,769 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,769 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,769 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,770 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,770 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,770 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,770 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,770 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,771 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,771 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,771 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,771 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,771 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,771 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,772 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,772 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,772 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,772 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,772 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,772 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,773 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,773 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,773 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,774 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,774 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,775 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,775 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,775 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,775 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,775 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,776 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,776 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,776 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,776 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,776 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,777 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,777 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,777 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,777 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,777 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,778 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,778 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,778 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,778 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,778 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,779 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,779 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,779 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,779 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,779 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,780 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,780 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,780 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,780 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,780 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,780 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,781 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,781 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,781 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,781 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,781 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,782 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,782 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,782 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,782 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,782 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,782 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,783 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,783 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,783 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,783 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,783 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,784 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,784 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,784 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,784 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,784 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,784 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,785 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,785 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,785 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,785 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,785 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,785 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,786 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,786 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,786 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,786 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,786 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,786 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,787 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,787 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,787 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,787 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,787 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,788 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,788 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,788 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,788 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,788 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,789 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,789 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,789 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,789 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,789 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,790 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,790 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,790 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,790 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,790 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,791 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,791 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,791 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,791 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,791 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,792 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,792 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,792 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,792 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,792 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,792 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,796 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,796 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,797 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,797 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,798 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,799 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,800 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,803 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,803 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,804 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,804 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,804 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:53:35,816 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2020-11-12 00:53:35,830 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-11-12 00:53:35,854 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:53:35,854 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:53:35,855 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:53:35,855 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:53:35,855 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:53:35,855 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:53:35,855 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:53:35,855 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:53:35,883 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:53:35,886 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 459 places, 498 transitions, 1004 flow [2020-11-12 00:53:35,890 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 498 transitions, 1004 flow [2020-11-12 00:53:35,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 459 places, 498 transitions, 1004 flow [2020-11-12 00:53:36,138 INFO L129 PetriNetUnfolder]: 43/497 cut-off events. [2020-11-12 00:53:36,139 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-11-12 00:53:36,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 497 events. 43/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1242 event pairs, 0 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 348. Up to 3 conditions per place. [2020-11-12 00:53:36,186 INFO L116 LiptonReduction]: Number of co-enabled transitions 34102 [2020-11-12 00:53:41,107 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:41,122 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-11-12 00:53:41,173 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:41,187 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-11-12 00:53:41,696 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,716 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:41,717 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,717 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-11-12 00:53:41,767 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:41,782 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:41,782 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-11-12 00:53:44,399 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:44,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:44,424 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:44,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:53:44,442 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:44,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:44,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:44,469 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:105 [2020-11-12 00:53:46,734 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-12 00:53:47,083 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:47,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:47,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:47,156 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:53:47,172 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:47,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:47,198 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:47,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-11-12 00:53:50,240 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:50,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:50,273 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:50,274 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-11-12 00:53:50,287 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:50,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:50,311 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:50,311 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:53:53,780 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:53,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:53,801 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:53,802 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-11-12 00:53:53,823 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:53,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:53,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:53,859 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:53:56,720 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:56,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:56,750 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:56,751 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:53:56,764 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:56,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:56,800 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:56,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-11-12 00:53:59,007 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:59,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:59,028 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:59,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:53:59,048 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:59,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:53:59,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:53:59,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-11-12 00:54:02,879 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-12 00:54:02,892 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:02,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:02,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:02,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:143, output treesize:147 [2020-11-12 00:54:03,168 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-12 00:54:03,178 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:03,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:03,245 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:03,246 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:143, output treesize:147 [2020-11-12 00:54:03,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:03,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:04,210 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:04,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:04,260 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:04,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-11-12 00:54:04,275 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:04,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:04,320 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:04,321 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:106 [2020-11-12 00:54:06,628 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-11-12 00:54:06,784 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-11-12 00:54:08,073 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:08,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,109 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:106 [2020-11-12 00:54:08,130 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:08,166 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,167 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-11-12 00:54:08,258 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:08,295 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,295 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-11-12 00:54:08,307 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,340 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:08,341 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:08,341 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:112 [2020-11-12 00:54:10,658 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:10,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:10,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:10,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:10,692 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:10,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:10,721 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:10,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-11-12 00:54:13,288 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:13,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:13,316 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:13,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:13,327 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:13,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:13,356 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:13,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-11-12 00:54:15,400 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:15,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:15,424 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:15,424 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-11-12 00:54:15,443 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:15,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:15,471 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:15,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:17,540 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:17,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:17,567 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:17,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-11-12 00:54:17,577 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:17,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:17,605 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:17,606 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:20,821 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:20,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:20,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:20,853 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:20,868 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:20,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:20,892 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:20,893 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-11-12 00:54:22,931 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:22,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:22,953 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:22,953 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2020-11-12 00:54:22,971 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:22,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:22,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:22,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2020-11-12 00:54:25,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:25,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:25,757 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:25,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:25,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:25,781 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2020-11-12 00:54:25,793 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:25,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:25,820 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:25,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:28,531 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-12 00:54:28,545 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:28,694 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-12 00:54:28,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:28,696 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:28,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:202, output treesize:193 [2020-11-12 00:54:28,835 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-12 00:54:29,338 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-12 00:54:29,348 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:29,568 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-12 00:54:29,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:29,569 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:29,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:202, output treesize:193 [2020-11-12 00:54:29,725 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-12 00:54:31,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:31,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:31,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:31,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:32,033 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:32,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:32,050 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:32,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:32,060 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:32,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:32,079 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:32,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:95, output treesize:96 [2020-11-12 00:54:34,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:34,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:34,891 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:34,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:34,909 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:34,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:95, output treesize:96 [2020-11-12 00:54:34,928 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:34,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:34,944 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:34,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:102 [2020-11-12 00:54:38,071 WARN L193 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-11-12 00:54:38,490 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-11-12 00:54:39,368 WARN L193 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-12 00:54:39,838 WARN L193 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-12 00:54:40,669 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-11-12 00:54:40,898 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-11-12 00:54:41,421 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:41,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:41,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:41,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:112 [2020-11-12 00:54:41,469 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:41,504 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:54:41,504 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:54:41,505 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2020-11-12 00:54:45,014 WARN L193 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2020-11-12 00:54:46,210 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 119 [2020-11-12 00:54:47,335 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2020-11-12 00:54:48,748 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 121 [2020-11-12 00:54:49,430 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-12 00:54:49,635 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-12 00:54:50,033 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-12 00:54:50,199 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-12 00:54:50,553 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2020-11-12 00:54:50,880 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-11-12 00:54:50,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 12, 2, 1] term [2020-11-12 00:54:50,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:54:51,077 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-11-12 00:54:51,334 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-12 00:54:51,703 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2020-11-12 00:54:54,043 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 211 DAG size of output: 193 [2020-11-12 00:54:54,968 WARN L193 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2020-11-12 00:54:58,035 WARN L193 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 218 DAG size of output: 198 [2020-11-12 00:54:59,821 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 197 [2020-11-12 00:55:03,168 WARN L193 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 239 DAG size of output: 233 [2020-11-12 00:55:03,189 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:55:04,912 WARN L193 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 199 [2020-11-12 00:55:04,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:55:04,914 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-12 00:55:04,914 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:596, output treesize:638 [2020-11-12 00:55:06,573 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 199 [2020-11-12 00:55:11,783 WARN L193 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 250 DAG size of output: 242 [2020-11-12 00:55:11,814 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:55:14,085 WARN L193 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 205 [2020-11-12 00:55:14,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:55:14,088 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-12 00:55:14,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:602, output treesize:644 [2020-11-12 00:55:16,120 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 205 [2020-11-12 00:55:17,667 INFO L131 LiptonReduction]: Checked pairs total: 126462 [2020-11-12 00:55:17,667 INFO L133 LiptonReduction]: Total number of compositions: 595 [2020-11-12 00:55:17,675 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 123 transitions, 254 flow [2020-11-12 00:55:17,748 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1508 states, 1496 states have (on average 2.325534759358289) internal successors, (3479), 1507 states have internal predecessors, (3479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 1508 states, 1496 states have (on average 2.325534759358289) internal successors, (3479), 1507 states have internal predecessors, (3479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-12 00:55:17,761 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:17,762 INFO L494 BasicCegarLoop]: trace histogram [1] [2020-11-12 00:55:17,763 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1839, now seen corresponding path program 1 times [2020-11-12 00:55:17,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:17,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136273087] [2020-11-12 00:55:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:17,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136273087] [2020-11-12 00:55:17,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:17,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-12 00:55:17,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809197176] [2020-11-12 00:55:17,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-12 00:55:17,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:17,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-12 00:55:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-12 00:55:17,944 INFO L87 Difference]: Start difference. First operand has 1508 states, 1496 states have (on average 2.325534759358289) internal successors, (3479), 1507 states have internal predecessors, (3479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:18,019 INFO L93 Difference]: Finished difference Result 1507 states and 3358 transitions. [2020-11-12 00:55:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-12 00:55:18,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2020-11-12 00:55:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:18,063 INFO L225 Difference]: With dead ends: 1507 [2020-11-12 00:55:18,063 INFO L226 Difference]: Without dead ends: 1506 [2020-11-12 00:55:18,064 INFO L749 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-11-12 00:55:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2020-11-12 00:55:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2020-11-12 00:55:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1496 states have (on average 2.2439839572192515) internal successors, (3357), 1505 states have internal predecessors, (3357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 3357 transitions. [2020-11-12 00:55:18,228 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 3357 transitions. Word has length 1 [2020-11-12 00:55:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:18,228 INFO L481 AbstractCegarLoop]: Abstraction has 1506 states and 3357 transitions. [2020-11-12 00:55:18,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 3357 transitions. [2020-11-12 00:55:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-12 00:55:18,229 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:18,230 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-12 00:55:18,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 00:55:18,231 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1963120793, now seen corresponding path program 1 times [2020-11-12 00:55:18,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:18,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573728252] [2020-11-12 00:55:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:18,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573728252] [2020-11-12 00:55:18,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:18,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:55:18,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335734581] [2020-11-12 00:55:18,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:55:18,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:55:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:55:18,389 INFO L87 Difference]: Start difference. First operand 1506 states and 3357 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:18,492 INFO L93 Difference]: Finished difference Result 2826 states and 6309 transitions. [2020-11-12 00:55:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:55:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2020-11-12 00:55:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:18,519 INFO L225 Difference]: With dead ends: 2826 [2020-11-12 00:55:18,519 INFO L226 Difference]: Without dead ends: 2826 [2020-11-12 00:55:18,520 INFO L749 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-11-12 00:55:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2020-11-12 00:55:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 1526. [2020-11-12 00:55:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1516 states have (on average 2.2420844327176783) internal successors, (3399), 1525 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 3399 transitions. [2020-11-12 00:55:18,603 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 3399 transitions. Word has length 6 [2020-11-12 00:55:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:18,603 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 3399 transitions. [2020-11-12 00:55:18,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 3399 transitions. [2020-11-12 00:55:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-12 00:55:18,604 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:18,604 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:18,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 00:55:18,605 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -727289591, now seen corresponding path program 1 times [2020-11-12 00:55:18,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:18,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043433498] [2020-11-12 00:55:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:18,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043433498] [2020-11-12 00:55:18,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:18,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:55:18,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099110278] [2020-11-12 00:55:18,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:55:18,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:18,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:55:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:55:18,735 INFO L87 Difference]: Start difference. First operand 1526 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:18,756 INFO L93 Difference]: Finished difference Result 1526 states and 3379 transitions. [2020-11-12 00:55:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:55:18,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2020-11-12 00:55:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:18,776 INFO L225 Difference]: With dead ends: 1526 [2020-11-12 00:55:18,777 INFO L226 Difference]: Without dead ends: 1526 [2020-11-12 00:55:18,777 INFO L749 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-11-12 00:55:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2020-11-12 00:55:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2020-11-12 00:55:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1516 states have (on average 2.228891820580475) internal successors, (3379), 1525 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 3379 transitions. [2020-11-12 00:55:18,830 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 3379 transitions. Word has length 7 [2020-11-12 00:55:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:18,831 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 3379 transitions. [2020-11-12 00:55:18,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 3379 transitions. [2020-11-12 00:55:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-12 00:55:18,832 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:18,833 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:18,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 00:55:18,833 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1060203556, now seen corresponding path program 1 times [2020-11-12 00:55:18,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:18,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403657640] [2020-11-12 00:55:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:19,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403657640] [2020-11-12 00:55:19,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:19,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:55:19,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845397319] [2020-11-12 00:55:19,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:55:19,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:55:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:55:19,024 INFO L87 Difference]: Start difference. First operand 1526 states and 3379 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:19,897 INFO L93 Difference]: Finished difference Result 1903 states and 4221 transitions. [2020-11-12 00:55:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:55:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2020-11-12 00:55:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:19,911 INFO L225 Difference]: With dead ends: 1903 [2020-11-12 00:55:19,911 INFO L226 Difference]: Without dead ends: 1903 [2020-11-12 00:55:19,912 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:55:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2020-11-12 00:55:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1634. [2020-11-12 00:55:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1624 states have (on average 2.2327586206896552) internal successors, (3626), 1633 states have internal predecessors, (3626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 3626 transitions. [2020-11-12 00:55:19,974 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 3626 transitions. Word has length 8 [2020-11-12 00:55:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:19,975 INFO L481 AbstractCegarLoop]: Abstraction has 1634 states and 3626 transitions. [2020-11-12 00:55:19,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 3626 transitions. [2020-11-12 00:55:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-12 00:55:19,977 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:19,977 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:19,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 00:55:19,978 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash -948232823, now seen corresponding path program 1 times [2020-11-12 00:55:19,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:19,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16149611] [2020-11-12 00:55:19,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:20,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16149611] [2020-11-12 00:55:20,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:20,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 00:55:20,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180403] [2020-11-12 00:55:20,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:55:20,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:55:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:55:20,106 INFO L87 Difference]: Start difference. First operand 1634 states and 3626 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:20,245 INFO L93 Difference]: Finished difference Result 2694 states and 5962 transitions. [2020-11-12 00:55:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:55:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2020-11-12 00:55:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:20,268 INFO L225 Difference]: With dead ends: 2694 [2020-11-12 00:55:20,268 INFO L226 Difference]: Without dead ends: 2694 [2020-11-12 00:55:20,268 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:55:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2020-11-12 00:55:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 1694. [2020-11-12 00:55:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1684 states have (on average 2.2280285035629452) internal successors, (3752), 1693 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 3752 transitions. [2020-11-12 00:55:20,350 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 3752 transitions. Word has length 10 [2020-11-12 00:55:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:20,350 INFO L481 AbstractCegarLoop]: Abstraction has 1694 states and 3752 transitions. [2020-11-12 00:55:20,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 3752 transitions. [2020-11-12 00:55:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-12 00:55:20,360 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:20,360 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:20,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 00:55:20,360 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1710054470, now seen corresponding path program 1 times [2020-11-12 00:55:20,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:20,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964417256] [2020-11-12 00:55:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:20,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-11-12 00:55:20,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964417256] [2020-11-12 00:55:20,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:20,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:55:20,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344041540] [2020-11-12 00:55:20,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:55:20,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:55:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:55:20,603 INFO L87 Difference]: Start difference. First operand 1694 states and 3752 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:22,449 INFO L93 Difference]: Finished difference Result 2078 states and 4591 transitions. [2020-11-12 00:55:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 00:55:22,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-12 00:55:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:22,464 INFO L225 Difference]: With dead ends: 2078 [2020-11-12 00:55:22,465 INFO L226 Difference]: Without dead ends: 2078 [2020-11-12 00:55:22,465 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:55:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2020-11-12 00:55:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1703. [2020-11-12 00:55:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1693 states have (on average 2.227997637330183) internal successors, (3772), 1702 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3772 transitions. [2020-11-12 00:55:22,525 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3772 transitions. Word has length 14 [2020-11-12 00:55:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:22,525 INFO L481 AbstractCegarLoop]: Abstraction has 1703 states and 3772 transitions. [2020-11-12 00:55:22,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3772 transitions. [2020-11-12 00:55:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-12 00:55:22,527 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:22,527 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:22,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 00:55:22,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash -18750132, now seen corresponding path program 2 times [2020-11-12 00:55:22,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:22,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422133372] [2020-11-12 00:55:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:22,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-11-12 00:55:22,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422133372] [2020-11-12 00:55:22,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:22,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:55:22,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886126352] [2020-11-12 00:55:22,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:55:22,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:55:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:55:22,690 INFO L87 Difference]: Start difference. First operand 1703 states and 3772 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:24,779 INFO L93 Difference]: Finished difference Result 2122 states and 4686 transitions. [2020-11-12 00:55:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-12 00:55:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-12 00:55:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:24,795 INFO L225 Difference]: With dead ends: 2122 [2020-11-12 00:55:24,795 INFO L226 Difference]: Without dead ends: 2122 [2020-11-12 00:55:24,795 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2020-11-12 00:55:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-11-12 00:55:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1710. [2020-11-12 00:55:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1700 states have (on average 2.228235294117647) internal successors, (3788), 1709 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 3788 transitions. [2020-11-12 00:55:24,851 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 3788 transitions. Word has length 14 [2020-11-12 00:55:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:24,852 INFO L481 AbstractCegarLoop]: Abstraction has 1710 states and 3788 transitions. [2020-11-12 00:55:24,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 3788 transitions. [2020-11-12 00:55:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-12 00:55:24,853 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:24,853 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:24,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 00:55:24,854 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1890512506, now seen corresponding path program 3 times [2020-11-12 00:55:24,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:24,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178827534] [2020-11-12 00:55:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:25,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178827534] [2020-11-12 00:55:25,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:25,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:55:25,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519246090] [2020-11-12 00:55:25,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:55:25,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:25,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:55:25,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:55:25,018 INFO L87 Difference]: Start difference. First operand 1710 states and 3788 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:27,029 INFO L93 Difference]: Finished difference Result 2103 states and 4645 transitions. [2020-11-12 00:55:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 00:55:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-12 00:55:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:27,047 INFO L225 Difference]: With dead ends: 2103 [2020-11-12 00:55:27,048 INFO L226 Difference]: Without dead ends: 2103 [2020-11-12 00:55:27,048 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:55:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2020-11-12 00:55:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1703. [2020-11-12 00:55:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1693 states have (on average 2.227997637330183) internal successors, (3772), 1702 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3772 transitions. [2020-11-12 00:55:27,104 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3772 transitions. Word has length 14 [2020-11-12 00:55:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:27,105 INFO L481 AbstractCegarLoop]: Abstraction has 1703 states and 3772 transitions. [2020-11-12 00:55:27,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3772 transitions. [2020-11-12 00:55:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-12 00:55:27,106 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:27,106 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:27,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 00:55:27,107 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 24689574, now seen corresponding path program 1 times [2020-11-12 00:55:27,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:27,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649682285] [2020-11-12 00:55:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:27,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649682285] [2020-11-12 00:55:27,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:27,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:55:27,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032949782] [2020-11-12 00:55:27,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:55:27,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:55:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:55:27,358 INFO L87 Difference]: Start difference. First operand 1703 states and 3772 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:29,005 INFO L93 Difference]: Finished difference Result 2311 states and 5100 transitions. [2020-11-12 00:55:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:55:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-12 00:55:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:29,034 INFO L225 Difference]: With dead ends: 2311 [2020-11-12 00:55:29,034 INFO L226 Difference]: Without dead ends: 2282 [2020-11-12 00:55:29,034 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:55:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-12 00:55:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1793. [2020-11-12 00:55:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1783 states have (on average 2.2327537857543467) internal successors, (3981), 1792 states have internal predecessors, (3981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 3981 transitions. [2020-11-12 00:55:29,118 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 3981 transitions. Word has length 14 [2020-11-12 00:55:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:29,121 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 3981 transitions. [2020-11-12 00:55:29,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3981 transitions. [2020-11-12 00:55:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:29,123 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:29,124 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:29,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 00:55:29,124 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1834419292, now seen corresponding path program 1 times [2020-11-12 00:55:29,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:29,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973920963] [2020-11-12 00:55:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:29,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-11-12 00:55:29,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973920963] [2020-11-12 00:55:29,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:29,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:55:29,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143906994] [2020-11-12 00:55:29,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:55:29,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:29,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:55:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:55:29,321 INFO L87 Difference]: Start difference. First operand 1793 states and 3981 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:31,769 INFO L93 Difference]: Finished difference Result 2206 states and 4881 transitions. [2020-11-12 00:55:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-12 00:55:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:31,777 INFO L225 Difference]: With dead ends: 2206 [2020-11-12 00:55:31,777 INFO L226 Difference]: Without dead ends: 2206 [2020-11-12 00:55:31,778 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2020-11-12 00:55:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2020-11-12 00:55:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1802. [2020-11-12 00:55:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1792 states have (on average 2.232700892857143) internal successors, (4001), 1801 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 4001 transitions. [2020-11-12 00:55:31,831 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 4001 transitions. Word has length 15 [2020-11-12 00:55:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:31,832 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 4001 transitions. [2020-11-12 00:55:31,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 4001 transitions. [2020-11-12 00:55:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:31,833 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:31,833 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:31,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 00:55:31,834 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:31,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1092071010, now seen corresponding path program 2 times [2020-11-12 00:55:31,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:31,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690667915] [2020-11-12 00:55:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:32,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690667915] [2020-11-12 00:55:32,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:32,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:55:32,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546715649] [2020-11-12 00:55:32,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 00:55:32,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 00:55:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:55:32,015 INFO L87 Difference]: Start difference. First operand 1802 states and 4001 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:34,571 INFO L93 Difference]: Finished difference Result 2176 states and 4818 transitions. [2020-11-12 00:55:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-12 00:55:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:34,582 INFO L225 Difference]: With dead ends: 2176 [2020-11-12 00:55:34,582 INFO L226 Difference]: Without dead ends: 2176 [2020-11-12 00:55:34,583 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-11-12 00:55:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2020-11-12 00:55:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 1802. [2020-11-12 00:55:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1792 states have (on average 2.232700892857143) internal successors, (4001), 1801 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 4001 transitions. [2020-11-12 00:55:34,635 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 4001 transitions. Word has length 15 [2020-11-12 00:55:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:34,635 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 4001 transitions. [2020-11-12 00:55:34,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 4001 transitions. [2020-11-12 00:55:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:34,637 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:34,637 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:34,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 00:55:34,637 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1099439841, now seen corresponding path program 1 times [2020-11-12 00:55:34,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:34,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204299670] [2020-11-12 00:55:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:35,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204299670] [2020-11-12 00:55:35,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:35,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:55:35,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303544692] [2020-11-12 00:55:35,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:55:35,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:55:35,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:55:35,048 INFO L87 Difference]: Start difference. First operand 1802 states and 4001 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:35,719 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2020-11-12 00:55:35,944 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2020-11-12 00:55:36,248 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-11-12 00:55:36,403 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-11-12 00:55:36,648 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-11-12 00:55:37,060 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2020-11-12 00:55:37,349 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2020-11-12 00:55:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:39,210 INFO L93 Difference]: Finished difference Result 2281 states and 5118 transitions. [2020-11-12 00:55:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-12 00:55:39,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:39,217 INFO L225 Difference]: With dead ends: 2281 [2020-11-12 00:55:39,217 INFO L226 Difference]: Without dead ends: 2281 [2020-11-12 00:55:39,218 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:55:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2020-11-12 00:55:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1820. [2020-11-12 00:55:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1810 states have (on average 2.2375690607734806) internal successors, (4050), 1819 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4050 transitions. [2020-11-12 00:55:39,268 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4050 transitions. Word has length 15 [2020-11-12 00:55:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:39,269 INFO L481 AbstractCegarLoop]: Abstraction has 1820 states and 4050 transitions. [2020-11-12 00:55:39,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4050 transitions. [2020-11-12 00:55:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:39,270 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:39,270 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:39,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 00:55:39,271 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 817952357, now seen corresponding path program 2 times [2020-11-12 00:55:39,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:39,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282717026] [2020-11-12 00:55:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:39,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282717026] [2020-11-12 00:55:39,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:39,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:55:39,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920417022] [2020-11-12 00:55:39,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:55:39,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:55:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:55:39,697 INFO L87 Difference]: Start difference. First operand 1820 states and 4050 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:40,461 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2020-11-12 00:55:40,694 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2020-11-12 00:55:40,999 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-11-12 00:55:41,149 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-11-12 00:55:41,368 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2020-11-12 00:55:41,516 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-11-12 00:55:41,921 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2020-11-12 00:55:42,211 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2020-11-12 00:55:42,389 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2020-11-12 00:55:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:44,132 INFO L93 Difference]: Finished difference Result 2311 states and 5163 transitions. [2020-11-12 00:55:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-12 00:55:44,133 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:44,138 INFO L225 Difference]: With dead ends: 2311 [2020-11-12 00:55:44,138 INFO L226 Difference]: Without dead ends: 2311 [2020-11-12 00:55:44,139 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:55:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2020-11-12 00:55:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1834. [2020-11-12 00:55:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1824 states have (on average 2.237938596491228) internal successors, (4082), 1833 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4082 transitions. [2020-11-12 00:55:44,189 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4082 transitions. Word has length 15 [2020-11-12 00:55:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:44,189 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 4082 transitions. [2020-11-12 00:55:44,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4082 transitions. [2020-11-12 00:55:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:44,191 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:44,191 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:44,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-12 00:55:44,191 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:44,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -739036577, now seen corresponding path program 3 times [2020-11-12 00:55:44,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:44,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002414205] [2020-11-12 00:55:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:44,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002414205] [2020-11-12 00:55:44,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:44,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:55:44,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657880508] [2020-11-12 00:55:44,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:55:44,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:55:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:55:44,671 INFO L87 Difference]: Start difference. First operand 1834 states and 4082 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:45,350 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2020-11-12 00:55:45,805 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2020-11-12 00:55:45,984 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2020-11-12 00:55:46,138 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-11-12 00:55:46,396 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2020-11-12 00:55:46,853 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2020-11-12 00:55:47,032 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2020-11-12 00:55:47,368 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2020-11-12 00:55:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:49,211 INFO L93 Difference]: Finished difference Result 2356 states and 5253 transitions. [2020-11-12 00:55:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-12 00:55:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:49,218 INFO L225 Difference]: With dead ends: 2356 [2020-11-12 00:55:49,218 INFO L226 Difference]: Without dead ends: 2356 [2020-11-12 00:55:49,219 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2020-11-12 00:55:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2020-11-12 00:55:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1848. [2020-11-12 00:55:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1838 states have (on average 2.238302502720348) internal successors, (4114), 1847 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 4114 transitions. [2020-11-12 00:55:49,298 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 4114 transitions. Word has length 15 [2020-11-12 00:55:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:49,299 INFO L481 AbstractCegarLoop]: Abstraction has 1848 states and 4114 transitions. [2020-11-12 00:55:49,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 4114 transitions. [2020-11-12 00:55:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:49,300 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:49,300 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:49,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-12 00:55:49,301 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash -885383451, now seen corresponding path program 4 times [2020-11-12 00:55:49,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:49,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112159876] [2020-11-12 00:55:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:49,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112159876] [2020-11-12 00:55:49,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:49,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:55:49,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263468731] [2020-11-12 00:55:49,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:55:49,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:49,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:55:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:55:49,782 INFO L87 Difference]: Start difference. First operand 1848 states and 4114 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:50,327 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2020-11-12 00:55:50,956 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2020-11-12 00:55:51,120 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2020-11-12 00:55:51,278 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-11-12 00:55:51,527 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-11-12 00:55:51,995 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-11-12 00:55:52,378 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-11-12 00:55:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:54,303 INFO L93 Difference]: Finished difference Result 2662 states and 5957 transitions. [2020-11-12 00:55:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-12 00:55:54,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:54,312 INFO L225 Difference]: With dead ends: 2662 [2020-11-12 00:55:54,312 INFO L226 Difference]: Without dead ends: 2662 [2020-11-12 00:55:54,315 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2020-11-12 00:55:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2020-11-12 00:55:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1890. [2020-11-12 00:55:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1880 states have (on average 2.246808510638298) internal successors, (4224), 1889 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 4224 transitions. [2020-11-12 00:55:54,370 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 4224 transitions. Word has length 15 [2020-11-12 00:55:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:54,371 INFO L481 AbstractCegarLoop]: Abstraction has 1890 states and 4224 transitions. [2020-11-12 00:55:54,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 4224 transitions. [2020-11-12 00:55:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:54,372 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:54,373 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:54,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-12 00:55:54,373 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 478491743, now seen corresponding path program 5 times [2020-11-12 00:55:54,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:54,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793577932] [2020-11-12 00:55:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:55:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:55:54,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793577932] [2020-11-12 00:55:54,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:55:54,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:55:54,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088808275] [2020-11-12 00:55:54,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:55:54,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:55:54,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:55:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:55:54,899 INFO L87 Difference]: Start difference. First operand 1890 states and 4224 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:55,446 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2020-11-12 00:55:56,144 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2020-11-12 00:55:56,302 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2020-11-12 00:55:56,595 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-11-12 00:55:57,097 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-11-12 00:55:57,462 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-11-12 00:55:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:55:59,716 INFO L93 Difference]: Finished difference Result 2977 states and 6681 transitions. [2020-11-12 00:55:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-12 00:55:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:55:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:55:59,726 INFO L225 Difference]: With dead ends: 2977 [2020-11-12 00:55:59,726 INFO L226 Difference]: Without dead ends: 2977 [2020-11-12 00:55:59,727 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2020-11-12 00:55:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-11-12 00:55:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1904. [2020-11-12 00:55:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1894 states have (on average 2.2544878563885957) internal successors, (4270), 1903 states have internal predecessors, (4270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 4270 transitions. [2020-11-12 00:55:59,790 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 4270 transitions. Word has length 15 [2020-11-12 00:55:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:55:59,791 INFO L481 AbstractCegarLoop]: Abstraction has 1904 states and 4270 transitions. [2020-11-12 00:55:59,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:55:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 4270 transitions. [2020-11-12 00:55:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:55:59,792 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:55:59,792 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:55:59,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-12 00:55:59,793 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:55:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:55:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1219699493, now seen corresponding path program 6 times [2020-11-12 00:55:59,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:55:59,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608271592] [2020-11-12 00:55:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:55:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:00,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608271592] [2020-11-12 00:56:00,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:00,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:00,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512726890] [2020-11-12 00:56:00,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:00,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:00,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:00,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:00,315 INFO L87 Difference]: Start difference. First operand 1904 states and 4270 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:00,737 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2020-11-12 00:56:01,296 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2020-11-12 00:56:01,452 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2020-11-12 00:56:01,730 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-11-12 00:56:02,260 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2020-11-12 00:56:02,654 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-11-12 00:56:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:04,943 INFO L93 Difference]: Finished difference Result 2662 states and 5957 transitions. [2020-11-12 00:56:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-12 00:56:04,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:56:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:04,954 INFO L225 Difference]: With dead ends: 2662 [2020-11-12 00:56:04,954 INFO L226 Difference]: Without dead ends: 2662 [2020-11-12 00:56:04,955 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2020-11-12 00:56:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2020-11-12 00:56:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1820. [2020-11-12 00:56:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1810 states have (on average 2.2375690607734806) internal successors, (4050), 1819 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4050 transitions. [2020-11-12 00:56:05,005 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4050 transitions. Word has length 15 [2020-11-12 00:56:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:05,005 INFO L481 AbstractCegarLoop]: Abstraction has 1820 states and 4050 transitions. [2020-11-12 00:56:05,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4050 transitions. [2020-11-12 00:56:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:56:05,007 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:05,007 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:05,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-12 00:56:05,008 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1863703808, now seen corresponding path program 1 times [2020-11-12 00:56:05,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:05,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298478263] [2020-11-12 00:56:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:05,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298478263] [2020-11-12 00:56:05,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:05,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 00:56:05,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441575291] [2020-11-12 00:56:05,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:56:05,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:56:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:56:05,231 INFO L87 Difference]: Start difference. First operand 1820 states and 4050 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:07,813 INFO L93 Difference]: Finished difference Result 2433 states and 5375 transitions. [2020-11-12 00:56:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-12 00:56:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:56:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:07,822 INFO L225 Difference]: With dead ends: 2433 [2020-11-12 00:56:07,822 INFO L226 Difference]: Without dead ends: 2433 [2020-11-12 00:56:07,823 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2020-11-12 00:56:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2020-11-12 00:56:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 1838. [2020-11-12 00:56:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1828 states have (on average 2.237417943107221) internal successors, (4090), 1837 states have internal predecessors, (4090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 4090 transitions. [2020-11-12 00:56:07,867 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 4090 transitions. Word has length 16 [2020-11-12 00:56:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:07,868 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 4090 transitions. [2020-11-12 00:56:07,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 4090 transitions. [2020-11-12 00:56:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:56:07,869 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:07,869 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:07,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-12 00:56:07,870 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1001504134, now seen corresponding path program 2 times [2020-11-12 00:56:07,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:07,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042740430] [2020-11-12 00:56:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:08,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042740430] [2020-11-12 00:56:08,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:08,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 00:56:08,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616132940] [2020-11-12 00:56:08,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:56:08,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:56:08,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:56:08,080 INFO L87 Difference]: Start difference. First operand 1838 states and 4090 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:11,060 INFO L93 Difference]: Finished difference Result 2449 states and 5411 transitions. [2020-11-12 00:56:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-12 00:56:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:56:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:11,066 INFO L225 Difference]: With dead ends: 2449 [2020-11-12 00:56:11,066 INFO L226 Difference]: Without dead ends: 2449 [2020-11-12 00:56:11,067 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2020-11-12 00:56:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2020-11-12 00:56:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 1845. [2020-11-12 00:56:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1835 states have (on average 2.237602179836512) internal successors, (4106), 1844 states have internal predecessors, (4106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 4106 transitions. [2020-11-12 00:56:11,110 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 4106 transitions. Word has length 16 [2020-11-12 00:56:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:11,110 INFO L481 AbstractCegarLoop]: Abstraction has 1845 states and 4106 transitions. [2020-11-12 00:56:11,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 4106 transitions. [2020-11-12 00:56:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:56:11,115 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:11,115 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:11,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-12 00:56:11,115 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash -536456128, now seen corresponding path program 3 times [2020-11-12 00:56:11,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:11,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637134180] [2020-11-12 00:56:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:11,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637134180] [2020-11-12 00:56:11,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:11,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 00:56:11,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423569719] [2020-11-12 00:56:11,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:56:11,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:56:11,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:56:11,340 INFO L87 Difference]: Start difference. First operand 1845 states and 4106 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:14,094 INFO L93 Difference]: Finished difference Result 2456 states and 5427 transitions. [2020-11-12 00:56:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-12 00:56:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:56:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:14,099 INFO L225 Difference]: With dead ends: 2456 [2020-11-12 00:56:14,099 INFO L226 Difference]: Without dead ends: 2456 [2020-11-12 00:56:14,100 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2020-11-12 00:56:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2020-11-12 00:56:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 1852. [2020-11-12 00:56:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1842 states have (on average 2.237785016286645) internal successors, (4122), 1851 states have internal predecessors, (4122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 4122 transitions. [2020-11-12 00:56:14,142 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 4122 transitions. Word has length 16 [2020-11-12 00:56:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:14,142 INFO L481 AbstractCegarLoop]: Abstraction has 1852 states and 4122 transitions. [2020-11-12 00:56:14,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 4122 transitions. [2020-11-12 00:56:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:56:14,144 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:14,144 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:14,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-12 00:56:14,145 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 234664902, now seen corresponding path program 4 times [2020-11-12 00:56:14,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:14,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373270715] [2020-11-12 00:56:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:14,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373270715] [2020-11-12 00:56:14,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:14,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 00:56:14,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892169642] [2020-11-12 00:56:14,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:56:14,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:56:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:56:14,336 INFO L87 Difference]: Start difference. First operand 1852 states and 4122 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:17,638 INFO L93 Difference]: Finished difference Result 2429 states and 5372 transitions. [2020-11-12 00:56:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-12 00:56:17,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:56:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:17,642 INFO L225 Difference]: With dead ends: 2429 [2020-11-12 00:56:17,642 INFO L226 Difference]: Without dead ends: 2429 [2020-11-12 00:56:17,643 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2020-11-12 00:56:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2020-11-12 00:56:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1866. [2020-11-12 00:56:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1856 states have (on average 2.238146551724138) internal successors, (4154), 1865 states have internal predecessors, (4154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 4154 transitions. [2020-11-12 00:56:17,682 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 4154 transitions. Word has length 16 [2020-11-12 00:56:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:17,682 INFO L481 AbstractCegarLoop]: Abstraction has 1866 states and 4154 transitions. [2020-11-12 00:56:17,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 4154 transitions. [2020-11-12 00:56:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-12 00:56:17,684 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:17,684 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:17,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-12 00:56:17,684 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1062320512, now seen corresponding path program 5 times [2020-11-12 00:56:17,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:17,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109661862] [2020-11-12 00:56:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:17,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109661862] [2020-11-12 00:56:17,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:17,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 00:56:17,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280507699] [2020-11-12 00:56:17,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:56:17,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:56:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:56:17,899 INFO L87 Difference]: Start difference. First operand 1866 states and 4154 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:20,714 INFO L93 Difference]: Finished difference Result 2356 states and 5216 transitions. [2020-11-12 00:56:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 00:56:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2020-11-12 00:56:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:20,719 INFO L225 Difference]: With dead ends: 2356 [2020-11-12 00:56:20,719 INFO L226 Difference]: Without dead ends: 2356 [2020-11-12 00:56:20,720 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2020-11-12 00:56:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2020-11-12 00:56:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1838. [2020-11-12 00:56:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1828 states have (on average 2.237417943107221) internal successors, (4090), 1837 states have internal predecessors, (4090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 4090 transitions. [2020-11-12 00:56:20,760 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 4090 transitions. Word has length 16 [2020-11-12 00:56:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:20,760 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 4090 transitions. [2020-11-12 00:56:20,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 4090 transitions. [2020-11-12 00:56:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:20,762 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:20,762 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:20,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-12 00:56:20,763 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:20,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1941405530, now seen corresponding path program 1 times [2020-11-12 00:56:20,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:20,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778810894] [2020-11-12 00:56:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:21,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778810894] [2020-11-12 00:56:21,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:21,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:21,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430751345] [2020-11-12 00:56:21,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:21,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:21,100 INFO L87 Difference]: Start difference. First operand 1838 states and 4090 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:21,480 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2020-11-12 00:56:21,875 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2020-11-12 00:56:22,062 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:22,369 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2020-11-12 00:56:22,747 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2020-11-12 00:56:22,920 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:23,165 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-11-12 00:56:23,645 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-11-12 00:56:23,985 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-11-12 00:56:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:26,006 INFO L93 Difference]: Finished difference Result 3298 states and 7362 transitions. [2020-11-12 00:56:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-12 00:56:26,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:56:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:26,012 INFO L225 Difference]: With dead ends: 3298 [2020-11-12 00:56:26,012 INFO L226 Difference]: Without dead ends: 3298 [2020-11-12 00:56:26,013 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=332, Invalid=928, Unknown=0, NotChecked=0, Total=1260 [2020-11-12 00:56:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2020-11-12 00:56:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 1946. [2020-11-12 00:56:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1936 states have (on average 2.241219008264463) internal successors, (4339), 1945 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4339 transitions. [2020-11-12 00:56:26,062 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4339 transitions. Word has length 17 [2020-11-12 00:56:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:26,063 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 4339 transitions. [2020-11-12 00:56:26,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4339 transitions. [2020-11-12 00:56:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:26,064 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:26,065 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:26,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-12 00:56:26,065 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:26,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1669943776, now seen corresponding path program 2 times [2020-11-12 00:56:26,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:26,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902605507] [2020-11-12 00:56:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:26,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902605507] [2020-11-12 00:56:26,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:26,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:26,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781414131] [2020-11-12 00:56:26,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:26,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:26,446 INFO L87 Difference]: Start difference. First operand 1946 states and 4339 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:26,897 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2020-11-12 00:56:27,294 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2020-11-12 00:56:27,488 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:27,815 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2020-11-12 00:56:28,204 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2020-11-12 00:56:28,386 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2020-11-12 00:56:28,560 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:28,852 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-11-12 00:56:29,063 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-11-12 00:56:29,617 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2020-11-12 00:56:29,833 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-11-12 00:56:30,205 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2020-11-12 00:56:30,436 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-11-12 00:56:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:33,065 INFO L93 Difference]: Finished difference Result 3259 states and 7277 transitions. [2020-11-12 00:56:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-12 00:56:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:56:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:33,072 INFO L225 Difference]: With dead ends: 3259 [2020-11-12 00:56:33,073 INFO L226 Difference]: Without dead ends: 3259 [2020-11-12 00:56:33,073 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=374, Invalid=1032, Unknown=0, NotChecked=0, Total=1406 [2020-11-12 00:56:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2020-11-12 00:56:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 1960. [2020-11-12 00:56:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1950 states have (on average 2.2451282051282053) internal successors, (4378), 1959 states have internal predecessors, (4378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 4378 transitions. [2020-11-12 00:56:33,119 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 4378 transitions. Word has length 17 [2020-11-12 00:56:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:33,120 INFO L481 AbstractCegarLoop]: Abstraction has 1960 states and 4378 transitions. [2020-11-12 00:56:33,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 4378 transitions. [2020-11-12 00:56:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:33,122 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:33,122 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:33,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-12 00:56:33,122 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 65634720, now seen corresponding path program 3 times [2020-11-12 00:56:33,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:33,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802029000] [2020-11-12 00:56:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:33,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802029000] [2020-11-12 00:56:33,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:33,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:33,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596733456] [2020-11-12 00:56:33,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:33,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:33,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:33,537 INFO L87 Difference]: Start difference. First operand 1960 states and 4378 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:33,939 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2020-11-12 00:56:34,360 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2020-11-12 00:56:34,557 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:34,898 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2020-11-12 00:56:35,339 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2020-11-12 00:56:35,538 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2020-11-12 00:56:35,704 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:36,008 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-11-12 00:56:36,222 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2020-11-12 00:56:36,429 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-11-12 00:56:36,977 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2020-11-12 00:56:37,187 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-11-12 00:56:37,563 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2020-11-12 00:56:37,792 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2020-11-12 00:56:38,022 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2020-11-12 00:56:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:40,734 INFO L93 Difference]: Finished difference Result 3103 states and 6941 transitions. [2020-11-12 00:56:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-12 00:56:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:56:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:40,740 INFO L225 Difference]: With dead ends: 3103 [2020-11-12 00:56:40,740 INFO L226 Difference]: Without dead ends: 3103 [2020-11-12 00:56:40,741 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2020-11-12 00:56:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2020-11-12 00:56:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 1974. [2020-11-12 00:56:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1964 states have (on average 2.245417515274949) internal successors, (4410), 1973 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 4410 transitions. [2020-11-12 00:56:40,786 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 4410 transitions. Word has length 17 [2020-11-12 00:56:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:40,787 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 4410 transitions. [2020-11-12 00:56:40,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 4410 transitions. [2020-11-12 00:56:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:40,790 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:40,790 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:40,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-12 00:56:40,790 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1552111846, now seen corresponding path program 4 times [2020-11-12 00:56:40,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:40,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059398304] [2020-11-12 00:56:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:41,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059398304] [2020-11-12 00:56:41,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:41,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:41,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017980507] [2020-11-12 00:56:41,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:41,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:41,203 INFO L87 Difference]: Start difference. First operand 1974 states and 4410 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:41,601 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2020-11-12 00:56:42,015 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2020-11-12 00:56:42,211 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:42,791 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2020-11-12 00:56:42,975 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2020-11-12 00:56:43,153 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:43,455 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-11-12 00:56:43,935 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-11-12 00:56:44,144 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2020-11-12 00:56:44,516 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2020-11-12 00:56:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:46,936 INFO L93 Difference]: Finished difference Result 2975 states and 6640 transitions. [2020-11-12 00:56:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-12 00:56:46,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:56:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:46,941 INFO L225 Difference]: With dead ends: 2975 [2020-11-12 00:56:46,942 INFO L226 Difference]: Without dead ends: 2975 [2020-11-12 00:56:46,942 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=268, Invalid=662, Unknown=0, NotChecked=0, Total=930 [2020-11-12 00:56:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-11-12 00:56:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1988. [2020-11-12 00:56:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1978 states have (on average 2.2457027300303336) internal successors, (4442), 1987 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 4442 transitions. [2020-11-12 00:56:46,991 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 4442 transitions. Word has length 17 [2020-11-12 00:56:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:46,992 INFO L481 AbstractCegarLoop]: Abstraction has 1988 states and 4442 transitions. [2020-11-12 00:56:46,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 4442 transitions. [2020-11-12 00:56:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:46,994 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:46,994 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:46,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-12 00:56:46,994 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -457536992, now seen corresponding path program 5 times [2020-11-12 00:56:46,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:46,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350411429] [2020-11-12 00:56:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:47,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350411429] [2020-11-12 00:56:47,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:47,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:47,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407412338] [2020-11-12 00:56:47,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:47,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:47,481 INFO L87 Difference]: Start difference. First operand 1988 states and 4442 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:47,997 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2020-11-12 00:56:48,425 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2020-11-12 00:56:48,582 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2020-11-12 00:56:49,215 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2020-11-12 00:56:49,409 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2020-11-12 00:56:49,596 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-11-12 00:56:49,904 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-11-12 00:56:50,417 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2020-11-12 00:56:50,805 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 [2020-11-12 00:56:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:53,372 INFO L93 Difference]: Finished difference Result 3245 states and 7267 transitions. [2020-11-12 00:56:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-12 00:56:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:56:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:53,378 INFO L225 Difference]: With dead ends: 3245 [2020-11-12 00:56:53,378 INFO L226 Difference]: Without dead ends: 3245 [2020-11-12 00:56:53,379 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2020-11-12 00:56:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2020-11-12 00:56:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2030. [2020-11-12 00:56:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2020 states have (on average 2.2534653465346532) internal successors, (4552), 2029 states have internal predecessors, (4552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4552 transitions. [2020-11-12 00:56:53,418 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4552 transitions. Word has length 17 [2020-11-12 00:56:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:53,418 INFO L481 AbstractCegarLoop]: Abstraction has 2030 states and 4552 transitions. [2020-11-12 00:56:53,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4552 transitions. [2020-11-12 00:56:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:53,420 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:53,420 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:53,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-12 00:56:53,421 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash 261499162, now seen corresponding path program 6 times [2020-11-12 00:56:53,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:53,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142948320] [2020-11-12 00:56:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:56:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:56:53,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142948320] [2020-11-12 00:56:53,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:56:53,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:56:53,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000932975] [2020-11-12 00:56:53,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:56:53,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:56:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:56:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:56:53,887 INFO L87 Difference]: Start difference. First operand 2030 states and 4552 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:54,751 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2020-11-12 00:56:55,186 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2020-11-12 00:56:55,586 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2020-11-12 00:56:55,780 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2020-11-12 00:56:56,152 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-11-12 00:56:56,707 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-11-12 00:56:57,094 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2020-11-12 00:56:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:56:59,743 INFO L93 Difference]: Finished difference Result 3560 states and 7991 transitions. [2020-11-12 00:56:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-12 00:56:59,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:56:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:56:59,750 INFO L225 Difference]: With dead ends: 3560 [2020-11-12 00:56:59,750 INFO L226 Difference]: Without dead ends: 3560 [2020-11-12 00:56:59,750 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2020-11-12 00:56:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2020-11-12 00:56:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2044. [2020-11-12 00:56:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2034 states have (on average 2.2605703048180925) internal successors, (4598), 2043 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 4598 transitions. [2020-11-12 00:56:59,805 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 4598 transitions. Word has length 17 [2020-11-12 00:56:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:56:59,806 INFO L481 AbstractCegarLoop]: Abstraction has 2044 states and 4598 transitions. [2020-11-12 00:56:59,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:56:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 4598 transitions. [2020-11-12 00:56:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:56:59,808 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:56:59,809 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:56:59,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-12 00:56:59,809 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:56:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:56:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash -402424224, now seen corresponding path program 7 times [2020-11-12 00:56:59,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:56:59,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539905432] [2020-11-12 00:56:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:56:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:00,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539905432] [2020-11-12 00:57:00,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:00,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:57:00,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110820769] [2020-11-12 00:57:00,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:57:00,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:57:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:57:00,296 INFO L87 Difference]: Start difference. First operand 2044 states and 4598 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:00,888 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2020-11-12 00:57:01,260 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2020-11-12 00:57:01,522 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2020-11-12 00:57:01,703 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2020-11-12 00:57:01,999 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-11-12 00:57:02,446 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-11-12 00:57:02,820 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2020-11-12 00:57:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:05,096 INFO L93 Difference]: Finished difference Result 3231 states and 7228 transitions. [2020-11-12 00:57:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-12 00:57:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:57:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:05,102 INFO L225 Difference]: With dead ends: 3231 [2020-11-12 00:57:05,103 INFO L226 Difference]: Without dead ends: 3231 [2020-11-12 00:57:05,103 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-12 00:57:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2020-11-12 00:57:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 1946. [2020-11-12 00:57:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1936 states have (on average 2.241219008264463) internal successors, (4339), 1945 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4339 transitions. [2020-11-12 00:57:05,145 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4339 transitions. Word has length 17 [2020-11-12 00:57:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:05,146 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 4339 transitions. [2020-11-12 00:57:05,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4339 transitions. [2020-11-12 00:57:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:57:05,148 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:05,148 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:05,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-12 00:57:05,148 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1794217249, now seen corresponding path program 1 times [2020-11-12 00:57:05,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:05,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595463904] [2020-11-12 00:57:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:05,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595463904] [2020-11-12 00:57:05,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:05,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:57:05,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146091540] [2020-11-12 00:57:05,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 00:57:05,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 00:57:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 00:57:05,277 INFO L87 Difference]: Start difference. First operand 1946 states and 4339 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:06,219 INFO L93 Difference]: Finished difference Result 2195 states and 4882 transitions. [2020-11-12 00:57:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:57:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:57:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:06,223 INFO L225 Difference]: With dead ends: 2195 [2020-11-12 00:57:06,223 INFO L226 Difference]: Without dead ends: 2195 [2020-11-12 00:57:06,223 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:57:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2020-11-12 00:57:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2045. [2020-11-12 00:57:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2035 states have (on average 2.2442260442260444) internal successors, (4567), 2044 states have internal predecessors, (4567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4567 transitions. [2020-11-12 00:57:06,266 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4567 transitions. Word has length 17 [2020-11-12 00:57:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:06,266 INFO L481 AbstractCegarLoop]: Abstraction has 2045 states and 4567 transitions. [2020-11-12 00:57:06,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4567 transitions. [2020-11-12 00:57:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:06,268 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:06,268 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:06,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-12 00:57:06,269 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash -291236264, now seen corresponding path program 1 times [2020-11-12 00:57:06,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:06,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461191531] [2020-11-12 00:57:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:06,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461191531] [2020-11-12 00:57:06,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:06,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:06,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082843173] [2020-11-12 00:57:06,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:06,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:06,677 INFO L87 Difference]: Start difference. First operand 2045 states and 4567 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:09,227 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-11-12 00:57:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:11,830 INFO L93 Difference]: Finished difference Result 2660 states and 5947 transitions. [2020-11-12 00:57:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-12 00:57:11,832 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:11,836 INFO L225 Difference]: With dead ends: 2660 [2020-11-12 00:57:11,836 INFO L226 Difference]: Without dead ends: 2660 [2020-11-12 00:57:11,836 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=409, Invalid=997, Unknown=0, NotChecked=0, Total=1406 [2020-11-12 00:57:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2020-11-12 00:57:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2065. [2020-11-12 00:57:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 2055 states have (on average 2.2481751824817517) internal successors, (4620), 2064 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 4620 transitions. [2020-11-12 00:57:11,873 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 4620 transitions. Word has length 18 [2020-11-12 00:57:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:11,874 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 4620 transitions. [2020-11-12 00:57:11,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 4620 transitions. [2020-11-12 00:57:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:11,875 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:11,876 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:11,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-12 00:57:11,876 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:11,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1626155934, now seen corresponding path program 2 times [2020-11-12 00:57:11,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:11,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170577293] [2020-11-12 00:57:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:12,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170577293] [2020-11-12 00:57:12,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:12,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:12,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94747501] [2020-11-12 00:57:12,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:12,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:12,219 INFO L87 Difference]: Start difference. First operand 2065 states and 4620 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:15,171 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-11-12 00:57:15,329 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-11-12 00:57:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:18,458 INFO L93 Difference]: Finished difference Result 2712 states and 6068 transitions. [2020-11-12 00:57:18,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-12 00:57:18,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:18,463 INFO L225 Difference]: With dead ends: 2712 [2020-11-12 00:57:18,463 INFO L226 Difference]: Without dead ends: 2712 [2020-11-12 00:57:18,464 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=432, Invalid=1128, Unknown=0, NotChecked=0, Total=1560 [2020-11-12 00:57:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2020-11-12 00:57:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2072. [2020-11-12 00:57:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2062 states have (on average 2.248302618816683) internal successors, (4636), 2071 states have internal predecessors, (4636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 4636 transitions. [2020-11-12 00:57:18,493 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 4636 transitions. Word has length 18 [2020-11-12 00:57:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:18,493 INFO L481 AbstractCegarLoop]: Abstraction has 2072 states and 4636 transitions. [2020-11-12 00:57:18,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 4636 transitions. [2020-11-12 00:57:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:18,495 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:18,495 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:18,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-12 00:57:18,496 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1008354024, now seen corresponding path program 3 times [2020-11-12 00:57:18,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:18,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095442227] [2020-11-12 00:57:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:18,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095442227] [2020-11-12 00:57:18,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:18,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:18,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19407954] [2020-11-12 00:57:18,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:18,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:18,856 INFO L87 Difference]: Start difference. First operand 2072 states and 4636 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:21,306 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-11-12 00:57:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:23,771 INFO L93 Difference]: Finished difference Result 2634 states and 5863 transitions. [2020-11-12 00:57:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-12 00:57:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:23,776 INFO L225 Difference]: With dead ends: 2634 [2020-11-12 00:57:23,776 INFO L226 Difference]: Without dead ends: 2634 [2020-11-12 00:57:23,777 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2020-11-12 00:57:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2020-11-12 00:57:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2079. [2020-11-12 00:57:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2069 states have (on average 2.248429192846786) internal successors, (4652), 2078 states have internal predecessors, (4652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 4652 transitions. [2020-11-12 00:57:23,810 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 4652 transitions. Word has length 18 [2020-11-12 00:57:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:23,810 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 4652 transitions. [2020-11-12 00:57:23,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 4652 transitions. [2020-11-12 00:57:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:23,813 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:23,813 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:23,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-12 00:57:23,813 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -653552610, now seen corresponding path program 4 times [2020-11-12 00:57:23,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:23,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712814922] [2020-11-12 00:57:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:24,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712814922] [2020-11-12 00:57:24,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:24,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:24,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346744524] [2020-11-12 00:57:24,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:24,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:24,229 INFO L87 Difference]: Start difference. First operand 2079 states and 4652 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:25,252 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-11-12 00:57:25,641 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-11-12 00:57:25,958 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-11-12 00:57:26,120 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-11-12 00:57:26,697 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2020-11-12 00:57:27,036 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-11-12 00:57:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:29,198 INFO L93 Difference]: Finished difference Result 2670 states and 5940 transitions. [2020-11-12 00:57:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-12 00:57:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:29,203 INFO L225 Difference]: With dead ends: 2670 [2020-11-12 00:57:29,203 INFO L226 Difference]: Without dead ends: 2670 [2020-11-12 00:57:29,203 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2020-11-12 00:57:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2020-11-12 00:57:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2086. [2020-11-12 00:57:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2076 states have (on average 2.2485549132947975) internal successors, (4668), 2085 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 4668 transitions. [2020-11-12 00:57:29,232 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 4668 transitions. Word has length 18 [2020-11-12 00:57:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:29,232 INFO L481 AbstractCegarLoop]: Abstraction has 2086 states and 4668 transitions. [2020-11-12 00:57:29,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 4668 transitions. [2020-11-12 00:57:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:29,234 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:29,234 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:29,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-12 00:57:29,235 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1164614568, now seen corresponding path program 5 times [2020-11-12 00:57:29,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:29,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396825751] [2020-11-12 00:57:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:29,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396825751] [2020-11-12 00:57:29,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:29,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:29,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640709939] [2020-11-12 00:57:29,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:29,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:29,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:29,648 INFO L87 Difference]: Start difference. First operand 2086 states and 4668 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:30,693 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-11-12 00:57:31,077 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2020-11-12 00:57:31,396 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-11-12 00:57:31,559 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-11-12 00:57:32,140 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-11-12 00:57:32,486 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-11-12 00:57:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:34,701 INFO L93 Difference]: Finished difference Result 2705 states and 6027 transitions. [2020-11-12 00:57:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-12 00:57:34,702 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:34,706 INFO L225 Difference]: With dead ends: 2705 [2020-11-12 00:57:34,707 INFO L226 Difference]: Without dead ends: 2705 [2020-11-12 00:57:34,707 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2020-11-12 00:57:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2020-11-12 00:57:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2093. [2020-11-12 00:57:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2083 states have (on average 2.2486797887662027) internal successors, (4684), 2092 states have internal predecessors, (4684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 4684 transitions. [2020-11-12 00:57:34,753 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 4684 transitions. Word has length 18 [2020-11-12 00:57:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:34,754 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 4684 transitions. [2020-11-12 00:57:34,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 4684 transitions. [2020-11-12 00:57:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:34,755 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:34,755 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:34,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-12 00:57:34,756 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1148320350, now seen corresponding path program 6 times [2020-11-12 00:57:34,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:34,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936940057] [2020-11-12 00:57:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:35,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936940057] [2020-11-12 00:57:35,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:35,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:35,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772643752] [2020-11-12 00:57:35,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:35,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:35,112 INFO L87 Difference]: Start difference. First operand 2093 states and 4684 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:39,626 INFO L93 Difference]: Finished difference Result 2599 states and 5794 transitions. [2020-11-12 00:57:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-12 00:57:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:39,630 INFO L225 Difference]: With dead ends: 2599 [2020-11-12 00:57:39,630 INFO L226 Difference]: Without dead ends: 2599 [2020-11-12 00:57:39,631 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=262, Invalid=928, Unknown=0, NotChecked=0, Total=1190 [2020-11-12 00:57:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2020-11-12 00:57:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2107. [2020-11-12 00:57:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2097 states have (on average 2.2489270386266096) internal successors, (4716), 2106 states have internal predecessors, (4716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 4716 transitions. [2020-11-12 00:57:39,662 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 4716 transitions. Word has length 18 [2020-11-12 00:57:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:39,663 INFO L481 AbstractCegarLoop]: Abstraction has 2107 states and 4716 transitions. [2020-11-12 00:57:39,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 4716 transitions. [2020-11-12 00:57:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:39,665 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:39,665 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:39,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-12 00:57:39,665 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1956411800, now seen corresponding path program 7 times [2020-11-12 00:57:39,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:39,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195692790] [2020-11-12 00:57:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:40,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195692790] [2020-11-12 00:57:40,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:40,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:40,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139526611] [2020-11-12 00:57:40,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:40,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:40,060 INFO L87 Difference]: Start difference. First operand 2107 states and 4716 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:44,259 INFO L93 Difference]: Finished difference Result 2519 states and 5622 transitions. [2020-11-12 00:57:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-12 00:57:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:44,264 INFO L225 Difference]: With dead ends: 2519 [2020-11-12 00:57:44,264 INFO L226 Difference]: Without dead ends: 2519 [2020-11-12 00:57:44,265 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2020-11-12 00:57:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2020-11-12 00:57:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2072. [2020-11-12 00:57:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2062 states have (on average 2.248302618816683) internal successors, (4636), 2071 states have internal predecessors, (4636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 4636 transitions. [2020-11-12 00:57:44,298 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 4636 transitions. Word has length 18 [2020-11-12 00:57:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:44,298 INFO L481 AbstractCegarLoop]: Abstraction has 2072 states and 4636 transitions. [2020-11-12 00:57:44,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 4636 transitions. [2020-11-12 00:57:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:57:44,300 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:44,300 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:44,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-12 00:57:44,301 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:44,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -963683392, now seen corresponding path program 1 times [2020-11-12 00:57:44,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:44,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115444279] [2020-11-12 00:57:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:44,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115444279] [2020-11-12 00:57:44,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:44,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 00:57:44,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277403660] [2020-11-12 00:57:44,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-12 00:57:44,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:44,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-12 00:57:44,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:57:44,802 INFO L87 Difference]: Start difference. First operand 2072 states and 4636 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:45,904 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2020-11-12 00:57:47,748 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2020-11-12 00:57:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:49,569 INFO L93 Difference]: Finished difference Result 3712 states and 8268 transitions. [2020-11-12 00:57:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-12 00:57:49,570 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-12 00:57:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:49,574 INFO L225 Difference]: With dead ends: 3712 [2020-11-12 00:57:49,574 INFO L226 Difference]: Without dead ends: 3712 [2020-11-12 00:57:49,575 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2020-11-12 00:57:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2020-11-12 00:57:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 2062. [2020-11-12 00:57:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2052 states have (on average 2.2441520467836256) internal successors, (4605), 2061 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 4605 transitions. [2020-11-12 00:57:49,607 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 4605 transitions. Word has length 18 [2020-11-12 00:57:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:49,607 INFO L481 AbstractCegarLoop]: Abstraction has 2062 states and 4605 transitions. [2020-11-12 00:57:49,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 4605 transitions. [2020-11-12 00:57:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:57:49,609 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:49,609 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:49,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-12 00:57:49,609 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:49,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1235962451, now seen corresponding path program 1 times [2020-11-12 00:57:49,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:49,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608580776] [2020-11-12 00:57:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:50,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608580776] [2020-11-12 00:57:50,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:50,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:50,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251614996] [2020-11-12 00:57:50,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:50,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:50,063 INFO L87 Difference]: Start difference. First operand 2062 states and 4605 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:51,667 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-11-12 00:57:52,055 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-11-12 00:57:52,952 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-11-12 00:57:53,103 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2020-11-12 00:57:53,417 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-11-12 00:57:53,577 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-11-12 00:57:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:57:56,628 INFO L93 Difference]: Finished difference Result 3756 states and 8386 transitions. [2020-11-12 00:57:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-12 00:57:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:57:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:57:56,635 INFO L225 Difference]: With dead ends: 3756 [2020-11-12 00:57:56,635 INFO L226 Difference]: Without dead ends: 3756 [2020-11-12 00:57:56,636 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=483, Invalid=1239, Unknown=0, NotChecked=0, Total=1722 [2020-11-12 00:57:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2020-11-12 00:57:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 2103. [2020-11-12 00:57:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2093 states have (on average 2.2441471571906355) internal successors, (4697), 2102 states have internal predecessors, (4697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4697 transitions. [2020-11-12 00:57:56,667 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4697 transitions. Word has length 20 [2020-11-12 00:57:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:57:56,667 INFO L481 AbstractCegarLoop]: Abstraction has 2103 states and 4697 transitions. [2020-11-12 00:57:56,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4697 transitions. [2020-11-12 00:57:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:57:56,669 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:57:56,669 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:57:56,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-12 00:57:56,670 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:57:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:57:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 964500697, now seen corresponding path program 2 times [2020-11-12 00:57:56,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:57:56,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731777053] [2020-11-12 00:57:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:57:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:57:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:57:57,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731777053] [2020-11-12 00:57:57,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:57:57,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:57:57,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327762793] [2020-11-12 00:57:57,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:57:57,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:57:57,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:57:57,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:57:57,163 INFO L87 Difference]: Start difference. First operand 2103 states and 4697 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:57:58,297 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-11-12 00:57:58,636 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-11-12 00:57:59,024 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-11-12 00:57:59,471 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2020-11-12 00:57:59,614 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-11-12 00:58:00,657 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2020-11-12 00:58:00,821 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-11-12 00:58:01,173 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-11-12 00:58:01,334 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2020-11-12 00:58:01,513 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-12 00:58:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:04,902 INFO L93 Difference]: Finished difference Result 3879 states and 8659 transitions. [2020-11-12 00:58:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-12 00:58:04,904 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:04,909 INFO L225 Difference]: With dead ends: 3879 [2020-11-12 00:58:04,909 INFO L226 Difference]: Without dead ends: 3879 [2020-11-12 00:58:04,909 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=507, Invalid=1385, Unknown=0, NotChecked=0, Total=1892 [2020-11-12 00:58:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2020-11-12 00:58:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 2103. [2020-11-12 00:58:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2093 states have (on average 2.2441471571906355) internal successors, (4697), 2102 states have internal predecessors, (4697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4697 transitions. [2020-11-12 00:58:04,948 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4697 transitions. Word has length 20 [2020-11-12 00:58:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:04,948 INFO L481 AbstractCegarLoop]: Abstraction has 2103 states and 4697 transitions. [2020-11-12 00:58:04,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4697 transitions. [2020-11-12 00:58:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:04,950 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:04,950 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:04,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-12 00:58:04,951 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash -639808359, now seen corresponding path program 3 times [2020-11-12 00:58:04,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:04,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356382034] [2020-11-12 00:58:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:05,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356382034] [2020-11-12 00:58:05,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:05,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:05,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605664180] [2020-11-12 00:58:05,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:58:05,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:58:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:58:05,435 INFO L87 Difference]: Start difference. First operand 2103 states and 4697 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:06,508 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-11-12 00:58:06,846 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-11-12 00:58:07,243 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-11-12 00:58:07,606 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2020-11-12 00:58:07,750 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-11-12 00:58:08,729 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2020-11-12 00:58:08,889 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-11-12 00:58:09,277 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-11-12 00:58:09,441 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2020-11-12 00:58:09,619 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-11-12 00:58:09,881 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2020-11-12 00:58:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:13,019 INFO L93 Difference]: Finished difference Result 3339 states and 7505 transitions. [2020-11-12 00:58:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-12 00:58:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:13,025 INFO L225 Difference]: With dead ends: 3339 [2020-11-12 00:58:13,025 INFO L226 Difference]: Without dead ends: 3339 [2020-11-12 00:58:13,026 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=483, Invalid=1409, Unknown=0, NotChecked=0, Total=1892 [2020-11-12 00:58:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2020-11-12 00:58:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2110. [2020-11-12 00:58:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2100 states have (on average 2.244285714285714) internal successors, (4713), 2109 states have internal predecessors, (4713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 4713 transitions. [2020-11-12 00:58:13,060 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 4713 transitions. Word has length 20 [2020-11-12 00:58:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:13,060 INFO L481 AbstractCegarLoop]: Abstraction has 2110 states and 4713 transitions. [2020-11-12 00:58:13,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 4713 transitions. [2020-11-12 00:58:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:13,061 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:13,061 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:13,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-12 00:58:13,062 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1626826643, now seen corresponding path program 4 times [2020-11-12 00:58:13,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:13,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653751888] [2020-11-12 00:58:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:13,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653751888] [2020-11-12 00:58:13,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:13,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:13,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427087977] [2020-11-12 00:58:13,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:58:13,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:58:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:58:13,569 INFO L87 Difference]: Start difference. First operand 2110 states and 4713 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:14,680 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-11-12 00:58:15,228 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-11-12 00:58:15,573 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-11-12 00:58:16,357 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-12 00:58:16,519 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-11-12 00:58:16,864 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2020-11-12 00:58:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:19,623 INFO L93 Difference]: Finished difference Result 3134 states and 6972 transitions. [2020-11-12 00:58:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:58:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:19,629 INFO L225 Difference]: With dead ends: 3134 [2020-11-12 00:58:19,629 INFO L226 Difference]: Without dead ends: 3134 [2020-11-12 00:58:19,630 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:58:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2020-11-12 00:58:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2117. [2020-11-12 00:58:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2107 states have (on average 2.244423350735643) internal successors, (4729), 2116 states have internal predecessors, (4729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 4729 transitions. [2020-11-12 00:58:19,664 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 4729 transitions. Word has length 20 [2020-11-12 00:58:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:19,664 INFO L481 AbstractCegarLoop]: Abstraction has 2117 states and 4729 transitions. [2020-11-12 00:58:19,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 4729 transitions. [2020-11-12 00:58:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:19,666 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:19,666 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:19,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-12 00:58:19,666 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1006398183, now seen corresponding path program 5 times [2020-11-12 00:58:19,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:19,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169325162] [2020-11-12 00:58:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:20,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169325162] [2020-11-12 00:58:20,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:20,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:20,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702200587] [2020-11-12 00:58:20,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:58:20,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:20,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:58:20,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:58:20,215 INFO L87 Difference]: Start difference. First operand 2117 states and 4729 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:21,463 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2020-11-12 00:58:21,963 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2020-11-12 00:58:22,370 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2020-11-12 00:58:22,558 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-11-12 00:58:23,232 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-11-12 00:58:23,643 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2020-11-12 00:58:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:26,366 INFO L93 Difference]: Finished difference Result 3170 states and 7049 transitions. [2020-11-12 00:58:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-12 00:58:26,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:26,373 INFO L225 Difference]: With dead ends: 3170 [2020-11-12 00:58:26,373 INFO L226 Difference]: Without dead ends: 3170 [2020-11-12 00:58:26,374 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:58:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2020-11-12 00:58:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 2131. [2020-11-12 00:58:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 2121 states have (on average 2.2446958981612446) internal successors, (4761), 2130 states have internal predecessors, (4761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 4761 transitions. [2020-11-12 00:58:26,413 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 4761 transitions. Word has length 20 [2020-11-12 00:58:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:26,414 INFO L481 AbstractCegarLoop]: Abstraction has 2131 states and 4761 transitions. [2020-11-12 00:58:26,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 4761 transitions. [2020-11-12 00:58:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:26,416 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:26,417 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:26,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-12 00:58:26,417 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1649013616, now seen corresponding path program 1 times [2020-11-12 00:58:26,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:26,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193149367] [2020-11-12 00:58:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:26,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193149367] [2020-11-12 00:58:26,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:26,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:58:26,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314197103] [2020-11-12 00:58:26,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:58:26,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:58:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:58:26,637 INFO L87 Difference]: Start difference. First operand 2131 states and 4761 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:28,365 INFO L93 Difference]: Finished difference Result 3362 states and 7550 transitions. [2020-11-12 00:58:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 00:58:28,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:28,371 INFO L225 Difference]: With dead ends: 3362 [2020-11-12 00:58:28,371 INFO L226 Difference]: Without dead ends: 3323 [2020-11-12 00:58:28,372 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-12 00:58:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2020-11-12 00:58:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2568. [2020-11-12 00:58:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2558 states have (on average 2.283033620015637) internal successors, (5840), 2567 states have internal predecessors, (5840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 5840 transitions. [2020-11-12 00:58:28,409 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 5840 transitions. Word has length 20 [2020-11-12 00:58:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:28,409 INFO L481 AbstractCegarLoop]: Abstraction has 2568 states and 5840 transitions. [2020-11-12 00:58:28,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 5840 transitions. [2020-11-12 00:58:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:28,411 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:28,411 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:28,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-12 00:58:28,411 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash -278303911, now seen corresponding path program 6 times [2020-11-12 00:58:28,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:28,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507495506] [2020-11-12 00:58:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:28,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507495506] [2020-11-12 00:58:28,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:28,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:28,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442368937] [2020-11-12 00:58:28,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:58:28,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:58:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:58:28,931 INFO L87 Difference]: Start difference. First operand 2568 states and 5840 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:30,024 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-11-12 00:58:31,011 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-11-12 00:58:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:34,965 INFO L93 Difference]: Finished difference Result 3735 states and 8459 transitions. [2020-11-12 00:58:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-12 00:58:34,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:34,972 INFO L225 Difference]: With dead ends: 3735 [2020-11-12 00:58:34,972 INFO L226 Difference]: Without dead ends: 3735 [2020-11-12 00:58:34,973 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2020-11-12 00:58:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2020-11-12 00:58:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 2583. [2020-11-12 00:58:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2573 states have (on average 2.2833268558103383) internal successors, (5875), 2582 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 5875 transitions. [2020-11-12 00:58:35,013 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 5875 transitions. Word has length 20 [2020-11-12 00:58:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:35,014 INFO L481 AbstractCegarLoop]: Abstraction has 2583 states and 5875 transitions. [2020-11-12 00:58:35,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 5875 transitions. [2020-11-12 00:58:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:35,016 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:35,016 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:35,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-12 00:58:35,017 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 972393900, now seen corresponding path program 2 times [2020-11-12 00:58:35,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:35,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479134612] [2020-11-12 00:58:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:35,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-11-12 00:58:35,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479134612] [2020-11-12 00:58:35,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:35,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:35,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820623303] [2020-11-12 00:58:35,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:58:35,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:58:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:58:35,397 INFO L87 Difference]: Start difference. First operand 2583 states and 5875 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:36,350 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2020-11-12 00:58:36,741 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-11-12 00:58:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:39,667 INFO L93 Difference]: Finished difference Result 6651 states and 15018 transitions. [2020-11-12 00:58:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-12 00:58:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:39,678 INFO L225 Difference]: With dead ends: 6651 [2020-11-12 00:58:39,678 INFO L226 Difference]: Without dead ends: 6614 [2020-11-12 00:58:39,679 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2020-11-12 00:58:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states. [2020-11-12 00:58:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 2615. [2020-11-12 00:58:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2605 states have (on average 2.2829174664107486) internal successors, (5947), 2614 states have internal predecessors, (5947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5947 transitions. [2020-11-12 00:58:39,730 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5947 transitions. Word has length 20 [2020-11-12 00:58:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:39,731 INFO L481 AbstractCegarLoop]: Abstraction has 2615 states and 5947 transitions. [2020-11-12 00:58:39,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5947 transitions. [2020-11-12 00:58:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:39,732 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:39,732 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:39,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-12 00:58:39,732 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1091501037, now seen corresponding path program 7 times [2020-11-12 00:58:39,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:39,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309878218] [2020-11-12 00:58:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:40,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309878218] [2020-11-12 00:58:40,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:40,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:40,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626858701] [2020-11-12 00:58:40,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 00:58:40,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 00:58:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-12 00:58:40,290 INFO L87 Difference]: Start difference. First operand 2615 states and 5947 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:41,275 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-11-12 00:58:42,092 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-11-12 00:58:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:44,919 INFO L93 Difference]: Finished difference Result 3746 states and 8489 transitions. [2020-11-12 00:58:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-12 00:58:44,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:44,926 INFO L225 Difference]: With dead ends: 3746 [2020-11-12 00:58:44,926 INFO L226 Difference]: Without dead ends: 3746 [2020-11-12 00:58:44,927 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:58:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2020-11-12 00:58:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 2705. [2020-11-12 00:58:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2695 states have (on average 2.2957328385899816) internal successors, (6187), 2704 states have internal predecessors, (6187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 6187 transitions. [2020-11-12 00:58:44,963 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 6187 transitions. Word has length 20 [2020-11-12 00:58:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:44,963 INFO L481 AbstractCegarLoop]: Abstraction has 2705 states and 6187 transitions. [2020-11-12 00:58:44,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 6187 transitions. [2020-11-12 00:58:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:44,965 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:44,965 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:44,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-12 00:58:44,965 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash 159196774, now seen corresponding path program 3 times [2020-11-12 00:58:44,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:44,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747407699] [2020-11-12 00:58:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:58:45,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747407699] [2020-11-12 00:58:45,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:58:45,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 00:58:45,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956366899] [2020-11-12 00:58:45,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:58:45,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:58:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:58:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:58:45,326 INFO L87 Difference]: Start difference. First operand 2705 states and 6187 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:46,247 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2020-11-12 00:58:47,529 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-11-12 00:58:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:58:49,907 INFO L93 Difference]: Finished difference Result 5977 states and 13428 transitions. [2020-11-12 00:58:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-12 00:58:49,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2020-11-12 00:58:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:58:49,917 INFO L225 Difference]: With dead ends: 5977 [2020-11-12 00:58:49,917 INFO L226 Difference]: Without dead ends: 5957 [2020-11-12 00:58:49,918 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2020-11-12 00:58:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-11-12 00:58:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 2672. [2020-11-12 00:58:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2662 states have (on average 2.2960180315552217) internal successors, (6112), 2671 states have internal predecessors, (6112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 6112 transitions. [2020-11-12 00:58:49,968 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 6112 transitions. Word has length 20 [2020-11-12 00:58:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:58:49,969 INFO L481 AbstractCegarLoop]: Abstraction has 2672 states and 6112 transitions. [2020-11-12 00:58:49,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:58:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 6112 transitions. [2020-11-12 00:58:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-12 00:58:49,971 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:58:49,971 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:58:49,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-12 00:58:49,971 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:58:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:58:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -207848319, now seen corresponding path program 1 times [2020-11-12 00:58:49,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:58:49,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949398229] [2020-11-12 00:58:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:58:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:58:50,021 ERROR L253 erpolLogProxyWrapper]: Interpolant 6 not inductive [2020-11-12 00:58:50,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-12 00:58:50,048 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-12 00:58:50,052 INFO L168 Benchmark]: Toolchain (without parser) took 317210.20 ms. Allocated memory was 302.0 MB in the beginning and 551.6 MB in the end (delta: 249.6 MB). Free memory was 276.7 MB in the beginning and 223.5 MB in the end (delta: 53.2 MB). Peak memory consumption was 304.8 MB. Max. memory is 16.0 GB. [2020-11-12 00:58:50,052 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 00:58:50,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1267.03 ms. Allocated memory is still 302.0 MB. Free memory was 275.9 MB in the beginning and 256.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 42.8 MB. Max. memory is 16.0 GB. [2020-11-12 00:58:50,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.99 ms. Allocated memory is still 302.0 MB. Free memory was 256.9 MB in the beginning and 253.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-12 00:58:50,053 INFO L168 Benchmark]: Boogie Preprocessor took 113.32 ms. Allocated memory is still 302.0 MB. Free memory was 252.7 MB in the beginning and 249.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-12 00:58:50,053 INFO L168 Benchmark]: RCFGBuilder took 1200.02 ms. Allocated memory is still 302.0 MB. Free memory was 249.6 MB in the beginning and 160.4 MB in the end (delta: 89.1 MB). Peak memory consumption was 88.1 MB. Max. memory is 16.0 GB. [2020-11-12 00:58:50,053 INFO L168 Benchmark]: TraceAbstraction took 314496.63 ms. Allocated memory was 302.0 MB in the beginning and 551.6 MB in the end (delta: 249.6 MB). Free memory was 160.4 MB in the beginning and 223.5 MB in the end (delta: -63.1 MB). Peak memory consumption was 186.5 MB. Max. memory is 16.0 GB. [2020-11-12 00:58:50,055 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1267.03 ms. Allocated memory is still 302.0 MB. Free memory was 275.9 MB in the beginning and 256.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 42.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 119.99 ms. Allocated memory is still 302.0 MB. Free memory was 256.9 MB in the beginning and 253.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 113.32 ms. Allocated memory is still 302.0 MB. Free memory was 252.7 MB in the beginning and 249.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1200.02 ms. Allocated memory is still 302.0 MB. Free memory was 249.6 MB in the beginning and 160.4 MB in the end (delta: 89.1 MB). Peak memory consumption was 88.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 314496.63 ms. Allocated memory was 302.0 MB in the beginning and 551.6 MB in the end (delta: 249.6 MB). Free memory was 160.4 MB in the beginning and 223.5 MB in the end (delta: -63.1 MB). Peak memory consumption was 186.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 22808 VarBasedMoverChecksPositive, 1004 VarBasedMoverChecksNegative, 645 SemBasedMoverChecksPositive, 341 SemBasedMoverChecksNegative, 18 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 42.6s, 936 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 101.7s, 459 PlacesBefore, 106 PlacesAfterwards, 498 TransitionsBefore, 123 TransitionsAfterwards, 34102 CoEnabledTransitionPairs, 14 FixpointIterations, 156 TrivialSequentialCompositions, 303 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 85 ConcurrentYvCompositions, 22 ChoiceCompositions, 595 TotalNumberOfCompositions, 126462 MoverChecksTotal - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...