/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 07:43:20,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 07:43:20,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 07:43:20,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 07:43:20,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 07:43:20,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 07:43:20,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 07:43:20,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 07:43:20,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 07:43:20,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 07:43:20,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 07:43:20,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 07:43:20,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 07:43:20,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 07:43:20,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 07:43:20,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 07:43:20,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 07:43:20,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 07:43:20,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 07:43:20,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 07:43:20,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 07:43:20,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 07:43:20,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 07:43:20,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 07:43:20,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 07:43:20,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 07:43:20,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 07:43:20,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 07:43:20,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 07:43:20,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 07:43:20,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 07:43:20,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 07:43:20,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 07:43:20,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 07:43:20,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 07:43:20,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 07:43:20,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 07:43:20,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 07:43:20,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 07:43:20,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 07:43:20,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 07:43:20,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 07:43:20,161 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 07:43:20,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 07:43:20,162 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 07:43:20,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 07:43:20,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 07:43:20,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 07:43:20,165 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 07:43:20,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 07:43:20,165 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 07:43:20,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 07:43:20,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 07:43:20,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 07:43:20,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 07:43:20,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 07:43:20,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 07:43:20,167 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 07:43:20,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 07:43:20,167 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 07:43:20,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 07:43:20,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 07:43:20,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 07:43:20,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 07:43:20,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 07:43:20,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 07:43:20,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 07:43:20,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 07:43:20,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 07:43:20,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 07:43:20,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 07:43:20,169 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 07:43:20,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 07:43:20,169 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 07:43:20,170 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 [2021-06-05 07:43:20,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 07:43:20,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 07:43:20,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 07:43:20,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 07:43:20,509 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 07:43:20,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2021-06-05 07:43:20,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2f25216/2a160ee141b64617ab480304ad31d6ce/FLAG6a4b2a493 [2021-06-05 07:43:21,139 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 07:43:21,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2021-06-05 07:43:21,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2f25216/2a160ee141b64617ab480304ad31d6ce/FLAG6a4b2a493 [2021-06-05 07:43:21,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2f25216/2a160ee141b64617ab480304ad31d6ce [2021-06-05 07:43:21,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 07:43:21,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 07:43:21,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 07:43:21,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 07:43:21,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 07:43:21,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:43:21" (1/1) ... [2021-06-05 07:43:21,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b34540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:21, skipping insertion in model container [2021-06-05 07:43:21,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:43:21" (1/1) ... [2021-06-05 07:43:21,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 07:43:21,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 07:43:22,030 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2021-06-05 07:43:22,040 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2021-06-05 07:43:22,045 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2021-06-05 07:43:22,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:43:22,063 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 07:43:22,121 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2021-06-05 07:43:22,122 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2021-06-05 07:43:22,124 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2021-06-05 07:43:22,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:43:22,272 INFO L208 MainTranslator]: Completed translation [2021-06-05 07:43:22,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22 WrapperNode [2021-06-05 07:43:22,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 07:43:22,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 07:43:22,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 07:43:22,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 07:43:22,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 07:43:22,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 07:43:22,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 07:43:22,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 07:43:22,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (1/1) ... [2021-06-05 07:43:22,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 07:43:22,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 07:43:22,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 07:43:22,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 07:43:22,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (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 [2021-06-05 07:43:22,469 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-05 07:43:22,469 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-05 07:43:22,469 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-05 07:43:22,470 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-05 07:43:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 07:43:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 07:43:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 07:43:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 07:43:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 07:43:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 07:43:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 07:43:22,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 07:43:22,473 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 07:43:23,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 07:43:23,054 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-05 07:43:23,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:43:23 BoogieIcfgContainer [2021-06-05 07:43:23,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 07:43:23,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 07:43:23,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 07:43:23,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 07:43:23,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:43:21" (1/3) ... [2021-06-05 07:43:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d41d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:43:23, skipping insertion in model container [2021-06-05 07:43:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:22" (2/3) ... [2021-06-05 07:43:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d41d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:43:23, skipping insertion in model container [2021-06-05 07:43:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:43:23" (3/3) ... [2021-06-05 07:43:23,062 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2021-06-05 07:43:23,067 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 07:43:23,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 07:43:23,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 07:43:23,068 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 07:43:23,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,128 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,128 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,130 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,130 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,132 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,134 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,138 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,138 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,138 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,141 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,144 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,147 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,151 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,152 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,152 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,152 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,152 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,152 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,153 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,153 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,153 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,153 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,154 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,155 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,156 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,157 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,158 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,159 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,160 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,160 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,160 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,160 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,161 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,161 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,161 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,162 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,162 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,163 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,164 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,165 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,166 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,166 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,166 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,166 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,166 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,166 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,167 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,172 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,173 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,174 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,175 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,175 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,175 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,175 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,175 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,175 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,176 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,179 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,179 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,179 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,180 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,181 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,182 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,183 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,183 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,183 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,183 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,184 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,185 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,185 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,185 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,185 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,185 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,186 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,187 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,188 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,189 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,190 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,190 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,190 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,190 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,190 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,191 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,192 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,193 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,194 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,195 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,196 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,197 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,198 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,202 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,202 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,202 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,203 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,203 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,203 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,204 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,206 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,208 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,208 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,209 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,212 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,212 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,212 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,213 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,214 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,215 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,216 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,217 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,217 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,217 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,217 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,218 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,219 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,220 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,221 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,222 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,223 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,224 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,225 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,226 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,227 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,227 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,227 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,227 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,228 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,229 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,230 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,235 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,239 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,239 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,239 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,239 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,239 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,243 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,243 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,243 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,244 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,245 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:23,259 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 07:43:23,282 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 07:43:23,299 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 07:43:23,299 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 07:43:23,299 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 07:43:23,299 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 07:43:23,299 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 07:43:23,299 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 07:43:23,300 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 07:43:23,300 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 07:43:23,313 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 07:43:24,589 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 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) [2021-06-05 07:43:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 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) [2021-06-05 07:43:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 07:43:24,642 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:24,642 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:24,643 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:24,652 INFO L82 PathProgramCache]: Analyzing trace with hash 617310073, now seen corresponding path program 1 times [2021-06-05 07:43:24,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:24,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024741933] [2021-06-05 07:43:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:24,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:24,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024741933] [2021-06-05 07:43:24,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024741933] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:24,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:24,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 07:43:24,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415326965] [2021-06-05 07:43:24,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 07:43:24,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 07:43:24,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 07:43:24,959 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 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, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2021-06-05 07:43:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:25,255 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-05 07:43:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 07:43:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 48 [2021-06-05 07:43:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:25,405 INFO L225 Difference]: With dead ends: 23006 [2021-06-05 07:43:25,405 INFO L226 Difference]: Without dead ends: 22283 [2021-06-05 07:43:25,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 07:43:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2021-06-05 07:43:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22283. [2021-06-05 07:43:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22283 states, 22280 states have (on average 2.798653500897666) internal successors, (62354), 22282 states have internal predecessors, (62354), 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) [2021-06-05 07:43:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22283 states to 22283 states and 62354 transitions. [2021-06-05 07:43:26,301 INFO L78 Accepts]: Start accepts. Automaton has 22283 states and 62354 transitions. Word has length 48 [2021-06-05 07:43:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:26,302 INFO L482 AbstractCegarLoop]: Abstraction has 22283 states and 62354 transitions. [2021-06-05 07:43:26,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2021-06-05 07:43:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 62354 transitions. [2021-06-05 07:43:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 07:43:26,312 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:26,312 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:26,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 07:43:26,313 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash -383819529, now seen corresponding path program 1 times [2021-06-05 07:43:26,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:26,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464449587] [2021-06-05 07:43:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:26,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:26,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464449587] [2021-06-05 07:43:26,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464449587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:26,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:26,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:43:26,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423396821] [2021-06-05 07:43:26,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:43:26,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:43:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:43:26,569 INFO L87 Difference]: Start difference. First operand 22283 states and 62354 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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) [2021-06-05 07:43:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:27,368 INFO L93 Difference]: Finished difference Result 22280 states and 62350 transitions. [2021-06-05 07:43:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 07:43:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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 83 [2021-06-05 07:43:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:27,427 INFO L225 Difference]: With dead ends: 22280 [2021-06-05 07:43:27,427 INFO L226 Difference]: Without dead ends: 22280 [2021-06-05 07:43:27,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 348.8ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:43:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2021-06-05 07:43:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 22280. [2021-06-05 07:43:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22280 states, 22277 states have (on average 2.798850832697401) internal successors, (62350), 22279 states have internal predecessors, (62350), 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) [2021-06-05 07:43:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 62350 transitions. [2021-06-05 07:43:28,161 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 62350 transitions. Word has length 83 [2021-06-05 07:43:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:28,162 INFO L482 AbstractCegarLoop]: Abstraction has 22280 states and 62350 transitions. [2021-06-05 07:43:28,162 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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) [2021-06-05 07:43:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 62350 transitions. [2021-06-05 07:43:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 07:43:28,167 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:28,167 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:28,167 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 07:43:28,167 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:28,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1409373696, now seen corresponding path program 1 times [2021-06-05 07:43:28,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:28,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537748819] [2021-06-05 07:43:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:28,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:28,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537748819] [2021-06-05 07:43:28,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537748819] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:28,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:28,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 07:43:28,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946770308] [2021-06-05 07:43:28,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 07:43:28,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 07:43:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 07:43:28,224 INFO L87 Difference]: Start difference. First operand 22280 states and 62350 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2021-06-05 07:43:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:28,528 INFO L93 Difference]: Finished difference Result 22063 states and 61535 transitions. [2021-06-05 07:43:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 07:43:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2021-06-05 07:43:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:28,590 INFO L225 Difference]: With dead ends: 22063 [2021-06-05 07:43:28,590 INFO L226 Difference]: Without dead ends: 22063 [2021-06-05 07:43:28,591 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 07:43:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2021-06-05 07:43:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22063. [2021-06-05 07:43:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22063 states, 22060 states have (on average 2.7894378966455124) internal successors, (61535), 22062 states have internal predecessors, (61535), 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) [2021-06-05 07:43:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22063 states to 22063 states and 61535 transitions. [2021-06-05 07:43:29,241 INFO L78 Accepts]: Start accepts. Automaton has 22063 states and 61535 transitions. Word has length 84 [2021-06-05 07:43:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:29,241 INFO L482 AbstractCegarLoop]: Abstraction has 22063 states and 61535 transitions. [2021-06-05 07:43:29,242 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2021-06-05 07:43:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22063 states and 61535 transitions. [2021-06-05 07:43:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 07:43:29,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:29,257 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:29,257 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 07:43:29,257 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:29,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1743993907, now seen corresponding path program 1 times [2021-06-05 07:43:29,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:29,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370682949] [2021-06-05 07:43:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:29,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:29,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370682949] [2021-06-05 07:43:29,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370682949] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:29,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:29,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 07:43:29,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710586330] [2021-06-05 07:43:29,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 07:43:29,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 07:43:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:29,373 INFO L87 Difference]: Start difference. First operand 22063 states and 61535 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2021-06-05 07:43:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:29,556 INFO L93 Difference]: Finished difference Result 15355 states and 42187 transitions. [2021-06-05 07:43:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 07:43:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2021-06-05 07:43:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:29,595 INFO L225 Difference]: With dead ends: 15355 [2021-06-05 07:43:29,595 INFO L226 Difference]: Without dead ends: 15112 [2021-06-05 07:43:29,599 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2021-06-05 07:43:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 15112. [2021-06-05 07:43:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15112 states, 15110 states have (on average 2.7499007279947056) internal successors, (41551), 15111 states have internal predecessors, (41551), 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) [2021-06-05 07:43:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 41551 transitions. [2021-06-05 07:43:30,006 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 41551 transitions. Word has length 93 [2021-06-05 07:43:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:30,007 INFO L482 AbstractCegarLoop]: Abstraction has 15112 states and 41551 transitions. [2021-06-05 07:43:30,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2021-06-05 07:43:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 41551 transitions. [2021-06-05 07:43:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 07:43:30,013 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:30,013 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:30,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 07:43:30,014 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash -477175304, now seen corresponding path program 1 times [2021-06-05 07:43:30,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:30,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209437723] [2021-06-05 07:43:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:30,064 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:30,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209437723] [2021-06-05 07:43:30,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209437723] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:30,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:30,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 07:43:30,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883394431] [2021-06-05 07:43:30,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 07:43:30,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 07:43:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 07:43:30,067 INFO L87 Difference]: Start difference. First operand 15112 states and 41551 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2021-06-05 07:43:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:30,167 INFO L93 Difference]: Finished difference Result 26661 states and 73631 transitions. [2021-06-05 07:43:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 07:43:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2021-06-05 07:43:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:30,234 INFO L225 Difference]: With dead ends: 26661 [2021-06-05 07:43:30,234 INFO L226 Difference]: Without dead ends: 26571 [2021-06-05 07:43:30,235 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 07:43:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26571 states. [2021-06-05 07:43:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26571 to 15217. [2021-06-05 07:43:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15217 states, 15215 states have (on average 2.7484719027275717) internal successors, (41818), 15216 states have internal predecessors, (41818), 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) [2021-06-05 07:43:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15217 states to 15217 states and 41818 transitions. [2021-06-05 07:43:30,851 INFO L78 Accepts]: Start accepts. Automaton has 15217 states and 41818 transitions. Word has length 99 [2021-06-05 07:43:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:30,852 INFO L482 AbstractCegarLoop]: Abstraction has 15217 states and 41818 transitions. [2021-06-05 07:43:30,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2021-06-05 07:43:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 15217 states and 41818 transitions. [2021-06-05 07:43:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-05 07:43:30,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:30,862 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:30,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 07:43:30,862 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1731505684, now seen corresponding path program 1 times [2021-06-05 07:43:30,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:30,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728982774] [2021-06-05 07:43:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:31,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:31,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728982774] [2021-06-05 07:43:31,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728982774] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:31,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:31,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 07:43:31,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41745293] [2021-06-05 07:43:31,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 07:43:31,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 07:43:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 07:43:31,254 INFO L87 Difference]: Start difference. First operand 15217 states and 41818 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 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) [2021-06-05 07:43:32,006 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2021-06-05 07:43:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:32,201 INFO L93 Difference]: Finished difference Result 15327 states and 42117 transitions. [2021-06-05 07:43:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:43:32,201 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 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 100 [2021-06-05 07:43:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:32,229 INFO L225 Difference]: With dead ends: 15327 [2021-06-05 07:43:32,230 INFO L226 Difference]: Without dead ends: 15327 [2021-06-05 07:43:32,230 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 715.1ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:43:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2021-06-05 07:43:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 15267. [2021-06-05 07:43:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15267 states, 15265 states have (on average 2.748444153291844) internal successors, (41955), 15266 states have internal predecessors, (41955), 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) [2021-06-05 07:43:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 41955 transitions. [2021-06-05 07:43:32,555 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 41955 transitions. Word has length 100 [2021-06-05 07:43:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:32,556 INFO L482 AbstractCegarLoop]: Abstraction has 15267 states and 41955 transitions. [2021-06-05 07:43:32,556 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 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) [2021-06-05 07:43:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 41955 transitions. [2021-06-05 07:43:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-05 07:43:32,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:32,564 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:32,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 07:43:32,564 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash 588694202, now seen corresponding path program 1 times [2021-06-05 07:43:32,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:32,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611012395] [2021-06-05 07:43:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:33,407 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:33,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611012395] [2021-06-05 07:43:33,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611012395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:33,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:33,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 07:43:33,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004628042] [2021-06-05 07:43:33,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 07:43:33,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 07:43:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-05 07:43:33,409 INFO L87 Difference]: Start difference. First operand 15267 states and 41955 transitions. Second operand has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 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) [2021-06-05 07:43:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:35,592 INFO L93 Difference]: Finished difference Result 15277 states and 41997 transitions. [2021-06-05 07:43:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:43:35,593 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 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 104 [2021-06-05 07:43:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:35,628 INFO L225 Difference]: With dead ends: 15277 [2021-06-05 07:43:35,628 INFO L226 Difference]: Without dead ends: 15262 [2021-06-05 07:43:35,630 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1831.5ms TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 07:43:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2021-06-05 07:43:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 15262. [2021-06-05 07:43:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15262 states, 15260 states have (on average 2.750524246395806) internal successors, (41973), 15261 states have internal predecessors, (41973), 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) [2021-06-05 07:43:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15262 states to 15262 states and 41973 transitions. [2021-06-05 07:43:35,992 INFO L78 Accepts]: Start accepts. Automaton has 15262 states and 41973 transitions. Word has length 104 [2021-06-05 07:43:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:35,992 INFO L482 AbstractCegarLoop]: Abstraction has 15262 states and 41973 transitions. [2021-06-05 07:43:35,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 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) [2021-06-05 07:43:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 15262 states and 41973 transitions. [2021-06-05 07:43:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 07:43:36,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:36,002 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:36,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 07:43:36,003 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1887066075, now seen corresponding path program 1 times [2021-06-05 07:43:36,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:36,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211281692] [2021-06-05 07:43:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:36,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:36,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211281692] [2021-06-05 07:43:36,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211281692] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:36,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:36,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:43:36,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529673178] [2021-06-05 07:43:36,430 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:43:36,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:43:36,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:43:36,431 INFO L87 Difference]: Start difference. First operand 15262 states and 41973 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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) [2021-06-05 07:43:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:37,419 INFO L93 Difference]: Finished difference Result 17982 states and 49376 transitions. [2021-06-05 07:43:37,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 07:43:37,419 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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 105 [2021-06-05 07:43:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:37,450 INFO L225 Difference]: With dead ends: 17982 [2021-06-05 07:43:37,450 INFO L226 Difference]: Without dead ends: 17982 [2021-06-05 07:43:37,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 767.6ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 07:43:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17982 states. [2021-06-05 07:43:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17982 to 16042. [2021-06-05 07:43:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16042 states, 16040 states have (on average 2.748067331670823) internal successors, (44079), 16041 states have internal predecessors, (44079), 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) [2021-06-05 07:43:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16042 states to 16042 states and 44079 transitions. [2021-06-05 07:43:37,911 INFO L78 Accepts]: Start accepts. Automaton has 16042 states and 44079 transitions. Word has length 105 [2021-06-05 07:43:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:37,912 INFO L482 AbstractCegarLoop]: Abstraction has 16042 states and 44079 transitions. [2021-06-05 07:43:37,912 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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) [2021-06-05 07:43:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 16042 states and 44079 transitions. [2021-06-05 07:43:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 07:43:37,920 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:37,920 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:37,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 07:43:37,921 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1261951723, now seen corresponding path program 2 times [2021-06-05 07:43:37,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:37,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525448971] [2021-06-05 07:43:37,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:38,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:38,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525448971] [2021-06-05 07:43:38,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525448971] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:38,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:38,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 07:43:38,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172649343] [2021-06-05 07:43:38,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 07:43:38,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 07:43:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:43:38,649 INFO L87 Difference]: Start difference. First operand 16042 states and 44079 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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) [2021-06-05 07:43:39,138 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2021-06-05 07:43:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:40,708 INFO L93 Difference]: Finished difference Result 18485 states and 50800 transitions. [2021-06-05 07:43:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:43:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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 105 [2021-06-05 07:43:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:40,728 INFO L225 Difference]: With dead ends: 18485 [2021-06-05 07:43:40,728 INFO L226 Difference]: Without dead ends: 18260 [2021-06-05 07:43:40,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1913.6ms TimeCoverageRelationStatistics Valid=524, Invalid=2128, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 07:43:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18260 states. [2021-06-05 07:43:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18260 to 16342. [2021-06-05 07:43:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16342 states, 16340 states have (on average 2.752264381884945) internal successors, (44972), 16341 states have internal predecessors, (44972), 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) [2021-06-05 07:43:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 44972 transitions. [2021-06-05 07:43:40,986 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 44972 transitions. Word has length 105 [2021-06-05 07:43:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:40,987 INFO L482 AbstractCegarLoop]: Abstraction has 16342 states and 44972 transitions. [2021-06-05 07:43:40,987 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 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) [2021-06-05 07:43:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 44972 transitions. [2021-06-05 07:43:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 07:43:40,995 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:40,995 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:40,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 07:43:40,995 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1732922443, now seen corresponding path program 1 times [2021-06-05 07:43:40,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:40,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801183420] [2021-06-05 07:43:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:41,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:41,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801183420] [2021-06-05 07:43:41,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801183420] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:41,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:41,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 07:43:41,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457294682] [2021-06-05 07:43:41,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 07:43:41,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 07:43:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-05 07:43:41,768 INFO L87 Difference]: Start difference. First operand 16342 states and 44972 transitions. Second operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 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) [2021-06-05 07:43:42,208 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2021-06-05 07:43:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:43,965 INFO L93 Difference]: Finished difference Result 18538 states and 51034 transitions. [2021-06-05 07:43:43,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:43:43,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 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 109 [2021-06-05 07:43:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:43,989 INFO L225 Difference]: With dead ends: 18538 [2021-06-05 07:43:43,989 INFO L226 Difference]: Without dead ends: 17908 [2021-06-05 07:43:43,990 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1927.4ms TimeCoverageRelationStatistics Valid=525, Invalid=2337, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 07:43:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17908 states. [2021-06-05 07:43:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17908 to 15487. [2021-06-05 07:43:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15487 states, 15485 states have (on average 2.754342912495964) internal successors, (42651), 15486 states have internal predecessors, (42651), 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) [2021-06-05 07:43:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15487 states to 15487 states and 42651 transitions. [2021-06-05 07:43:44,304 INFO L78 Accepts]: Start accepts. Automaton has 15487 states and 42651 transitions. Word has length 109 [2021-06-05 07:43:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:44,304 INFO L482 AbstractCegarLoop]: Abstraction has 15487 states and 42651 transitions. [2021-06-05 07:43:44,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 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) [2021-06-05 07:43:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15487 states and 42651 transitions. [2021-06-05 07:43:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 07:43:44,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:44,310 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:44,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 07:43:44,311 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1462976531, now seen corresponding path program 2 times [2021-06-05 07:43:44,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:44,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788001170] [2021-06-05 07:43:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:45,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:45,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788001170] [2021-06-05 07:43:45,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788001170] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:45,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:45,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 07:43:45,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972121318] [2021-06-05 07:43:45,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 07:43:45,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:45,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 07:43:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-05 07:43:45,014 INFO L87 Difference]: Start difference. First operand 15487 states and 42651 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 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) [2021-06-05 07:43:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:47,253 INFO L93 Difference]: Finished difference Result 15463 states and 42602 transitions. [2021-06-05 07:43:47,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 07:43:47,253 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 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 109 [2021-06-05 07:43:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:47,270 INFO L225 Difference]: With dead ends: 15463 [2021-06-05 07:43:47,270 INFO L226 Difference]: Without dead ends: 15373 [2021-06-05 07:43:47,271 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2013.9ms TimeCoverageRelationStatistics Valid=540, Invalid=2322, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 07:43:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15373 states. [2021-06-05 07:43:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15373 to 14527. [2021-06-05 07:43:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14527 states, 14526 states have (on average 2.7556794712928543) internal successors, (40029), 14526 states have internal predecessors, (40029), 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) [2021-06-05 07:43:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14527 states to 14527 states and 40029 transitions. [2021-06-05 07:43:47,492 INFO L78 Accepts]: Start accepts. Automaton has 14527 states and 40029 transitions. Word has length 109 [2021-06-05 07:43:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:47,492 INFO L482 AbstractCegarLoop]: Abstraction has 14527 states and 40029 transitions. [2021-06-05 07:43:47,492 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 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) [2021-06-05 07:43:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 14527 states and 40029 transitions. [2021-06-05 07:43:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-06-05 07:43:47,504 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:47,504 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:47,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 07:43:47,504 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1328138375, now seen corresponding path program 1 times [2021-06-05 07:43:47,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:47,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737538735] [2021-06-05 07:43:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:47,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:47,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737538735] [2021-06-05 07:43:47,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737538735] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:47,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:47,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 07:43:47,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759083778] [2021-06-05 07:43:47,548 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 07:43:47,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 07:43:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:47,549 INFO L87 Difference]: Start difference. First operand 14527 states and 40029 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) [2021-06-05 07:43:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:47,583 INFO L93 Difference]: Finished difference Result 7076 states and 18145 transitions. [2021-06-05 07:43:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 07:43:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2021-06-05 07:43:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:47,591 INFO L225 Difference]: With dead ends: 7076 [2021-06-05 07:43:47,592 INFO L226 Difference]: Without dead ends: 7076 [2021-06-05 07:43:47,592 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 07:43:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2021-06-05 07:43:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5822. [2021-06-05 07:43:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5822 states, 5820 states have (on average 2.566838487972509) internal successors, (14939), 5821 states have internal predecessors, (14939), 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) [2021-06-05 07:43:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 14939 transitions. [2021-06-05 07:43:47,686 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 14939 transitions. Word has length 171 [2021-06-05 07:43:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:47,686 INFO L482 AbstractCegarLoop]: Abstraction has 5822 states and 14939 transitions. [2021-06-05 07:43:47,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) [2021-06-05 07:43:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 14939 transitions. [2021-06-05 07:43:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 07:43:47,695 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:47,695 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:47,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 07:43:47,695 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 307883539, now seen corresponding path program 1 times [2021-06-05 07:43:47,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:47,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244747495] [2021-06-05 07:43:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:48,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:48,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244747495] [2021-06-05 07:43:48,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244747495] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:48,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:48,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:43:48,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449981131] [2021-06-05 07:43:48,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:43:48,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:43:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:43:48,916 INFO L87 Difference]: Start difference. First operand 5822 states and 14939 transitions. Second operand has 19 states, 19 states have (on average 9.052631578947368) internal successors, (172), 19 states have internal predecessors, (172), 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) [2021-06-05 07:43:49,728 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-06-05 07:43:49,877 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2021-06-05 07:43:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:50,323 INFO L93 Difference]: Finished difference Result 5780 states and 14812 transitions. [2021-06-05 07:43:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 07:43:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.052631578947368) internal successors, (172), 19 states have internal predecessors, (172), 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 172 [2021-06-05 07:43:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:50,329 INFO L225 Difference]: With dead ends: 5780 [2021-06-05 07:43:50,329 INFO L226 Difference]: Without dead ends: 5780 [2021-06-05 07:43:50,329 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1600.2ms TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2021-06-05 07:43:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2021-06-05 07:43:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5486. [2021-06-05 07:43:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 5484 states have (on average 2.5656455142231946) internal successors, (14070), 5485 states have internal predecessors, (14070), 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) [2021-06-05 07:43:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 14070 transitions. [2021-06-05 07:43:50,404 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 14070 transitions. Word has length 172 [2021-06-05 07:43:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:50,404 INFO L482 AbstractCegarLoop]: Abstraction has 5486 states and 14070 transitions. [2021-06-05 07:43:50,404 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 9.052631578947368) internal successors, (172), 19 states have internal predecessors, (172), 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) [2021-06-05 07:43:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 14070 transitions. [2021-06-05 07:43:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 07:43:50,411 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:50,411 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:50,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 07:43:50,411 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash -399593919, now seen corresponding path program 1 times [2021-06-05 07:43:50,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:50,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290489137] [2021-06-05 07:43:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:51,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:51,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290489137] [2021-06-05 07:43:51,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290489137] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:51,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:51,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 07:43:51,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346485141] [2021-06-05 07:43:51,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 07:43:51,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:51,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 07:43:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-05 07:43:51,130 INFO L87 Difference]: Start difference. First operand 5486 states and 14070 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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) [2021-06-05 07:43:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:53,400 INFO L93 Difference]: Finished difference Result 7004 states and 17949 transitions. [2021-06-05 07:43:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 07:43:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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 176 [2021-06-05 07:43:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:53,409 INFO L225 Difference]: With dead ends: 7004 [2021-06-05 07:43:53,410 INFO L226 Difference]: Without dead ends: 7004 [2021-06-05 07:43:53,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 2143.2ms TimeCoverageRelationStatistics Valid=744, Invalid=2916, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 07:43:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2021-06-05 07:43:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6390. [2021-06-05 07:43:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6390 states, 6388 states have (on average 2.5671571696931745) internal successors, (16399), 6389 states have internal predecessors, (16399), 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) [2021-06-05 07:43:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 16399 transitions. [2021-06-05 07:43:53,582 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 16399 transitions. Word has length 176 [2021-06-05 07:43:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:53,583 INFO L482 AbstractCegarLoop]: Abstraction has 6390 states and 16399 transitions. [2021-06-05 07:43:53,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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) [2021-06-05 07:43:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 16399 transitions. [2021-06-05 07:43:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 07:43:53,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:53,591 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:53,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 07:43:53,592 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122175, now seen corresponding path program 2 times [2021-06-05 07:43:53,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:53,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248551245] [2021-06-05 07:43:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:54,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:54,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248551245] [2021-06-05 07:43:54,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248551245] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:54,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:54,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-06-05 07:43:54,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362298184] [2021-06-05 07:43:54,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-05 07:43:54,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:54,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-05 07:43:54,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 07:43:54,669 INFO L87 Difference]: Start difference. First operand 6390 states and 16399 transitions. Second operand has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 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) [2021-06-05 07:43:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:43:58,002 INFO L93 Difference]: Finished difference Result 10790 states and 27903 transitions. [2021-06-05 07:43:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 07:43:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 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 176 [2021-06-05 07:43:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:43:58,013 INFO L225 Difference]: With dead ends: 10790 [2021-06-05 07:43:58,014 INFO L226 Difference]: Without dead ends: 10790 [2021-06-05 07:43:58,015 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 3253.3ms TimeCoverageRelationStatistics Valid=1104, Invalid=4446, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 07:43:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10790 states. [2021-06-05 07:43:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10790 to 9241. [2021-06-05 07:43:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 9239 states have (on average 2.594436627340621) internal successors, (23970), 9240 states have internal predecessors, (23970), 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) [2021-06-05 07:43:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 23970 transitions. [2021-06-05 07:43:58,153 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 23970 transitions. Word has length 176 [2021-06-05 07:43:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:43:58,153 INFO L482 AbstractCegarLoop]: Abstraction has 9241 states and 23970 transitions. [2021-06-05 07:43:58,153 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 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) [2021-06-05 07:43:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 23970 transitions. [2021-06-05 07:43:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 07:43:58,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:43:58,164 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:43:58,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 07:43:58,164 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:43:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:43:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash -788395354, now seen corresponding path program 1 times [2021-06-05 07:43:58,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:43:58,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106917101] [2021-06-05 07:43:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:43:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:43:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:43:58,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:43:58,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106917101] [2021-06-05 07:43:58,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106917101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:43:58,836 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:43:58,836 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 07:43:58,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743956701] [2021-06-05 07:43:58,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 07:43:58,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:43:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 07:43:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:43:58,837 INFO L87 Difference]: Start difference. First operand 9241 states and 23970 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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) [2021-06-05 07:44:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:00,560 INFO L93 Difference]: Finished difference Result 8320 states and 21398 transitions. [2021-06-05 07:44:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 07:44:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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 180 [2021-06-05 07:44:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:00,569 INFO L225 Difference]: With dead ends: 8320 [2021-06-05 07:44:00,569 INFO L226 Difference]: Without dead ends: 8320 [2021-06-05 07:44:00,570 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1622.9ms TimeCoverageRelationStatistics Valid=611, Invalid=2145, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:44:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2021-06-05 07:44:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 8026. [2021-06-05 07:44:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8026 states, 8024 states have (on average 2.5742771684945165) internal successors, (20656), 8025 states have internal predecessors, (20656), 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) [2021-06-05 07:44:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8026 states to 8026 states and 20656 transitions. [2021-06-05 07:44:00,673 INFO L78 Accepts]: Start accepts. Automaton has 8026 states and 20656 transitions. Word has length 180 [2021-06-05 07:44:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:00,673 INFO L482 AbstractCegarLoop]: Abstraction has 8026 states and 20656 transitions. [2021-06-05 07:44:00,673 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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) [2021-06-05 07:44:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8026 states and 20656 transitions. [2021-06-05 07:44:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:44:00,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:00,680 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:00,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 07:44:00,680 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash -858234869, now seen corresponding path program 1 times [2021-06-05 07:44:00,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:00,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185844282] [2021-06-05 07:44:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:01,429 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:44:03,054 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 07:44:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:05,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:05,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185844282] [2021-06-05 07:44:05,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185844282] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:05,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:05,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:44:05,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981137693] [2021-06-05 07:44:05,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:44:05,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:05,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:44:05,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:44:05,952 INFO L87 Difference]: Start difference. First operand 8026 states and 20656 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:44:10,122 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 07:44:11,041 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 07:44:12,238 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 07:44:16,978 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:44:17,419 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:44:17,971 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:44:21,963 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:44:27,242 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:44:31,382 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:44:33,027 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 07:44:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:36,049 INFO L93 Difference]: Finished difference Result 11919 states and 30719 transitions. [2021-06-05 07:44:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 07:44:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:44:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:36,062 INFO L225 Difference]: With dead ends: 11919 [2021-06-05 07:44:36,062 INFO L226 Difference]: Without dead ends: 11499 [2021-06-05 07:44:36,066 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 17319.5ms TimeCoverageRelationStatistics Valid=1515, Invalid=14741, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 07:44:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11499 states. [2021-06-05 07:44:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11499 to 9438. [2021-06-05 07:44:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 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) [2021-06-05 07:44:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:44:36,206 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:44:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:36,206 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:44:36,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:44:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:44:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:44:36,215 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:36,215 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:36,215 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 07:44:36,215 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1302633973, now seen corresponding path program 2 times [2021-06-05 07:44:36,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:36,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518841351] [2021-06-05 07:44:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:37,049 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:44:37,199 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:44:38,549 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:44:38,737 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 07:44:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:41,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:41,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518841351] [2021-06-05 07:44:41,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518841351] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:41,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:41,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:44:41,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505796993] [2021-06-05 07:44:41,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:44:41,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:44:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:44:41,486 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:44:45,785 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 07:44:46,476 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 07:44:47,905 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2021-06-05 07:44:50,094 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:44:50,407 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:44:50,796 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:44:53,284 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:45:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:01,681 INFO L93 Difference]: Finished difference Result 13443 states and 34525 transitions. [2021-06-05 07:45:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:45:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:45:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:01,697 INFO L225 Difference]: With dead ends: 13443 [2021-06-05 07:45:01,697 INFO L226 Difference]: Without dead ends: 13023 [2021-06-05 07:45:01,700 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 15434.7ms TimeCoverageRelationStatistics Valid=1533, Invalid=14979, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:45:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2021-06-05 07:45:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 9438. [2021-06-05 07:45:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 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) [2021-06-05 07:45:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:45:01,823 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:45:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:01,824 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:45:01,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:45:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:45:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:45:01,832 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:01,832 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:01,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 07:45:01,832 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash 868546213, now seen corresponding path program 3 times [2021-06-05 07:45:01,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:01,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962188429] [2021-06-05 07:45:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:02,600 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:45:02,937 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:45:03,667 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:45:04,124 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:45:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:07,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:07,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962188429] [2021-06-05 07:45:07,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962188429] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:07,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:07,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:45:07,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977822923] [2021-06-05 07:45:07,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:45:07,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:07,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:45:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:45:07,678 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:45:12,306 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 07:45:13,106 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 07:45:14,845 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2021-06-05 07:45:18,221 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:45:18,685 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:45:19,273 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:45:23,156 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:45:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:35,941 INFO L93 Difference]: Finished difference Result 13507 states and 34685 transitions. [2021-06-05 07:45:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 07:45:35,942 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:45:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:35,958 INFO L225 Difference]: With dead ends: 13507 [2021-06-05 07:45:35,958 INFO L226 Difference]: Without dead ends: 13087 [2021-06-05 07:45:35,960 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4628 ImplicationChecksByTransitivity, 17752.6ms TimeCoverageRelationStatistics Valid=1576, Invalid=15454, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 07:45:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-05 07:45:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9438. [2021-06-05 07:45:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 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) [2021-06-05 07:45:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:45:36,092 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:45:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:36,092 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:45:36,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:45:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:45:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:45:36,100 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:36,100 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:36,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 07:45:36,101 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1647526667, now seen corresponding path program 4 times [2021-06-05 07:45:36,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:36,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103849003] [2021-06-05 07:45:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:36,901 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:45:37,353 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:45:38,257 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:45:38,662 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:45:39,102 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:45:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:42,846 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:42,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103849003] [2021-06-05 07:45:42,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103849003] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:42,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:42,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:45:42,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236430502] [2021-06-05 07:45:42,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:45:42,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:45:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:45:42,848 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:45:47,607 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 07:45:48,276 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 07:45:49,740 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-06-05 07:45:52,530 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:45:52,897 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:45:53,378 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:45:56,713 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:46:00,720 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 07:46:01,457 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 07:46:02,204 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 07:46:05,352 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-05 07:46:05,846 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 07:46:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:10,301 INFO L93 Difference]: Finished difference Result 13491 states and 34649 transitions. [2021-06-05 07:46:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 07:46:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:46:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:10,316 INFO L225 Difference]: With dead ends: 13491 [2021-06-05 07:46:10,316 INFO L226 Difference]: Without dead ends: 13071 [2021-06-05 07:46:10,319 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4701 ImplicationChecksByTransitivity, 18474.5ms TimeCoverageRelationStatistics Valid=1603, Invalid=15689, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 07:46:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13071 states. [2021-06-05 07:46:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13071 to 9438. [2021-06-05 07:46:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 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) [2021-06-05 07:46:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:46:10,441 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:46:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:10,441 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:46:10,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:46:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:46:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:46:10,449 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:10,449 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:10,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 07:46:10,450 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash -276826587, now seen corresponding path program 5 times [2021-06-05 07:46:10,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:10,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682053293] [2021-06-05 07:46:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:11,230 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:46:11,622 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:46:12,492 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:46:12,888 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:46:13,289 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:46:13,724 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:46:14,033 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 07:46:14,836 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:46:15,843 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:46:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:19,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:19,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682053293] [2021-06-05 07:46:19,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682053293] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:19,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:19,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:46:19,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456144489] [2021-06-05 07:46:19,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:46:19,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:46:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:46:19,988 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:46:22,702 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2021-06-05 07:46:23,118 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-06-05 07:46:24,587 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:46:25,696 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 07:46:26,270 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:46:26,969 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 07:46:27,751 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2021-06-05 07:46:31,079 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:46:31,412 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:46:31,820 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:46:34,528 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:46:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:44,172 INFO L93 Difference]: Finished difference Result 13595 states and 34905 transitions. [2021-06-05 07:46:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-05 07:46:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:46:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:44,188 INFO L225 Difference]: With dead ends: 13595 [2021-06-05 07:46:44,188 INFO L226 Difference]: Without dead ends: 13175 [2021-06-05 07:46:44,190 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5131 ImplicationChecksByTransitivity, 22039.5ms TimeCoverageRelationStatistics Valid=1719, Invalid=16913, Unknown=0, NotChecked=0, Total=18632 [2021-06-05 07:46:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2021-06-05 07:46:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 9438. [2021-06-05 07:46:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 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) [2021-06-05 07:46:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-05 07:46:44,321 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-05 07:46:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:44,321 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-05 07:46:44,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:46:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-05 07:46:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:46:44,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:44,330 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:44,330 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 07:46:44,330 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:44,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -410727541, now seen corresponding path program 6 times [2021-06-05 07:46:44,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:44,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488772738] [2021-06-05 07:46:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:44,986 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:46:45,299 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:46:46,025 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:46:46,382 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:46:46,752 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:46:47,406 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 07:46:49,097 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:46:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:55,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:55,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488772738] [2021-06-05 07:46:55,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488772738] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:55,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:55,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:46:55,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653429529] [2021-06-05 07:46:55,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:46:55,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:46:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:46:55,647 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:46:59,181 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:46:59,613 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:47:01,262 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:47:01,874 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-06-05 07:47:02,462 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-06-05 07:47:04,826 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:47:05,092 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:47:05,408 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:47:07,338 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:47:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:14,517 INFO L93 Difference]: Finished difference Result 13507 states and 34707 transitions. [2021-06-05 07:47:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-05 07:47:14,518 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:47:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:14,532 INFO L225 Difference]: With dead ends: 13507 [2021-06-05 07:47:14,532 INFO L226 Difference]: Without dead ends: 13087 [2021-06-05 07:47:14,534 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 21562.4ms TimeCoverageRelationStatistics Valid=1641, Invalid=16181, Unknown=0, NotChecked=0, Total=17822 [2021-06-05 07:47:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-05 07:47:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9516. [2021-06-05 07:47:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9516 states, 9514 states have (on average 2.5570737859995796) internal successors, (24328), 9515 states have internal predecessors, (24328), 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) [2021-06-05 07:47:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24328 transitions. [2021-06-05 07:47:14,658 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24328 transitions. Word has length 184 [2021-06-05 07:47:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:14,658 INFO L482 AbstractCegarLoop]: Abstraction has 9516 states and 24328 transitions. [2021-06-05 07:47:14,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:47:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24328 transitions. [2021-06-05 07:47:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:47:14,666 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:14,666 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:47:14,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 07:47:14,666 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2715019, now seen corresponding path program 7 times [2021-06-05 07:47:14,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:14,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804758858] [2021-06-05 07:47:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:15,271 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:47:15,568 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:47:18,253 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:47:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:23,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:23,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804758858] [2021-06-05 07:47:23,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804758858] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:23,380 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:23,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:47:23,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667500799] [2021-06-05 07:47:23,381 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:47:23,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:47:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:47:23,382 INFO L87 Difference]: Start difference. First operand 9516 states and 24328 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:47:29,879 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 07:47:30,952 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:47:32,023 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:47:35,151 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:47:36,114 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:47:37,704 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-06-05 07:47:39,218 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-06-05 07:47:42,249 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2021-06-05 07:47:43,198 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:47:43,419 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:47:43,676 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:47:45,084 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:47:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:47:50,480 INFO L93 Difference]: Finished difference Result 13477 states and 34651 transitions. [2021-06-05 07:47:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-05 07:47:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:47:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:47:50,495 INFO L225 Difference]: With dead ends: 13477 [2021-06-05 07:47:50,495 INFO L226 Difference]: Without dead ends: 13057 [2021-06-05 07:47:50,496 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5080 ImplicationChecksByTransitivity, 25998.7ms TimeCoverageRelationStatistics Valid=1673, Invalid=16959, Unknown=0, NotChecked=0, Total=18632 [2021-06-05 07:47:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2021-06-05 07:47:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 9529. [2021-06-05 07:47:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9529 states, 9527 states have (on average 2.557258318463315) internal successors, (24363), 9528 states have internal predecessors, (24363), 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) [2021-06-05 07:47:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9529 states to 9529 states and 24363 transitions. [2021-06-05 07:47:50,622 INFO L78 Accepts]: Start accepts. Automaton has 9529 states and 24363 transitions. Word has length 184 [2021-06-05 07:47:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:47:50,623 INFO L482 AbstractCegarLoop]: Abstraction has 9529 states and 24363 transitions. [2021-06-05 07:47:50,623 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:47:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9529 states and 24363 transitions. [2021-06-05 07:47:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:47:50,630 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:47:50,630 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:47:50,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 07:47:50,630 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:47:50,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:47:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1807828059, now seen corresponding path program 8 times [2021-06-05 07:47:50,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:47:50,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233940572] [2021-06-05 07:47:50,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:47:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:47:51,176 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:47:51,356 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:47:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:47:56,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:47:56,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233940572] [2021-06-05 07:47:56,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233940572] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:47:56,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:47:56,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:47:56,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512168166] [2021-06-05 07:47:56,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:47:56,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:47:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:47:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:47:56,449 INFO L87 Difference]: Start difference. First operand 9529 states and 24363 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:48:01,362 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:48:02,105 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:48:04,207 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:48:04,908 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:48:06,179 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-06-05 07:48:07,417 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-06-05 07:48:13,635 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:48:14,108 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:48:14,723 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:48:19,032 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:48:23,152 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-06-05 07:48:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:48:27,307 INFO L93 Difference]: Finished difference Result 13453 states and 34597 transitions. [2021-06-05 07:48:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-05 07:48:27,307 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:48:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:48:27,322 INFO L225 Difference]: With dead ends: 13453 [2021-06-05 07:48:27,322 INFO L226 Difference]: Without dead ends: 13033 [2021-06-05 07:48:27,323 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5275 ImplicationChecksByTransitivity, 20299.6ms TimeCoverageRelationStatistics Valid=1696, Invalid=17486, Unknown=0, NotChecked=0, Total=19182 [2021-06-05 07:48:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13033 states. [2021-06-05 07:48:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13033 to 9542. [2021-06-05 07:48:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9542 states, 9540 states have (on average 2.5574423480083857) internal successors, (24398), 9541 states have internal predecessors, (24398), 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) [2021-06-05 07:48:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 24398 transitions. [2021-06-05 07:48:27,448 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 24398 transitions. Word has length 184 [2021-06-05 07:48:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:48:27,449 INFO L482 AbstractCegarLoop]: Abstraction has 9542 states and 24398 transitions. [2021-06-05 07:48:27,449 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:48:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 24398 transitions. [2021-06-05 07:48:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:48:27,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:48:27,456 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:48:27,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 07:48:27,457 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:48:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:48:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash -92526133, now seen corresponding path program 9 times [2021-06-05 07:48:27,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:48:27,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778624400] [2021-06-05 07:48:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:48:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:48:27,989 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:48:28,156 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:48:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:48:33,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:48:33,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778624400] [2021-06-05 07:48:33,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778624400] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:48:33,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:48:33,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:48:33,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720323724] [2021-06-05 07:48:33,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:48:33,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:48:33,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:48:33,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:48:33,119 INFO L87 Difference]: Start difference. First operand 9542 states and 24398 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:48:38,219 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:48:38,923 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:48:40,958 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 07:48:41,620 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 07:48:42,821 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-06-05 07:48:43,980 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-06-05 07:48:50,262 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:48:50,720 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:48:51,326 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:48:55,304 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:49:02,426 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 07:49:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:04,543 INFO L93 Difference]: Finished difference Result 14681 states and 37799 transitions. [2021-06-05 07:49:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-05 07:49:04,544 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:49:04,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:04,557 INFO L225 Difference]: With dead ends: 14681 [2021-06-05 07:49:04,558 INFO L226 Difference]: Without dead ends: 14261 [2021-06-05 07:49:04,559 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5277 ImplicationChecksByTransitivity, 20781.8ms TimeCoverageRelationStatistics Valid=1783, Invalid=17399, Unknown=0, NotChecked=0, Total=19182 [2021-06-05 07:49:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2021-06-05 07:49:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 9646. [2021-06-05 07:49:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9646 states, 9644 states have (on average 2.5588967233513067) internal successors, (24678), 9645 states have internal predecessors, (24678), 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) [2021-06-05 07:49:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 24678 transitions. [2021-06-05 07:49:04,675 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 24678 transitions. Word has length 184 [2021-06-05 07:49:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:04,676 INFO L482 AbstractCegarLoop]: Abstraction has 9646 states and 24678 transitions. [2021-06-05 07:49:04,676 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:49:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 24678 transitions. [2021-06-05 07:49:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:49:04,683 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:04,683 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:49:04,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 07:49:04,683 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 787291659, now seen corresponding path program 10 times [2021-06-05 07:49:04,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:04,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902057904] [2021-06-05 07:49:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:05,180 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:49:05,343 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:49:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:09,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:09,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902057904] [2021-06-05 07:49:09,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902057904] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:09,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:09,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:49:09,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569771558] [2021-06-05 07:49:09,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:49:09,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:49:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:49:09,772 INFO L87 Difference]: Start difference. First operand 9646 states and 24678 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:49:14,299 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:49:14,980 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:49:17,635 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2021-06-05 07:49:18,614 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2021-06-05 07:49:19,494 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 73 [2021-06-05 07:49:24,918 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:49:25,363 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:49:25,842 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:49:29,852 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:49:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:49:45,230 INFO L93 Difference]: Finished difference Result 14609 states and 37563 transitions. [2021-06-05 07:49:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-05 07:49:45,230 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:49:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:49:45,246 INFO L225 Difference]: With dead ends: 14609 [2021-06-05 07:49:45,246 INFO L226 Difference]: Without dead ends: 14189 [2021-06-05 07:49:45,248 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 19742.1ms TimeCoverageRelationStatistics Valid=1892, Invalid=17290, Unknown=0, NotChecked=0, Total=19182 [2021-06-05 07:49:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2021-06-05 07:49:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 9659. [2021-06-05 07:49:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9659 states, 9657 states have (on average 2.5590763176970075) internal successors, (24713), 9658 states have internal predecessors, (24713), 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) [2021-06-05 07:49:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 24713 transitions. [2021-06-05 07:49:45,380 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 24713 transitions. Word has length 184 [2021-06-05 07:49:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:49:45,381 INFO L482 AbstractCegarLoop]: Abstraction has 9659 states and 24713 transitions. [2021-06-05 07:49:45,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:49:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 24713 transitions. [2021-06-05 07:49:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:49:45,388 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:49:45,388 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:49:45,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 07:49:45,388 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:49:45,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:49:45,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1611136987, now seen corresponding path program 11 times [2021-06-05 07:49:45,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:49:45,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188645090] [2021-06-05 07:49:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:49:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:49:46,312 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:49:46,437 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:49:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:49:50,285 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:49:50,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188645090] [2021-06-05 07:49:50,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188645090] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:49:50,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:49:50,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:49:50,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463240774] [2021-06-05 07:49:50,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:49:50,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:49:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:49:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:49:50,287 INFO L87 Difference]: Start difference. First operand 9659 states and 24713 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:49:53,454 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:49:53,977 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:49:57,568 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:49:57,894 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:49:58,259 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:50:00,831 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:50:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:50:10,741 INFO L93 Difference]: Finished difference Result 14313 states and 36777 transitions. [2021-06-05 07:50:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:50:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:50:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:50:10,756 INFO L225 Difference]: With dead ends: 14313 [2021-06-05 07:50:10,756 INFO L226 Difference]: Without dead ends: 13893 [2021-06-05 07:50:10,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4490 ImplicationChecksByTransitivity, 14668.2ms TimeCoverageRelationStatistics Valid=1572, Invalid=14940, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:50:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2021-06-05 07:50:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 9698. [2021-06-05 07:50:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9698 states, 9696 states have (on average 2.559612211221122) internal successors, (24818), 9697 states have internal predecessors, (24818), 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) [2021-06-05 07:50:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 24818 transitions. [2021-06-05 07:50:10,880 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 24818 transitions. Word has length 184 [2021-06-05 07:50:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:50:10,880 INFO L482 AbstractCegarLoop]: Abstraction has 9698 states and 24818 transitions. [2021-06-05 07:50:10,880 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:50:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 24818 transitions. [2021-06-05 07:50:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:50:10,887 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:50:10,887 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:50:10,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 07:50:10,887 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:50:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:50:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 481639115, now seen corresponding path program 12 times [2021-06-05 07:50:10,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:50:10,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468900413] [2021-06-05 07:50:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:50:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:50:11,521 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:50:11,847 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:50:12,559 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:50:12,900 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:50:13,252 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:50:13,899 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 07:50:15,589 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:50:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:50:22,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:50:22,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468900413] [2021-06-05 07:50:22,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468900413] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:50:22,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:50:22,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:50:22,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567726177] [2021-06-05 07:50:22,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:50:22,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:50:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:50:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:50:22,051 INFO L87 Difference]: Start difference. First operand 9698 states and 24818 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:50:27,776 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2021-06-05 07:50:28,505 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:50:28,817 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:50:31,446 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:50:31,679 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:50:31,954 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:50:33,676 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:50:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:50:39,368 INFO L93 Difference]: Finished difference Result 14281 states and 36705 transitions. [2021-06-05 07:50:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:50:39,368 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:50:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:50:39,384 INFO L225 Difference]: With dead ends: 14281 [2021-06-05 07:50:39,384 INFO L226 Difference]: Without dead ends: 13861 [2021-06-05 07:50:39,386 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 21698.6ms TimeCoverageRelationStatistics Valid=1572, Invalid=14940, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:50:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13861 states. [2021-06-05 07:50:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13861 to 9711. [2021-06-05 07:50:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9711 states, 9709 states have (on average 2.5597898856730867) internal successors, (24853), 9710 states have internal predecessors, (24853), 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) [2021-06-05 07:50:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 24853 transitions. [2021-06-05 07:50:39,512 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 24853 transitions. Word has length 184 [2021-06-05 07:50:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:50:39,513 INFO L482 AbstractCegarLoop]: Abstraction has 9711 states and 24853 transitions. [2021-06-05 07:50:39,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:50:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 24853 transitions. [2021-06-05 07:50:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:50:39,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:50:39,523 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:50:39,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 07:50:39,523 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:50:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:50:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash 317652773, now seen corresponding path program 13 times [2021-06-05 07:50:39,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:50:39,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53026361] [2021-06-05 07:50:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:50:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:50:40,060 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:50:40,222 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:50:41,940 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:50:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:50:45,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:50:45,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53026361] [2021-06-05 07:50:45,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53026361] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:50:45,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:50:45,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:50:45,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973239756] [2021-06-05 07:50:45,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:50:45,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:50:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:50:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:50:45,880 INFO L87 Difference]: Start difference. First operand 9711 states and 24853 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:50:50,804 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:50:51,531 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:50:54,800 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:50:55,724 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 07:50:56,079 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:50:56,395 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:50:59,066 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:51:02,407 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 07:51:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:51:05,936 INFO L93 Difference]: Finished difference Result 13833 states and 35557 transitions. [2021-06-05 07:51:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 07:51:05,936 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:51:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:51:05,950 INFO L225 Difference]: With dead ends: 13833 [2021-06-05 07:51:05,950 INFO L226 Difference]: Without dead ends: 13413 [2021-06-05 07:51:05,951 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4407 ImplicationChecksByTransitivity, 17259.2ms TimeCoverageRelationStatistics Valid=1542, Invalid=14714, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 07:51:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2021-06-05 07:51:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 9724. [2021-06-05 07:51:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9724 states, 9722 states have (on average 2.559967084961942) internal successors, (24888), 9723 states have internal predecessors, (24888), 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) [2021-06-05 07:51:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 24888 transitions. [2021-06-05 07:51:06,070 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 24888 transitions. Word has length 184 [2021-06-05 07:51:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:51:06,070 INFO L482 AbstractCegarLoop]: Abstraction has 9724 states and 24888 transitions. [2021-06-05 07:51:06,070 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:51:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 24888 transitions. [2021-06-05 07:51:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:51:06,078 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:51:06,078 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:51:06,078 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 07:51:06,078 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:51:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:51:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 421691335, now seen corresponding path program 14 times [2021-06-05 07:51:06,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:51:06,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756547524] [2021-06-05 07:51:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:51:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:51:06,562 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:51:06,693 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:51:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:51:10,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:51:10,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756547524] [2021-06-05 07:51:10,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756547524] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:51:10,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:51:10,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:51:10,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044239933] [2021-06-05 07:51:10,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:51:10,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:51:10,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:51:10,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:51:10,922 INFO L87 Difference]: Start difference. First operand 9724 states and 24888 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:51:14,341 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:51:14,946 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:51:17,914 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:51:18,225 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:51:18,568 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 07:51:19,772 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:51:22,148 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:51:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:51:31,103 INFO L93 Difference]: Finished difference Result 13801 states and 35485 transitions. [2021-06-05 07:51:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 07:51:31,103 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:51:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:51:31,118 INFO L225 Difference]: With dead ends: 13801 [2021-06-05 07:51:31,118 INFO L226 Difference]: Without dead ends: 13381 [2021-06-05 07:51:31,120 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4469 ImplicationChecksByTransitivity, 15239.5ms TimeCoverageRelationStatistics Valid=1573, Invalid=14939, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 07:51:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2021-06-05 07:51:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 9854. [2021-06-05 07:51:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9854 states, 9852 states have (on average 2.5617133576938693) internal successors, (25238), 9853 states have internal predecessors, (25238), 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) [2021-06-05 07:51:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 25238 transitions. [2021-06-05 07:51:31,259 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 25238 transitions. Word has length 184 [2021-06-05 07:51:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:51:31,259 INFO L482 AbstractCegarLoop]: Abstraction has 9854 states and 25238 transitions. [2021-06-05 07:51:31,260 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:51:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 25238 transitions. [2021-06-05 07:51:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:51:31,268 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:51:31,268 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:51:31,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 07:51:31,269 INFO L430 AbstractCegarLoop]: === Iteration 31 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:51:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:51:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1697699831, now seen corresponding path program 15 times [2021-06-05 07:51:31,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:51:31,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604518128] [2021-06-05 07:51:31,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:51:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:51:31,882 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:51:32,198 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:51:32,932 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:51:33,278 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:51:33,633 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:51:34,013 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 07:51:34,304 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 07:51:35,984 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:51:36,417 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-06-05 07:51:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:51:38,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:51:38,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604518128] [2021-06-05 07:51:38,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604518128] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:51:38,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:51:38,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:51:38,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060747962] [2021-06-05 07:51:38,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:51:38,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:51:38,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:51:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:51:38,570 INFO L87 Difference]: Start difference. First operand 9854 states and 25238 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:51:41,128 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:51:41,614 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:51:43,958 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:51:44,226 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:51:44,497 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 07:51:45,405 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:51:47,632 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:51:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:51:54,804 INFO L93 Difference]: Finished difference Result 15755 states and 40499 transitions. [2021-06-05 07:51:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 07:51:54,804 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:51:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:51:54,822 INFO L225 Difference]: With dead ends: 15755 [2021-06-05 07:51:54,822 INFO L226 Difference]: Without dead ends: 15335 [2021-06-05 07:51:54,824 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4644 ImplicationChecksByTransitivity, 16246.6ms TimeCoverageRelationStatistics Valid=1606, Invalid=15424, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 07:51:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15335 states. [2021-06-05 07:51:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15335 to 9958. [2021-06-05 07:51:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9958 states, 9956 states have (on average 2.564383286460426) internal successors, (25531), 9957 states have internal predecessors, (25531), 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) [2021-06-05 07:51:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 25531 transitions. [2021-06-05 07:51:54,968 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 25531 transitions. Word has length 184 [2021-06-05 07:51:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:51:54,968 INFO L482 AbstractCegarLoop]: Abstraction has 9958 states and 25531 transitions. [2021-06-05 07:51:54,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:51:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 25531 transitions. [2021-06-05 07:51:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:51:54,976 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:51:54,976 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:51:54,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 07:51:54,976 INFO L430 AbstractCegarLoop]: === Iteration 32 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:51:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:51:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2078488249, now seen corresponding path program 16 times [2021-06-05 07:51:54,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:51:54,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016295386] [2021-06-05 07:51:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:51:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:51:55,566 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:51:55,819 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:51:58,806 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:52:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:52:04,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:52:04,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016295386] [2021-06-05 07:52:04,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016295386] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:52:04,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:52:04,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:52:04,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415597797] [2021-06-05 07:52:04,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:52:04,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:52:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:52:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:52:04,198 INFO L87 Difference]: Start difference. First operand 9958 states and 25531 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:52:10,943 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 07:52:11,949 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:52:12,889 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:52:17,236 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:52:17,487 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:52:17,741 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 07:52:18,624 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:52:21,169 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:52:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:52:28,422 INFO L93 Difference]: Finished difference Result 15667 states and 40285 transitions. [2021-06-05 07:52:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 07:52:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:52:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:52:28,440 INFO L225 Difference]: With dead ends: 15667 [2021-06-05 07:52:28,440 INFO L226 Difference]: Without dead ends: 15247 [2021-06-05 07:52:28,442 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4725 ImplicationChecksByTransitivity, 21903.1ms TimeCoverageRelationStatistics Valid=1618, Invalid=15674, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 07:52:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15247 states. [2021-06-05 07:52:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15247 to 9997. [2021-06-05 07:52:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 9995 states have (on average 2.56488244122061) internal successors, (25636), 9996 states have internal predecessors, (25636), 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) [2021-06-05 07:52:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 25636 transitions. [2021-06-05 07:52:28,586 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 25636 transitions. Word has length 184 [2021-06-05 07:52:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:52:28,587 INFO L482 AbstractCegarLoop]: Abstraction has 9997 states and 25636 transitions. [2021-06-05 07:52:28,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:52:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 25636 transitions. [2021-06-05 07:52:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:52:28,595 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:52:28,595 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:52:28,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 07:52:28,595 INFO L430 AbstractCegarLoop]: === Iteration 33 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:52:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:52:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1942160421, now seen corresponding path program 17 times [2021-06-05 07:52:28,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:52:28,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245646279] [2021-06-05 07:52:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:52:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:52:29,108 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:52:29,308 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:52:31,718 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:52:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:52:36,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:52:36,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245646279] [2021-06-05 07:52:36,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245646279] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:52:36,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:52:36,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:52:36,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229218849] [2021-06-05 07:52:36,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:52:36,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:52:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:52:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:52:36,432 INFO L87 Difference]: Start difference. First operand 9997 states and 25636 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:52:42,206 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-06-05 07:52:43,105 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:52:43,932 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:52:48,388 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:52:48,840 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:52:49,367 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 07:52:51,533 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:52:58,325 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:53:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:53:07,052 INFO L93 Difference]: Finished difference Result 15627 states and 40195 transitions. [2021-06-05 07:53:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 07:53:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:53:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:53:07,072 INFO L225 Difference]: With dead ends: 15627 [2021-06-05 07:53:07,073 INFO L226 Difference]: Without dead ends: 15207 [2021-06-05 07:53:07,074 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4811 ImplicationChecksByTransitivity, 20742.0ms TimeCoverageRelationStatistics Valid=1633, Invalid=15923, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 07:53:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2021-06-05 07:53:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 10023. [2021-06-05 07:53:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10023 states, 10021 states have (on average 2.565213052589562) internal successors, (25706), 10022 states have internal predecessors, (25706), 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) [2021-06-05 07:53:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 25706 transitions. [2021-06-05 07:53:07,216 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 25706 transitions. Word has length 184 [2021-06-05 07:53:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:53:07,216 INFO L482 AbstractCegarLoop]: Abstraction has 10023 states and 25706 transitions. [2021-06-05 07:53:07,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:53:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 25706 transitions. [2021-06-05 07:53:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:53:07,225 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:53:07,225 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:53:07,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 07:53:07,225 INFO L430 AbstractCegarLoop]: === Iteration 34 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:53:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:53:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 956827493, now seen corresponding path program 18 times [2021-06-05 07:53:07,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:53:07,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110329165] [2021-06-05 07:53:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:53:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:53:07,719 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:53:07,916 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:53:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:53:12,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:53:12,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110329165] [2021-06-05 07:53:12,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110329165] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:53:12,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:53:12,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:53:12,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285417532] [2021-06-05 07:53:12,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:53:12,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:53:12,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:53:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:53:12,718 INFO L87 Difference]: Start difference. First operand 10023 states and 25706 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:53:16,756 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2021-06-05 07:53:17,398 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-06-05 07:53:20,526 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-06-05 07:53:29,813 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 07:53:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:53:36,464 INFO L93 Difference]: Finished difference Result 15649 states and 40255 transitions. [2021-06-05 07:53:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 07:53:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:53:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:53:36,482 INFO L225 Difference]: With dead ends: 15649 [2021-06-05 07:53:36,483 INFO L226 Difference]: Without dead ends: 15229 [2021-06-05 07:53:36,484 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 17472.9ms TimeCoverageRelationStatistics Valid=1663, Invalid=16697, Unknown=0, NotChecked=0, Total=18360 [2021-06-05 07:53:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15229 states. [2021-06-05 07:53:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15229 to 10036. [2021-06-05 07:53:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10036 states, 10034 states have (on average 2.5653777157663944) internal successors, (25741), 10035 states have internal predecessors, (25741), 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) [2021-06-05 07:53:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 25741 transitions. [2021-06-05 07:53:36,626 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 25741 transitions. Word has length 184 [2021-06-05 07:53:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:53:36,626 INFO L482 AbstractCegarLoop]: Abstraction has 10036 states and 25741 transitions. [2021-06-05 07:53:36,626 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:53:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 25741 transitions. [2021-06-05 07:53:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:53:36,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:53:36,634 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:53:36,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 07:53:36,634 INFO L430 AbstractCegarLoop]: === Iteration 35 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:53:36,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:53:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 913127371, now seen corresponding path program 19 times [2021-06-05 07:53:36,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:53:36,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629956475] [2021-06-05 07:53:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:53:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:53:37,016 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-06-05 07:53:37,255 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:53:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:53:41,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:53:41,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629956475] [2021-06-05 07:53:41,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629956475] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:53:41,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:53:41,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:53:41,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817178728] [2021-06-05 07:53:41,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:53:41,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:53:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:53:41,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:53:41,057 INFO L87 Difference]: Start difference. First operand 10036 states and 25741 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:53:44,069 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:53:44,584 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:53:47,573 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:53:47,902 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:53:48,281 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 07:53:49,688 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:53:52,053 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2021-06-05 07:53:54,451 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:54:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:54:04,137 INFO L93 Difference]: Finished difference Result 16779 states and 43195 transitions. [2021-06-05 07:54:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 07:54:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:54:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:54:04,156 INFO L225 Difference]: With dead ends: 16779 [2021-06-05 07:54:04,156 INFO L226 Difference]: Without dead ends: 16359 [2021-06-05 07:54:04,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5070 ImplicationChecksByTransitivity, 15383.6ms TimeCoverageRelationStatistics Valid=1691, Invalid=16669, Unknown=0, NotChecked=0, Total=18360 [2021-06-05 07:54:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2021-06-05 07:54:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 10348. [2021-06-05 07:54:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10346 states have (on average 2.5692054900444616) internal successors, (26581), 10347 states have internal predecessors, (26581), 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) [2021-06-05 07:54:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-05 07:54:04,299 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-05 07:54:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:54:04,299 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-05 07:54:04,299 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:54:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-05 07:54:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:54:04,307 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:54:04,307 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:54:04,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 07:54:04,307 INFO L430 AbstractCegarLoop]: === Iteration 36 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:54:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:54:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1490581689, now seen corresponding path program 20 times [2021-06-05 07:54:04,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:54:04,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477886954] [2021-06-05 07:54:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:54:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:54:04,897 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 07:54:05,210 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 07:54:05,966 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 07:54:06,315 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 07:54:06,695 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 07:54:07,378 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-05 07:54:08,967 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 07:54:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:54:15,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:54:15,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477886954] [2021-06-05 07:54:15,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477886954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:54:15,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:54:15,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 07:54:15,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716124227] [2021-06-05 07:54:15,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 07:54:15,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:54:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 07:54:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 07:54:15,566 INFO L87 Difference]: Start difference. First operand 10348 states and 26581 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:54:21,590 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 07:54:21,916 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-06-05 07:54:24,084 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 07:54:24,355 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 07:54:25,088 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 07:54:25,358 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 07:54:26,464 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 07:54:27,477 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 07:54:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:54:34,378 INFO L93 Difference]: Finished difference Result 14763 states and 38063 transitions. [2021-06-05 07:54:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 07:54:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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 184 [2021-06-05 07:54:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:54:34,396 INFO L225 Difference]: With dead ends: 14763 [2021-06-05 07:54:34,396 INFO L226 Difference]: Without dead ends: 14343 [2021-06-05 07:54:34,397 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4575 ImplicationChecksByTransitivity, 21797.9ms TimeCoverageRelationStatistics Valid=1594, Invalid=15176, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 07:54:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2021-06-05 07:54:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 10348. [2021-06-05 07:54:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10346 states have (on average 2.5692054900444616) internal successors, (26581), 10347 states have internal predecessors, (26581), 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) [2021-06-05 07:54:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-05 07:54:34,540 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-05 07:54:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:54:34,540 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-05 07:54:34,540 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 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) [2021-06-05 07:54:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-05 07:54:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 07:54:34,550 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:54:34,550 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:54:34,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 07:54:34,550 INFO L430 AbstractCegarLoop]: === Iteration 37 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:54:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:54:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash 473197579, now seen corresponding path program 21 times [2021-06-05 07:54:34,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:54:34,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952674167] [2021-06-05 07:54:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:54:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2021-06-05 07:56:27,946 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,951 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,952 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,953 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,954 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,955 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,956 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,957 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,958 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,959 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,960 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,961 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,961 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,962 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,963 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,964 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,965 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,966 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,972 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,973 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,974 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,975 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,975 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,978 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-05 07:56:27,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 07:56:27,981 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 07:56:27,983 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 07:56:27,985 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 07:56:27,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:56:27 BasicIcfg [2021-06-05 07:56:27,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 07:56:27,987 INFO L168 Benchmark]: Toolchain (without parser) took 786427.55 ms. Allocated memory was 346.0 MB in the beginning and 8.6 GB in the end (delta: 8.3 GB). Free memory was 308.0 MB in the beginning and 6.4 GB in the end (delta: -6.1 GB). Peak memory consumption was 6.5 GB. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 346.0 MB. Free memory is still 326.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.91 ms. Allocated memory is still 346.0 MB. Free memory was 307.7 MB in the beginning and 281.2 MB in the end (delta: 26.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.68 ms. Allocated memory is still 346.0 MB. Free memory was 281.2 MB in the beginning and 278.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 INFO L168 Benchmark]: Boogie Preprocessor took 54.60 ms. Allocated memory is still 346.0 MB. Free memory was 278.2 MB in the beginning and 276.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 INFO L168 Benchmark]: RCFGBuilder took 651.28 ms. Allocated memory is still 346.0 MB. Free memory was 276.1 MB in the beginning and 227.8 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 INFO L168 Benchmark]: TraceAbstraction took 784927.96 ms. Allocated memory was 346.0 MB in the beginning and 8.6 GB in the end (delta: 8.3 GB). Free memory was 227.8 MB in the beginning and 6.4 GB in the end (delta: -6.2 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB. [2021-06-05 07:56:27,987 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.15 ms. Allocated memory is still 346.0 MB. Free memory is still 326.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 708.91 ms. Allocated memory is still 346.0 MB. Free memory was 307.7 MB in the beginning and 281.2 MB in the end (delta: 26.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.68 ms. Allocated memory is still 346.0 MB. Free memory was 281.2 MB in the beginning and 278.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 54.60 ms. Allocated memory is still 346.0 MB. Free memory was 278.2 MB in the beginning and 276.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 651.28 ms. Allocated memory is still 346.0 MB. Free memory was 276.1 MB in the beginning and 227.8 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 784927.96 ms. Allocated memory was 346.0 MB in the beginning and 8.6 GB in the end (delta: 8.3 GB). Free memory was 227.8 MB in the beginning and 6.4 GB in the end (delta: -6.2 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 784685.0ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 338.8ms, AutomataDifference: 510718.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1289.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 14701 SDtfs, 75450 SDslu, 292981 SDs, 0 SdLazy, 144387 SolverSat, 4014 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 227108.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3781 GetRequests, 494 SyntacticMatches, 168 SemanticMatches, 3119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101194 ImplicationChecksByTransitivity, 399978.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 1950, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8440.8ms AutomataMinimizationTime, 36 MinimizatonAttempts, 105515 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 116.9ms SsaConstructionTime, 946.6ms SatisfiabilityAnalysisTime, 148992.5ms InterpolantComputationTime, 5594 NumberOfCodeBlocks, 5594 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5558 ConstructedInterpolants, 0 QuantifiedInterpolants, 384560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown