/usr/bin/java -Xmx8000000000 -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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 15:53:05,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 15:53:05,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 15:53:05,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 15:53:05,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 15:53:05,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 15:53:05,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 15:53:05,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 15:53:05,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 15:53:05,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 15:53:05,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 15:53:05,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 15:53:05,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 15:53:05,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 15:53:05,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 15:53:05,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 15:53:05,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 15:53:05,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 15:53:05,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 15:53:05,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 15:53:05,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 15:53:05,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 15:53:05,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 15:53:05,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 15:53:05,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 15:53:05,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 15:53:05,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 15:53:05,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 15:53:05,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 15:53:05,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 15:53:05,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 15:53:05,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 15:53:05,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 15:53:05,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 15:53:05,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 15:53:05,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 15:53:05,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 15:53:05,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 15:53:05,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 15:53:05,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 15:53:05,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 15:53:05,131 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.epf [2021-08-12 15:53:05,174 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 15:53:05,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 15:53:05,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 15:53:05,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 15:53:05,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 15:53:05,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 15:53:05,176 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 15:53:05,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 15:53:05,177 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 15:53:05,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 15:53:05,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 15:53:05,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 15:53:05,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 15:53:05,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 15:53:05,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-12 15:53:05,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 15:53:05,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 15:53:05,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 15:53:05,649 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 15:53:05,649 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 15:53:05,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2021-08-12 15:53:05,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5500b9295/78d09c77165648b6b6f752b7f762c6d7/FLAG83cd942f8 [2021-08-12 15:53:06,335 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 15:53:06,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2021-08-12 15:53:06,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5500b9295/78d09c77165648b6b6f752b7f762c6d7/FLAG83cd942f8 [2021-08-12 15:53:06,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5500b9295/78d09c77165648b6b6f752b7f762c6d7 [2021-08-12 15:53:06,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 15:53:06,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 15:53:06,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 15:53:06,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 15:53:06,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 15:53:06,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 03:53:06" (1/1) ... [2021-08-12 15:53:06,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254cda35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:06, skipping insertion in model container [2021-08-12 15:53:06,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 03:53:06" (1/1) ... [2021-08-12 15:53:06,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 15:53:06,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 15:53:06,963 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-08-12 15:53:06,967 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-08-12 15:53:06,969 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-08-12 15:53:06,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 15:53:06,977 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 15:53:07,001 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-08-12 15:53:07,002 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-08-12 15:53:07,004 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-08-12 15:53:07,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 15:53:07,082 INFO L208 MainTranslator]: Completed translation [2021-08-12 15:53:07,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07 WrapperNode [2021-08-12 15:53:07,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 15:53:07,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 15:53:07,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 15:53:07,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 15:53:07,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 15:53:07,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 15:53:07,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 15:53:07,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 15:53:07,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (1/1) ... [2021-08-12 15:53:07,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 15:53:07,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 15:53:07,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 15:53:07,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 15:53:07,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (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-08-12 15:53:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-08-12 15:53:07,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-08-12 15:53:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-08-12 15:53:07,328 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 15:53:07,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 15:53:07,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 15:53:07,329 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 15:53:08,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 15:53:08,039 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-12 15:53:08,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 03:53:08 BoogieIcfgContainer [2021-08-12 15:53:08,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 15:53:08,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 15:53:08,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 15:53:08,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 15:53:08,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 03:53:06" (1/3) ... [2021-08-12 15:53:08,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb39d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 03:53:08, skipping insertion in model container [2021-08-12 15:53:08,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 03:53:07" (2/3) ... [2021-08-12 15:53:08,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cb39d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 03:53:08, skipping insertion in model container [2021-08-12 15:53:08,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 03:53:08" (3/3) ... [2021-08-12 15:53:08,046 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2021-08-12 15:53:08,050 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 15:53:08,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-08-12 15:53:08,051 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 15:53:08,091 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,091 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,091 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,091 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,092 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,093 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,094 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,095 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,113 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,121 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,122 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,123 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,124 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,125 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,126 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,127 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,128 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,129 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,130 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,131 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,132 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,133 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,134 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,135 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,136 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,137 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,138 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,139 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,140 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,141 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,142 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,143 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,147 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,147 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,147 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,147 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,148 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,149 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,150 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,151 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,152 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,153 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,155 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,156 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,157 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,158 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,159 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,160 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,161 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,162 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,163 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,164 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,166 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,167 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,167 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,167 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,167 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,167 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,167 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,198 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,198 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,199 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,200 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,201 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,201 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,204 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,205 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,205 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,206 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,206 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,207 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 15:53:08,221 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-08-12 15:53:08,236 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 15:53:08,256 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 15:53:08,256 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 15:53:08,256 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 15:53:08,256 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 15:53:08,256 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 15:53:08,256 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 15:53:08,256 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 15:53:08,256 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 15:53:08,270 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-08-12 15:53:09,469 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-08-12 15:53:09,539 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-08-12 15:53:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-12 15:53:09,544 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:09,544 INFO L550 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-08-12 15:53:09,544 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:09,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash 617310073, now seen corresponding path program 1 times [2021-08-12 15:53:09,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:09,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568155280] [2021-08-12 15:53:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:09,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-08-12 15:53:09,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:09,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568155280] [2021-08-12 15:53:09,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568155280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:09,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:09,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 15:53:09,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461758541] [2021-08-12 15:53:09,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-08-12 15:53:09,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-12 15:53:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-12 15:53:09,724 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-08-12 15:53:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:10,617 INFO L93 Difference]: Finished difference Result 46609 states and 132839 transitions. [2021-08-12 15:53:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-12 15:53:10,618 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-08-12 15:53:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:10,783 INFO L225 Difference]: With dead ends: 46609 [2021-08-12 15:53:10,784 INFO L226 Difference]: Without dead ends: 22283 [2021-08-12 15:53:10,820 INFO L806 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-08-12 15:53:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2021-08-12 15:53:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22283. [2021-08-12 15:53:11,852 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-08-12 15:53:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22283 states to 22283 states and 62354 transitions. [2021-08-12 15:53:11,994 INFO L78 Accepts]: Start accepts. Automaton has 22283 states and 62354 transitions. Word has length 48 [2021-08-12 15:53:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:11,995 INFO L482 AbstractCegarLoop]: Abstraction has 22283 states and 62354 transitions. [2021-08-12 15:53:11,995 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-08-12 15:53:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 62354 transitions. [2021-08-12 15:53:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-12 15:53:12,005 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:12,006 INFO L550 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-08-12 15:53:12,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 15:53:12,006 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -383819529, now seen corresponding path program 1 times [2021-08-12 15:53:12,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:12,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716833135] [2021-08-12 15:53:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:12,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:12,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716833135] [2021-08-12 15:53:12,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716833135] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:12,423 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:12,423 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 15:53:12,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89414212] [2021-08-12 15:53:12,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 15:53:12,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:12,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 15:53:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-12 15:53:12,430 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-08-12 15:53:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:13,741 INFO L93 Difference]: Finished difference Result 44519 states and 124660 transitions. [2021-08-12 15:53:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 15:53:13,742 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-08-12 15:53:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:13,846 INFO L225 Difference]: With dead ends: 44519 [2021-08-12 15:53:13,846 INFO L226 Difference]: Without dead ends: 22280 [2021-08-12 15:53:13,880 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 346.0ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-08-12 15:53:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2021-08-12 15:53:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 22280. [2021-08-12 15:53:14,584 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-08-12 15:53:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 62350 transitions. [2021-08-12 15:53:14,714 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 62350 transitions. Word has length 83 [2021-08-12 15:53:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:14,715 INFO L482 AbstractCegarLoop]: Abstraction has 22280 states and 62350 transitions. [2021-08-12 15:53:14,715 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-08-12 15:53:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 62350 transitions. [2021-08-12 15:53:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-12 15:53:14,719 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:14,720 INFO L550 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-08-12 15:53:14,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 15:53:14,720 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1409373696, now seen corresponding path program 1 times [2021-08-12 15:53:14,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:14,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120079428] [2021-08-12 15:53:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:14,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:14,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120079428] [2021-08-12 15:53:14,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120079428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:14,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:14,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-12 15:53:14,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528295785] [2021-08-12 15:53:14,802 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-08-12 15:53:14,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-12 15:53:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-12 15:53:14,803 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-08-12 15:53:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:15,509 INFO L93 Difference]: Finished difference Result 22714 states and 63329 transitions. [2021-08-12 15:53:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-12 15:53:15,509 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-08-12 15:53:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:15,586 INFO L225 Difference]: With dead ends: 22714 [2021-08-12 15:53:15,586 INFO L226 Difference]: Without dead ends: 22063 [2021-08-12 15:53:15,592 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-12 15:53:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2021-08-12 15:53:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22063. [2021-08-12 15:53:16,197 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-08-12 15:53:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22063 states to 22063 states and 61535 transitions. [2021-08-12 15:53:16,294 INFO L78 Accepts]: Start accepts. Automaton has 22063 states and 61535 transitions. Word has length 84 [2021-08-12 15:53:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:16,296 INFO L482 AbstractCegarLoop]: Abstraction has 22063 states and 61535 transitions. [2021-08-12 15:53:16,296 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-08-12 15:53:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 22063 states and 61535 transitions. [2021-08-12 15:53:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-12 15:53:16,306 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:16,306 INFO L550 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-08-12 15:53:16,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 15:53:16,307 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1743993907, now seen corresponding path program 1 times [2021-08-12 15:53:16,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:16,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500002202] [2021-08-12 15:53:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:16,392 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:16,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500002202] [2021-08-12 15:53:16,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500002202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:16,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:16,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-12 15:53:16,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483980228] [2021-08-12 15:53:16,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 15:53:16,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 15:53:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 15:53:16,394 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-08-12 15:53:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:17,004 INFO L93 Difference]: Finished difference Result 35484 states and 99318 transitions. [2021-08-12 15:53:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 15:53:17,005 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-08-12 15:53:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:17,069 INFO L225 Difference]: With dead ends: 35484 [2021-08-12 15:53:17,069 INFO L226 Difference]: Without dead ends: 15112 [2021-08-12 15:53:17,097 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 15:53:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2021-08-12 15:53:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 15112. [2021-08-12 15:53:17,485 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-08-12 15:53:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 41551 transitions. [2021-08-12 15:53:17,550 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 41551 transitions. Word has length 93 [2021-08-12 15:53:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:17,551 INFO L482 AbstractCegarLoop]: Abstraction has 15112 states and 41551 transitions. [2021-08-12 15:53:17,552 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-08-12 15:53:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 41551 transitions. [2021-08-12 15:53:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-12 15:53:17,560 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:17,560 INFO L550 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-08-12 15:53:17,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 15:53:17,560 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -477175304, now seen corresponding path program 1 times [2021-08-12 15:53:17,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:17,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006048949] [2021-08-12 15:53:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:17,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:17,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006048949] [2021-08-12 15:53:17,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006048949] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:17,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:17,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-12 15:53:17,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952247852] [2021-08-12 15:53:17,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-08-12 15:53:17,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-12 15:53:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-12 15:53:17,612 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-08-12 15:53:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:18,289 INFO L93 Difference]: Finished difference Result 26856 states and 74147 transitions. [2021-08-12 15:53:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-12 15:53:18,289 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-08-12 15:53:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:18,383 INFO L225 Difference]: With dead ends: 26856 [2021-08-12 15:53:18,383 INFO L226 Difference]: Without dead ends: 26571 [2021-08-12 15:53:18,399 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-12 15:53:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26571 states. [2021-08-12 15:53:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26571 to 15217. [2021-08-12 15:53:18,904 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-08-12 15:53:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15217 states to 15217 states and 41818 transitions. [2021-08-12 15:53:18,994 INFO L78 Accepts]: Start accepts. Automaton has 15217 states and 41818 transitions. Word has length 99 [2021-08-12 15:53:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:18,994 INFO L482 AbstractCegarLoop]: Abstraction has 15217 states and 41818 transitions. [2021-08-12 15:53:18,995 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-08-12 15:53:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15217 states and 41818 transitions. [2021-08-12 15:53:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-12 15:53:19,000 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:19,000 INFO L550 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-08-12 15:53:19,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 15:53:19,000 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1731505684, now seen corresponding path program 1 times [2021-08-12 15:53:19,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:19,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848774994] [2021-08-12 15:53:19,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:19,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:19,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848774994] [2021-08-12 15:53:19,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848774994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:19,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:19,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-12 15:53:19,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593801202] [2021-08-12 15:53:19,249 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-08-12 15:53:19,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-12 15:53:19,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-12 15:53:19,250 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-08-12 15:53:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:20,708 INFO L93 Difference]: Finished difference Result 28606 states and 78894 transitions. [2021-08-12 15:53:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 15:53:20,708 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-08-12 15:53:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:20,777 INFO L225 Difference]: With dead ends: 28606 [2021-08-12 15:53:20,777 INFO L226 Difference]: Without dead ends: 15327 [2021-08-12 15:53:20,802 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 514.9ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-08-12 15:53:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2021-08-12 15:53:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 15267. [2021-08-12 15:53:21,458 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-08-12 15:53:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 41955 transitions. [2021-08-12 15:53:21,521 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 41955 transitions. Word has length 100 [2021-08-12 15:53:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:21,521 INFO L482 AbstractCegarLoop]: Abstraction has 15267 states and 41955 transitions. [2021-08-12 15:53:21,521 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-08-12 15:53:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 41955 transitions. [2021-08-12 15:53:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-12 15:53:21,527 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:21,527 INFO L550 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-08-12 15:53:21,527 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 15:53:21,527 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash 588694202, now seen corresponding path program 1 times [2021-08-12 15:53:21,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:21,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608333646] [2021-08-12 15:53:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:22,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:22,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608333646] [2021-08-12 15:53:22,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608333646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:22,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:22,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-08-12 15:53:22,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435095198] [2021-08-12 15:53:22,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-08-12 15:53:22,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-12 15:53:22,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-08-12 15:53:22,180 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-08-12 15:53:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:24,751 INFO L93 Difference]: Finished difference Result 27281 states and 75346 transitions. [2021-08-12 15:53:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-12 15:53:24,751 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-08-12 15:53:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:24,819 INFO L225 Difference]: With dead ends: 27281 [2021-08-12 15:53:24,819 INFO L226 Difference]: Without dead ends: 15262 [2021-08-12 15:53:24,839 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1615.7ms TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-08-12 15:53:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2021-08-12 15:53:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 15262. [2021-08-12 15:53:25,343 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-08-12 15:53:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15262 states to 15262 states and 41973 transitions. [2021-08-12 15:53:25,404 INFO L78 Accepts]: Start accepts. Automaton has 15262 states and 41973 transitions. Word has length 104 [2021-08-12 15:53:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:25,404 INFO L482 AbstractCegarLoop]: Abstraction has 15262 states and 41973 transitions. [2021-08-12 15:53:25,404 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-08-12 15:53:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 15262 states and 41973 transitions. [2021-08-12 15:53:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-12 15:53:25,409 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:25,409 INFO L550 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-08-12 15:53:25,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 15:53:25,410 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1887066075, now seen corresponding path program 1 times [2021-08-12 15:53:25,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:25,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17737727] [2021-08-12 15:53:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:25,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:25,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17737727] [2021-08-12 15:53:25,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17737727] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:25,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:25,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-12 15:53:25,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493602247] [2021-08-12 15:53:25,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-08-12 15:53:25,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-12 15:53:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-08-12 15:53:25,761 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-08-12 15:53:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:27,678 INFO L93 Difference]: Finished difference Result 30666 states and 84933 transitions. [2021-08-12 15:53:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 15:53:27,679 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-08-12 15:53:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:27,756 INFO L225 Difference]: With dead ends: 30666 [2021-08-12 15:53:27,756 INFO L226 Difference]: Without dead ends: 17982 [2021-08-12 15:53:27,774 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 761.2ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-08-12 15:53:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17982 states. [2021-08-12 15:53:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17982 to 16042. [2021-08-12 15:53:28,251 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-08-12 15:53:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16042 states to 16042 states and 44079 transitions. [2021-08-12 15:53:28,574 INFO L78 Accepts]: Start accepts. Automaton has 16042 states and 44079 transitions. Word has length 105 [2021-08-12 15:53:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:28,574 INFO L482 AbstractCegarLoop]: Abstraction has 16042 states and 44079 transitions. [2021-08-12 15:53:28,574 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-08-12 15:53:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 16042 states and 44079 transitions. [2021-08-12 15:53:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-12 15:53:28,580 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:28,580 INFO L550 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-08-12 15:53:28,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 15:53:28,581 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1261951723, now seen corresponding path program 2 times [2021-08-12 15:53:28,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:28,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555588153] [2021-08-12 15:53:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:29,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:29,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555588153] [2021-08-12 15:53:29,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555588153] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:29,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:29,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-12 15:53:29,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875033004] [2021-08-12 15:53:29,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-08-12 15:53:29,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-12 15:53:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-08-12 15:53:29,261 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-08-12 15:53:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:32,717 INFO L93 Difference]: Finished difference Result 29999 states and 83144 transitions. [2021-08-12 15:53:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-12 15:53:32,717 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-08-12 15:53:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:32,787 INFO L225 Difference]: With dead ends: 29999 [2021-08-12 15:53:32,787 INFO L226 Difference]: Without dead ends: 18260 [2021-08-12 15:53:32,805 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2079.0ms TimeCoverageRelationStatistics Valid=552, Invalid=2204, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:53:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18260 states. [2021-08-12 15:53:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18260 to 16342. [2021-08-12 15:53:33,396 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-08-12 15:53:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 44972 transitions. [2021-08-12 15:53:33,476 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 44972 transitions. Word has length 105 [2021-08-12 15:53:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:33,476 INFO L482 AbstractCegarLoop]: Abstraction has 16342 states and 44972 transitions. [2021-08-12 15:53:33,476 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-08-12 15:53:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 44972 transitions. [2021-08-12 15:53:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-12 15:53:33,483 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:33,483 INFO L550 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-08-12 15:53:33,483 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 15:53:33,483 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1732922443, now seen corresponding path program 1 times [2021-08-12 15:53:33,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:33,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002712098] [2021-08-12 15:53:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:34,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:34,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002712098] [2021-08-12 15:53:34,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002712098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:34,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:34,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-12 15:53:34,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189677989] [2021-08-12 15:53:34,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-08-12 15:53:34,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-12 15:53:34,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-08-12 15:53:34,244 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-08-12 15:53:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:37,810 INFO L93 Difference]: Finished difference Result 30052 states and 83378 transitions. [2021-08-12 15:53:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-12 15:53:37,811 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-08-12 15:53:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:37,882 INFO L225 Difference]: With dead ends: 30052 [2021-08-12 15:53:37,882 INFO L226 Difference]: Without dead ends: 17908 [2021-08-12 15:53:37,899 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2067.5ms TimeCoverageRelationStatistics Valid=525, Invalid=2337, Unknown=0, NotChecked=0, Total=2862 [2021-08-12 15:53:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17908 states. [2021-08-12 15:53:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17908 to 15487. [2021-08-12 15:53:38,560 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-08-12 15:53:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15487 states to 15487 states and 42651 transitions. [2021-08-12 15:53:38,635 INFO L78 Accepts]: Start accepts. Automaton has 15487 states and 42651 transitions. Word has length 109 [2021-08-12 15:53:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:38,636 INFO L482 AbstractCegarLoop]: Abstraction has 15487 states and 42651 transitions. [2021-08-12 15:53:38,636 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-08-12 15:53:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 15487 states and 42651 transitions. [2021-08-12 15:53:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-12 15:53:38,641 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:38,641 INFO L550 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-08-12 15:53:38,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 15:53:38,642 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1462976531, now seen corresponding path program 2 times [2021-08-12 15:53:38,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:38,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344167923] [2021-08-12 15:53:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:39,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:39,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344167923] [2021-08-12 15:53:39,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344167923] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:39,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:39,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-08-12 15:53:39,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969486231] [2021-08-12 15:53:39,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-08-12 15:53:39,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-12 15:53:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-08-12 15:53:39,273 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-08-12 15:53:40,475 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2021-08-12 15:53:41,922 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-08-12 15:53:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:43,021 INFO L93 Difference]: Finished difference Result 26977 states and 74946 transitions. [2021-08-12 15:53:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-12 15:53:43,021 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-08-12 15:53:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:43,085 INFO L225 Difference]: With dead ends: 26977 [2021-08-12 15:53:43,085 INFO L226 Difference]: Without dead ends: 15373 [2021-08-12 15:53:43,098 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2405.2ms TimeCoverageRelationStatistics Valid=568, Invalid=2402, Unknown=0, NotChecked=0, Total=2970 [2021-08-12 15:53:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15373 states. [2021-08-12 15:53:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15373 to 14527. [2021-08-12 15:53:43,721 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-08-12 15:53:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14527 states to 14527 states and 40029 transitions. [2021-08-12 15:53:43,790 INFO L78 Accepts]: Start accepts. Automaton has 14527 states and 40029 transitions. Word has length 109 [2021-08-12 15:53:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:43,791 INFO L482 AbstractCegarLoop]: Abstraction has 14527 states and 40029 transitions. [2021-08-12 15:53:43,791 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-08-12 15:53:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 14527 states and 40029 transitions. [2021-08-12 15:53:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-08-12 15:53:43,802 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:43,802 INFO L550 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-08-12 15:53:43,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 15:53:43,802 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1328138375, now seen corresponding path program 1 times [2021-08-12 15:53:43,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:43,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515146747] [2021-08-12 15:53:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:43,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:43,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515146747] [2021-08-12 15:53:43,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515146747] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:43,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:43,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-12 15:53:43,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785854124] [2021-08-12 15:53:43,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 15:53:43,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 15:53:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 15:53:43,831 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-08-12 15:53:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:44,468 INFO L93 Difference]: Finished difference Result 18757 states and 51710 transitions. [2021-08-12 15:53:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 15:53:44,469 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-08-12 15:53:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:44,524 INFO L225 Difference]: With dead ends: 18757 [2021-08-12 15:53:44,524 INFO L226 Difference]: Without dead ends: 7076 [2021-08-12 15:53:44,536 INFO L806 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-08-12 15:53:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2021-08-12 15:53:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5822. [2021-08-12 15:53:44,817 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-08-12 15:53:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 14939 transitions. [2021-08-12 15:53:44,873 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 14939 transitions. Word has length 171 [2021-08-12 15:53:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:44,874 INFO L482 AbstractCegarLoop]: Abstraction has 5822 states and 14939 transitions. [2021-08-12 15:53:44,874 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-08-12 15:53:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 14939 transitions. [2021-08-12 15:53:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-08-12 15:53:44,882 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:44,882 INFO L550 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-08-12 15:53:44,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 15:53:44,882 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:44,883 INFO L82 PathProgramCache]: Analyzing trace with hash 307883539, now seen corresponding path program 1 times [2021-08-12 15:53:44,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:44,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524918655] [2021-08-12 15:53:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:45,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:45,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524918655] [2021-08-12 15:53:45,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524918655] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:45,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:45,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-12 15:53:45,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209313749] [2021-08-12 15:53:45,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-08-12 15:53:45,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-12 15:53:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-08-12 15:53:45,807 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-08-12 15:53:46,600 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-08-12 15:53:46,752 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2021-08-12 15:53:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:47,713 INFO L93 Difference]: Finished difference Result 9483 states and 24588 transitions. [2021-08-12 15:53:47,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 15:53:47,713 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-08-12 15:53:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:47,764 INFO L225 Difference]: With dead ends: 9483 [2021-08-12 15:53:47,764 INFO L226 Difference]: Without dead ends: 5780 [2021-08-12 15:53:47,769 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1450.2ms TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2021-08-12 15:53:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2021-08-12 15:53:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5486. [2021-08-12 15:53:47,968 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-08-12 15:53:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 14070 transitions. [2021-08-12 15:53:48,023 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 14070 transitions. Word has length 172 [2021-08-12 15:53:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:48,024 INFO L482 AbstractCegarLoop]: Abstraction has 5486 states and 14070 transitions. [2021-08-12 15:53:48,024 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-08-12 15:53:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 14070 transitions. [2021-08-12 15:53:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-12 15:53:48,031 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:48,031 INFO L550 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-08-12 15:53:48,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 15:53:48,031 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash -399593919, now seen corresponding path program 1 times [2021-08-12 15:53:48,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:48,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582007884] [2021-08-12 15:53:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:48,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:48,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582007884] [2021-08-12 15:53:48,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582007884] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:48,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:48,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-12 15:53:48,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926810023] [2021-08-12 15:53:48,649 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-08-12 15:53:48,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-12 15:53:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-08-12 15:53:48,650 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-08-12 15:53:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:51,840 INFO L93 Difference]: Finished difference Result 10295 states and 26578 transitions. [2021-08-12 15:53:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-12 15:53:51,840 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-08-12 15:53:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:51,900 INFO L225 Difference]: With dead ends: 10295 [2021-08-12 15:53:51,900 INFO L226 Difference]: Without dead ends: 7004 [2021-08-12 15:53:51,907 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2189.7ms TimeCoverageRelationStatistics Valid=742, Invalid=2918, Unknown=0, NotChecked=0, Total=3660 [2021-08-12 15:53:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2021-08-12 15:53:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6390. [2021-08-12 15:53:52,316 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-08-12 15:53:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 16399 transitions. [2021-08-12 15:53:52,368 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 16399 transitions. Word has length 176 [2021-08-12 15:53:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:52,369 INFO L482 AbstractCegarLoop]: Abstraction has 6390 states and 16399 transitions. [2021-08-12 15:53:52,369 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-08-12 15:53:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 16399 transitions. [2021-08-12 15:53:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-12 15:53:52,376 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:52,376 INFO L550 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-08-12 15:53:52,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 15:53:52,376 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122175, now seen corresponding path program 2 times [2021-08-12 15:53:52,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:52,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440184916] [2021-08-12 15:53:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:53,466 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:53,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440184916] [2021-08-12 15:53:53,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440184916] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:53,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:53,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-12 15:53:53,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507532415] [2021-08-12 15:53:53,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-08-12 15:53:53,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:53,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-12 15:53:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-08-12 15:53:53,468 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-08-12 15:53:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:53:58,115 INFO L93 Difference]: Finished difference Result 13280 states and 34509 transitions. [2021-08-12 15:53:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-12 15:53:58,116 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-08-12 15:53:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:53:58,174 INFO L225 Difference]: With dead ends: 13280 [2021-08-12 15:53:58,174 INFO L226 Difference]: Without dead ends: 10790 [2021-08-12 15:53:58,180 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 3550.1ms TimeCoverageRelationStatistics Valid=1135, Invalid=4565, Unknown=0, NotChecked=0, Total=5700 [2021-08-12 15:53:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10790 states. [2021-08-12 15:53:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10790 to 9241. [2021-08-12 15:53:58,911 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-08-12 15:53:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 23970 transitions. [2021-08-12 15:53:58,973 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 23970 transitions. Word has length 176 [2021-08-12 15:53:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:53:58,973 INFO L482 AbstractCegarLoop]: Abstraction has 9241 states and 23970 transitions. [2021-08-12 15:53:58,973 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-08-12 15:53:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 23970 transitions. [2021-08-12 15:53:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-08-12 15:53:58,982 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:53:58,982 INFO L550 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-08-12 15:53:58,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 15:53:58,982 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:53:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:53:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash -788395354, now seen corresponding path program 1 times [2021-08-12 15:53:58,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:53:58,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246260558] [2021-08-12 15:53:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:53:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:53:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:53:59,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:53:59,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246260558] [2021-08-12 15:53:59,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246260558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:53:59,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:53:59,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-08-12 15:53:59,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526750885] [2021-08-12 15:53:59,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-08-12 15:53:59,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:53:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-12 15:53:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-08-12 15:53:59,569 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-08-12 15:54:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:54:02,409 INFO L93 Difference]: Finished difference Result 14122 states and 36865 transitions. [2021-08-12 15:54:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-12 15:54:02,409 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-08-12 15:54:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:54:02,461 INFO L225 Difference]: With dead ends: 14122 [2021-08-12 15:54:02,461 INFO L226 Difference]: Without dead ends: 8320 [2021-08-12 15:54:02,466 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1785.1ms TimeCoverageRelationStatistics Valid=610, Invalid=2146, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:54:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2021-08-12 15:54:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 8026. [2021-08-12 15:54:02,806 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-08-12 15:54:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8026 states to 8026 states and 20656 transitions. [2021-08-12 15:54:02,867 INFO L78 Accepts]: Start accepts. Automaton has 8026 states and 20656 transitions. Word has length 180 [2021-08-12 15:54:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:54:02,867 INFO L482 AbstractCegarLoop]: Abstraction has 8026 states and 20656 transitions. [2021-08-12 15:54:02,868 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-08-12 15:54:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8026 states and 20656 transitions. [2021-08-12 15:54:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:54:02,874 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:54:02,874 INFO L550 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-08-12 15:54:02,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-12 15:54:02,874 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:54:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:54:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash -858234869, now seen corresponding path program 1 times [2021-08-12 15:54:02,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:54:02,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897530542] [2021-08-12 15:54:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:54:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:54:03,447 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:54:04,844 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-08-12 15:54:05,893 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2021-08-12 15:54:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:54:07,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:54:07,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897530542] [2021-08-12 15:54:07,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897530542] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:54:07,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:54:07,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:54:07,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869695910] [2021-08-12 15:54:07,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:54:07,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:54:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:54:07,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:54:07,526 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-08-12 15:54:09,958 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-08-12 15:54:10,471 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-08-12 15:54:10,946 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-08-12 15:54:13,226 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:54:13,481 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:54:17,236 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:54:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:54:20,736 INFO L93 Difference]: Finished difference Result 12059 states and 31079 transitions. [2021-08-12 15:54:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-08-12 15:54:20,737 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-08-12 15:54:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:54:20,814 INFO L225 Difference]: With dead ends: 12059 [2021-08-12 15:54:20,814 INFO L226 Difference]: Without dead ends: 11499 [2021-08-12 15:54:20,822 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4396 ImplicationChecksByTransitivity, 11643.8ms TimeCoverageRelationStatistics Valid=1517, Invalid=14739, Unknown=0, NotChecked=0, Total=16256 [2021-08-12 15:54:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11499 states. [2021-08-12 15:54:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11499 to 9438. [2021-08-12 15:54:21,475 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-08-12 15:54:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-08-12 15:54:21,553 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-08-12 15:54:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:54:21,554 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-08-12 15:54:21,554 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-08-12 15:54:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-08-12 15:54:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:54:21,563 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:54:21,563 INFO L550 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-08-12 15:54:21,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-12 15:54:21,563 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:54:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:54:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1302633973, now seen corresponding path program 2 times [2021-08-12 15:54:21,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:54:21,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300649189] [2021-08-12 15:54:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:54:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:54:22,182 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:54:23,740 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-08-12 15:54:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:54:26,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:54:26,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300649189] [2021-08-12 15:54:26,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300649189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:54:26,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:54:26,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:54:26,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701132759] [2021-08-12 15:54:26,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:54:26,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:54:26,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:54:26,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:54:26,484 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-08-12 15:54:29,174 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2021-08-12 15:54:29,423 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-08-12 15:54:29,841 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-08-12 15:54:30,317 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-08-12 15:54:31,375 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2021-08-12 15:54:32,977 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-08-12 15:54:33,439 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:54:33,696 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:54:34,030 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:54:36,098 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:54:38,774 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:54:39,193 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-08-12 15:54:40,913 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-08-12 15:54:41,172 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:54:42,285 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 15:54:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:54:43,215 INFO L93 Difference]: Finished difference Result 13583 states and 34885 transitions. [2021-08-12 15:54:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-12 15:54:43,216 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-08-12 15:54:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:54:43,287 INFO L225 Difference]: With dead ends: 13583 [2021-08-12 15:54:43,287 INFO L226 Difference]: Without dead ends: 13023 [2021-08-12 15:54:43,294 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4458 ImplicationChecksByTransitivity, 13318.4ms TimeCoverageRelationStatistics Valid=1535, Invalid=14977, Unknown=0, NotChecked=0, Total=16512 [2021-08-12 15:54:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2021-08-12 15:54:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 9438. [2021-08-12 15:54:43,791 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-08-12 15:54:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-08-12 15:54:43,870 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-08-12 15:54:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:54:43,871 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-08-12 15:54:43,871 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-08-12 15:54:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-08-12 15:54:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:54:43,880 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:54:43,880 INFO L550 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-08-12 15:54:43,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-12 15:54:43,880 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:54:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:54:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash 868546213, now seen corresponding path program 3 times [2021-08-12 15:54:43,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:54:43,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947054218] [2021-08-12 15:54:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:54:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:54:44,524 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:54:44,703 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:54:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:54:48,551 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:54:48,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947054218] [2021-08-12 15:54:48,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947054218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:54:48,551 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:54:48,551 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:54:48,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133367890] [2021-08-12 15:54:48,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:54:48,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:54:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:54:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:54:48,552 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-08-12 15:54:51,891 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-08-12 15:54:52,691 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-08-12 15:54:53,073 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-08-12 15:54:53,943 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2021-08-12 15:54:55,658 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:54:55,903 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:54:56,212 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:54:58,340 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:55:00,775 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:55:01,192 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-08-12 15:55:03,329 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:55:04,275 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 15:55:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:55:05,176 INFO L93 Difference]: Finished difference Result 13647 states and 35045 transitions. [2021-08-12 15:55:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-08-12 15:55:05,176 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-08-12 15:55:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:55:05,253 INFO L225 Difference]: With dead ends: 13647 [2021-08-12 15:55:05,253 INFO L226 Difference]: Without dead ends: 13087 [2021-08-12 15:55:05,257 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 13118.2ms TimeCoverageRelationStatistics Valid=1578, Invalid=15452, Unknown=0, NotChecked=0, Total=17030 [2021-08-12 15:55:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-08-12 15:55:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9438. [2021-08-12 15:55:05,775 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-08-12 15:55:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-08-12 15:55:05,854 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-08-12 15:55:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:55:05,855 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-08-12 15:55:05,855 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-08-12 15:55:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-08-12 15:55:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:55:05,864 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:55:05,864 INFO L550 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-08-12 15:55:05,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-12 15:55:05,864 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:55:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:55:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1647526667, now seen corresponding path program 4 times [2021-08-12 15:55:05,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:55:05,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096895305] [2021-08-12 15:55:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:55:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:55:06,494 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:55:06,649 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:55:07,348 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-08-12 15:55:08,064 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 15:55:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:55:10,670 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:55:10,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096895305] [2021-08-12 15:55:10,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096895305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:55:10,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:55:10,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:55:10,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087556411] [2021-08-12 15:55:10,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:55:10,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:55:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:55:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:55:10,671 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-08-12 15:55:14,726 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-08-12 15:55:15,522 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-08-12 15:55:15,880 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-08-12 15:55:16,676 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-08-12 15:55:18,378 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:55:18,643 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:55:18,987 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:55:21,319 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:55:26,317 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:55:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:55:28,175 INFO L93 Difference]: Finished difference Result 13631 states and 35009 transitions. [2021-08-12 15:55:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-08-12 15:55:28,181 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-08-12 15:55:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:55:28,254 INFO L225 Difference]: With dead ends: 13631 [2021-08-12 15:55:28,254 INFO L226 Difference]: Without dead ends: 13071 [2021-08-12 15:55:28,258 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4696 ImplicationChecksByTransitivity, 13608.4ms TimeCoverageRelationStatistics Valid=1605, Invalid=15687, Unknown=0, NotChecked=0, Total=17292 [2021-08-12 15:55:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13071 states. [2021-08-12 15:55:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13071 to 9438. [2021-08-12 15:55:28,778 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-08-12 15:55:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-08-12 15:55:28,866 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-08-12 15:55:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:55:28,866 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-08-12 15:55:28,866 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-08-12 15:55:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-08-12 15:55:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:55:28,876 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:55:28,876 INFO L550 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-08-12 15:55:28,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-12 15:55:28,876 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:55:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:55:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -276826587, now seen corresponding path program 5 times [2021-08-12 15:55:28,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:55:28,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221531812] [2021-08-12 15:55:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:55:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:55:29,395 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:55:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:55:33,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:55:33,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221531812] [2021-08-12 15:55:33,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221531812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:55:33,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:55:33,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:55:33,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837543073] [2021-08-12 15:55:33,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:55:33,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:55:33,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:55:33,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:55:33,779 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-08-12 15:55:36,098 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2021-08-12 15:55:36,373 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 15:55:36,758 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2021-08-12 15:55:37,278 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-08-12 15:55:38,843 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-08-12 15:55:39,255 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-08-12 15:55:39,987 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-08-12 15:55:40,517 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:55:41,212 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-08-12 15:55:41,893 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2021-08-12 15:55:44,970 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:55:45,266 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:55:45,628 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:55:48,117 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:55:51,005 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:55:54,115 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-08-12 15:55:54,555 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 15:55:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:55:55,570 INFO L93 Difference]: Finished difference Result 13735 states and 35265 transitions. [2021-08-12 15:55:55,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-08-12 15:55:55,570 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-08-12 15:55:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:55:55,647 INFO L225 Difference]: With dead ends: 13735 [2021-08-12 15:55:55,647 INFO L226 Difference]: Without dead ends: 13175 [2021-08-12 15:55:55,651 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5126 ImplicationChecksByTransitivity, 16506.6ms TimeCoverageRelationStatistics Valid=1721, Invalid=16911, Unknown=0, NotChecked=0, Total=18632 [2021-08-12 15:55:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2021-08-12 15:55:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 9438. [2021-08-12 15:55:56,202 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-08-12 15:55:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-08-12 15:55:56,296 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-08-12 15:55:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:55:56,296 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-08-12 15:55:56,297 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-08-12 15:55:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-08-12 15:55:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:55:56,308 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:55:56,308 INFO L550 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-08-12 15:55:56,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-12 15:55:56,308 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:55:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:55:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash -410727541, now seen corresponding path program 6 times [2021-08-12 15:55:56,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:55:56,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022991121] [2021-08-12 15:55:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:55:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:55:56,789 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:55:56,929 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:55:57,132 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-08-12 15:55:57,295 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-08-12 15:55:57,454 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-08-12 15:55:57,609 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-08-12 15:55:57,800 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-08-12 15:55:58,216 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-08-12 15:56:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:56:01,354 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:56:01,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022991121] [2021-08-12 15:56:01,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022991121] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:56:01,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:56:01,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:56:01,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857463371] [2021-08-12 15:56:01,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:56:01,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:56:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:56:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:56:01,355 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-08-12 15:56:04,073 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:56:04,502 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:56:06,329 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-08-12 15:56:06,908 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2021-08-12 15:56:07,533 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2021-08-12 15:56:09,178 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2021-08-12 15:56:10,151 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:56:10,404 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:56:10,705 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:56:12,620 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:56:15,090 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:56:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:56:18,963 INFO L93 Difference]: Finished difference Result 13647 states and 35067 transitions. [2021-08-12 15:56:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-08-12 15:56:18,963 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-08-12 15:56:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:56:19,114 INFO L225 Difference]: With dead ends: 13647 [2021-08-12 15:56:19,115 INFO L226 Difference]: Without dead ends: 13087 [2021-08-12 15:56:19,122 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4846 ImplicationChecksByTransitivity, 14397.8ms TimeCoverageRelationStatistics Valid=1643, Invalid=16179, Unknown=0, NotChecked=0, Total=17822 [2021-08-12 15:56:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-08-12 15:56:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9516. [2021-08-12 15:56:19,844 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-08-12 15:56:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24328 transitions. [2021-08-12 15:56:19,930 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24328 transitions. Word has length 184 [2021-08-12 15:56:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:56:19,931 INFO L482 AbstractCegarLoop]: Abstraction has 9516 states and 24328 transitions. [2021-08-12 15:56:19,931 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-08-12 15:56:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24328 transitions. [2021-08-12 15:56:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:56:19,940 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:56:19,940 INFO L550 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-08-12 15:56:19,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-12 15:56:19,941 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:56:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:56:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2715019, now seen corresponding path program 7 times [2021-08-12 15:56:19,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:56:19,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911521053] [2021-08-12 15:56:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:56:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:56:20,397 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:56:20,536 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:56:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:56:24,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:56:24,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911521053] [2021-08-12 15:56:24,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911521053] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:56:24,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:56:24,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:56:24,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71530292] [2021-08-12 15:56:24,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:56:24,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:56:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:56:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:56:24,248 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-08-12 15:56:26,926 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 15:56:27,311 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:56:27,643 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:56:29,155 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-08-12 15:56:29,776 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-08-12 15:56:30,368 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-08-12 15:56:33,951 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:56:34,261 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:56:34,634 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:56:35,149 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-08-12 15:56:36,886 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:56:39,341 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-08-12 15:56:39,706 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:56:40,277 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-08-12 15:56:42,031 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:56:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:56:43,946 INFO L93 Difference]: Finished difference Result 13588 states and 34940 transitions. [2021-08-12 15:56:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-08-12 15:56:43,947 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-08-12 15:56:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:56:44,029 INFO L225 Difference]: With dead ends: 13588 [2021-08-12 15:56:44,029 INFO L226 Difference]: Without dead ends: 13028 [2021-08-12 15:56:44,035 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5078 ImplicationChecksByTransitivity, 14490.2ms TimeCoverageRelationStatistics Valid=1672, Invalid=16960, Unknown=0, NotChecked=0, Total=18632 [2021-08-12 15:56:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2021-08-12 15:56:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 9529. [2021-08-12 15:56:44,799 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-08-12 15:56:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9529 states to 9529 states and 24363 transitions. [2021-08-12 15:56:44,874 INFO L78 Accepts]: Start accepts. Automaton has 9529 states and 24363 transitions. Word has length 184 [2021-08-12 15:56:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:56:44,875 INFO L482 AbstractCegarLoop]: Abstraction has 9529 states and 24363 transitions. [2021-08-12 15:56:44,875 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-08-12 15:56:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9529 states and 24363 transitions. [2021-08-12 15:56:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:56:44,883 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:56:44,884 INFO L550 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-08-12 15:56:44,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-12 15:56:44,884 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:56:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:56:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1807828059, now seen corresponding path program 8 times [2021-08-12 15:56:44,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:56:44,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520829027] [2021-08-12 15:56:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:56:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:56:45,406 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:56:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:56:49,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:56:49,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520829027] [2021-08-12 15:56:49,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520829027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:56:49,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:56:49,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:56:49,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300136365] [2021-08-12 15:56:49,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:56:49,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:56:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:56:49,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:56:49,357 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-08-12 15:56:52,337 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:56:53,001 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:56:54,424 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-08-12 15:56:55,002 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-08-12 15:56:55,569 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-08-12 15:56:58,990 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:56:59,249 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:56:59,592 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:57:01,590 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:57:03,966 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:57:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:57:08,127 INFO L93 Difference]: Finished difference Result 13601 states and 34975 transitions. [2021-08-12 15:57:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-08-12 15:57:08,128 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-08-12 15:57:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:57:08,208 INFO L225 Difference]: With dead ends: 13601 [2021-08-12 15:57:08,208 INFO L226 Difference]: Without dead ends: 13041 [2021-08-12 15:57:08,214 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5365 ImplicationChecksByTransitivity, 14559.1ms TimeCoverageRelationStatistics Valid=1709, Invalid=17751, Unknown=0, NotChecked=0, Total=19460 [2021-08-12 15:57:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13041 states. [2021-08-12 15:57:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13041 to 9542. [2021-08-12 15:57:08,777 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-08-12 15:57:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 24398 transitions. [2021-08-12 15:57:08,864 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 24398 transitions. Word has length 184 [2021-08-12 15:57:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:57:08,864 INFO L482 AbstractCegarLoop]: Abstraction has 9542 states and 24398 transitions. [2021-08-12 15:57:08,865 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-08-12 15:57:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 24398 transitions. [2021-08-12 15:57:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:57:08,874 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:57:08,874 INFO L550 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-08-12 15:57:08,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-12 15:57:08,874 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:57:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:57:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash -92526133, now seen corresponding path program 9 times [2021-08-12 15:57:08,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:57:08,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361212229] [2021-08-12 15:57:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:57:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:57:09,406 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:57:09,545 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:57:10,085 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-08-12 15:57:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:57:13,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:57:13,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361212229] [2021-08-12 15:57:13,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361212229] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:57:13,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:57:13,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:57:13,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559139262] [2021-08-12 15:57:13,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:57:13,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:57:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:57:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:57:13,592 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-08-12 15:57:16,569 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:57:17,110 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:57:18,683 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-08-12 15:57:19,040 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-08-12 15:57:20,027 WARN L205 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 81 [2021-08-12 15:57:20,922 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 79 [2021-08-12 15:57:24,223 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:57:24,492 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:57:24,814 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:57:27,269 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:57:29,801 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:57:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:57:33,641 INFO L93 Difference]: Finished difference Result 14821 states and 38159 transitions. [2021-08-12 15:57:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-08-12 15:57:33,642 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-08-12 15:57:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:57:33,726 INFO L225 Difference]: With dead ends: 14821 [2021-08-12 15:57:33,726 INFO L226 Difference]: Without dead ends: 14261 [2021-08-12 15:57:33,731 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5271 ImplicationChecksByTransitivity, 15313.8ms TimeCoverageRelationStatistics Valid=1783, Invalid=17399, Unknown=0, NotChecked=0, Total=19182 [2021-08-12 15:57:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2021-08-12 15:57:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 9646. [2021-08-12 15:57:34,346 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-08-12 15:57:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 24678 transitions. [2021-08-12 15:57:34,437 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 24678 transitions. Word has length 184 [2021-08-12 15:57:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:57:34,437 INFO L482 AbstractCegarLoop]: Abstraction has 9646 states and 24678 transitions. [2021-08-12 15:57:34,437 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-08-12 15:57:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 24678 transitions. [2021-08-12 15:57:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:57:34,447 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:57:34,447 INFO L550 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-08-12 15:57:34,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-12 15:57:34,447 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:57:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:57:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 787291659, now seen corresponding path program 10 times [2021-08-12 15:57:34,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:57:34,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713201365] [2021-08-12 15:57:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:57:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:57:34,992 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:57:38,759 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2021-08-12 15:57:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:57:39,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:57:39,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713201365] [2021-08-12 15:57:39,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713201365] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:57:39,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:57:39,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:57:39,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804041037] [2021-08-12 15:57:39,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:57:39,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:57:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:57:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:57:39,229 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-08-12 15:57:41,650 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:57:41,958 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:57:43,434 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2021-08-12 15:57:43,932 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2021-08-12 15:57:44,376 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 73 [2021-08-12 15:57:47,743 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:57:48,157 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:57:48,435 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:57:50,685 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:57:53,458 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:57:55,455 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:57:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:57:57,221 INFO L93 Difference]: Finished difference Result 14749 states and 37923 transitions. [2021-08-12 15:57:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-08-12 15:57:57,222 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-08-12 15:57:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:57:57,315 INFO L225 Difference]: With dead ends: 14749 [2021-08-12 15:57:57,315 INFO L226 Difference]: Without dead ends: 14189 [2021-08-12 15:57:57,322 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 14266.4ms TimeCoverageRelationStatistics Valid=1893, Invalid=17289, Unknown=0, NotChecked=0, Total=19182 [2021-08-12 15:57:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2021-08-12 15:57:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 9659. [2021-08-12 15:57:57,942 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-08-12 15:57:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 24713 transitions. [2021-08-12 15:57:58,038 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 24713 transitions. Word has length 184 [2021-08-12 15:57:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:57:58,038 INFO L482 AbstractCegarLoop]: Abstraction has 9659 states and 24713 transitions. [2021-08-12 15:57:58,039 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-08-12 15:57:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 24713 transitions. [2021-08-12 15:57:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:57:58,048 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:57:58,048 INFO L550 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-08-12 15:57:58,048 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-12 15:57:58,049 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:57:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:57:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1611136987, now seen corresponding path program 11 times [2021-08-12 15:57:58,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:57:58,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807528708] [2021-08-12 15:57:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:57:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:57:58,486 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:57:58,609 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:57:58,887 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-08-12 15:58:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:58:02,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:58:02,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807528708] [2021-08-12 15:58:02,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807528708] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:58:02,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:58:02,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:58:02,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877726100] [2021-08-12 15:58:02,466 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:58:02,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:58:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:58:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:58:02,467 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-08-12 15:58:04,793 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2021-08-12 15:58:05,132 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 15:58:05,696 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:58:06,267 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:58:10,585 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:58:10,973 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:58:11,517 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:58:14,080 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:58:17,270 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:58:19,562 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:58:20,509 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 15:58:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:58:21,711 INFO L93 Difference]: Finished difference Result 14453 states and 37137 transitions. [2021-08-12 15:58:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-12 15:58:21,711 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-08-12 15:58:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:58:21,793 INFO L225 Difference]: With dead ends: 14453 [2021-08-12 15:58:21,794 INFO L226 Difference]: Without dead ends: 13893 [2021-08-12 15:58:21,798 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 12877.5ms TimeCoverageRelationStatistics Valid=1574, Invalid=14938, Unknown=0, NotChecked=0, Total=16512 [2021-08-12 15:58:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2021-08-12 15:58:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 9698. [2021-08-12 15:58:22,754 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-08-12 15:58:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 24818 transitions. [2021-08-12 15:58:22,852 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 24818 transitions. Word has length 184 [2021-08-12 15:58:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:58:22,853 INFO L482 AbstractCegarLoop]: Abstraction has 9698 states and 24818 transitions. [2021-08-12 15:58:22,853 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-08-12 15:58:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 24818 transitions. [2021-08-12 15:58:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:58:22,863 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:58:22,863 INFO L550 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-08-12 15:58:22,863 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-12 15:58:22,863 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:58:22,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:58:22,863 INFO L82 PathProgramCache]: Analyzing trace with hash 481639115, now seen corresponding path program 12 times [2021-08-12 15:58:22,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:58:22,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713092969] [2021-08-12 15:58:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:58:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:58:23,488 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:58:24,837 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 15:58:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:58:27,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:58:27,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713092969] [2021-08-12 15:58:27,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713092969] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:58:27,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:58:27,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:58:27,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079497191] [2021-08-12 15:58:27,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:58:27,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:58:27,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:58:27,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:58:27,684 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-08-12 15:58:30,913 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:58:31,313 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:58:34,488 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:58:34,748 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:58:35,047 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:58:37,935 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:58:40,905 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:58:43,357 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:58:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:58:45,242 INFO L93 Difference]: Finished difference Result 14421 states and 37065 transitions. [2021-08-12 15:58:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-12 15:58:45,242 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-08-12 15:58:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:58:45,319 INFO L225 Difference]: With dead ends: 14421 [2021-08-12 15:58:45,319 INFO L226 Difference]: Without dead ends: 13861 [2021-08-12 15:58:45,322 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4483 ImplicationChecksByTransitivity, 12785.4ms TimeCoverageRelationStatistics Valid=1574, Invalid=14938, Unknown=0, NotChecked=0, Total=16512 [2021-08-12 15:58:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13861 states. [2021-08-12 15:58:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13861 to 9711. [2021-08-12 15:58:45,968 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-08-12 15:58:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 24853 transitions. [2021-08-12 15:58:46,057 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 24853 transitions. Word has length 184 [2021-08-12 15:58:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:58:46,058 INFO L482 AbstractCegarLoop]: Abstraction has 9711 states and 24853 transitions. [2021-08-12 15:58:46,058 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-08-12 15:58:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 24853 transitions. [2021-08-12 15:58:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:58:46,067 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:58:46,067 INFO L550 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-08-12 15:58:46,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-12 15:58:46,067 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:58:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:58:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash 317652773, now seen corresponding path program 13 times [2021-08-12 15:58:46,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:58:46,068 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88631670] [2021-08-12 15:58:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:58:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:58:46,596 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:58:48,058 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 15:58:49,106 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-08-12 15:58:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:58:50,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:58:50,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88631670] [2021-08-12 15:58:50,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88631670] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:58:50,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:58:50,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:58:50,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302965799] [2021-08-12 15:58:50,962 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:58:50,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:58:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:58:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:58:50,962 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-08-12 15:58:53,087 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2021-08-12 15:58:53,375 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 15:58:53,757 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:58:54,156 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:58:55,392 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-08-12 15:58:56,770 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 15:58:57,465 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-08-12 15:58:57,744 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 15:58:58,020 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:59:00,521 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:59:03,215 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:59:04,556 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-08-12 15:59:05,527 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 15:59:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:59:07,267 INFO L93 Difference]: Finished difference Result 13981 states and 35935 transitions. [2021-08-12 15:59:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-08-12 15:59:07,268 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-08-12 15:59:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:59:07,346 INFO L225 Difference]: With dead ends: 13981 [2021-08-12 15:59:07,346 INFO L226 Difference]: Without dead ends: 13421 [2021-08-12 15:59:07,351 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 13122.7ms TimeCoverageRelationStatistics Valid=1544, Invalid=14712, Unknown=0, NotChecked=0, Total=16256 [2021-08-12 15:59:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13421 states. [2021-08-12 15:59:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13421 to 9724. [2021-08-12 15:59:07,988 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-08-12 15:59:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 24888 transitions. [2021-08-12 15:59:08,073 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 24888 transitions. Word has length 184 [2021-08-12 15:59:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:59:08,073 INFO L482 AbstractCegarLoop]: Abstraction has 9724 states and 24888 transitions. [2021-08-12 15:59:08,073 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-08-12 15:59:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 24888 transitions. [2021-08-12 15:59:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:59:08,082 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:59:08,082 INFO L550 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-08-12 15:59:08,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-12 15:59:08,083 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:59:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:59:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash 421691335, now seen corresponding path program 14 times [2021-08-12 15:59:08,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:59:08,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060354404] [2021-08-12 15:59:08,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:59:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:59:08,466 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-08-12 15:59:08,727 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:59:10,004 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 15:59:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:59:12,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:59:12,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060354404] [2021-08-12 15:59:12,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060354404] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:59:12,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:59:12,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:59:12,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099064348] [2021-08-12 15:59:12,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:59:12,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:59:12,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:59:12,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:59:12,459 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-08-12 15:59:14,574 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 15:59:15,122 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:59:15,650 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:59:17,215 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-08-12 15:59:18,452 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 15:59:18,722 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-08-12 15:59:19,009 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-08-12 15:59:20,016 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:59:22,620 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:59:27,686 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-08-12 15:59:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:59:28,964 INFO L93 Difference]: Finished difference Result 13941 states and 35845 transitions. [2021-08-12 15:59:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-12 15:59:28,965 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-08-12 15:59:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:59:29,050 INFO L225 Difference]: With dead ends: 13941 [2021-08-12 15:59:29,050 INFO L226 Difference]: Without dead ends: 13381 [2021-08-12 15:59:29,056 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 12490.9ms TimeCoverageRelationStatistics Valid=1575, Invalid=14937, Unknown=0, NotChecked=0, Total=16512 [2021-08-12 15:59:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2021-08-12 15:59:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 9854. [2021-08-12 15:59:29,747 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-08-12 15:59:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 25238 transitions. [2021-08-12 15:59:29,841 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 25238 transitions. Word has length 184 [2021-08-12 15:59:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:59:29,842 INFO L482 AbstractCegarLoop]: Abstraction has 9854 states and 25238 transitions. [2021-08-12 15:59:29,842 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-08-12 15:59:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 25238 transitions. [2021-08-12 15:59:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:59:29,852 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:59:29,852 INFO L550 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-08-12 15:59:29,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-12 15:59:29,852 INFO L430 AbstractCegarLoop]: === Iteration 31 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:59:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:59:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1697699831, now seen corresponding path program 15 times [2021-08-12 15:59:29,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:59:29,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405996830] [2021-08-12 15:59:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:59:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:59:30,357 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:59:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:59:34,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:59:34,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405996830] [2021-08-12 15:59:34,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405996830] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:59:34,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:59:34,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:59:34,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883334965] [2021-08-12 15:59:34,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:59:34,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:59:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:59:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:59:34,716 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-08-12 15:59:37,079 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 15:59:37,531 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 15:59:40,367 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 15:59:40,662 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-08-12 15:59:40,945 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-08-12 15:59:42,028 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 15:59:45,180 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 15:59:48,216 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 15:59:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 15:59:52,682 INFO L93 Difference]: Finished difference Result 15895 states and 40859 transitions. [2021-08-12 15:59:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-08-12 15:59:52,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-08-12 15:59:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 15:59:52,763 INFO L225 Difference]: With dead ends: 15895 [2021-08-12 15:59:52,763 INFO L226 Difference]: Without dead ends: 15335 [2021-08-12 15:59:52,768 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4639 ImplicationChecksByTransitivity, 12873.9ms TimeCoverageRelationStatistics Valid=1608, Invalid=15422, Unknown=0, NotChecked=0, Total=17030 [2021-08-12 15:59:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15335 states. [2021-08-12 15:59:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15335 to 9958. [2021-08-12 15:59:53,469 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-08-12 15:59:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 25531 transitions. [2021-08-12 15:59:53,784 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 25531 transitions. Word has length 184 [2021-08-12 15:59:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 15:59:53,785 INFO L482 AbstractCegarLoop]: Abstraction has 9958 states and 25531 transitions. [2021-08-12 15:59:53,785 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-08-12 15:59:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 25531 transitions. [2021-08-12 15:59:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 15:59:53,794 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 15:59:53,794 INFO L550 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-08-12 15:59:53,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-12 15:59:53,794 INFO L430 AbstractCegarLoop]: === Iteration 32 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 15:59:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 15:59:53,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2078488249, now seen corresponding path program 16 times [2021-08-12 15:59:53,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 15:59:53,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668223327] [2021-08-12 15:59:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 15:59:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 15:59:54,215 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-08-12 15:59:54,384 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 15:59:54,586 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-08-12 15:59:54,754 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-08-12 15:59:54,895 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-08-12 15:59:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 15:59:58,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 15:59:58,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668223327] [2021-08-12 15:59:58,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668223327] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 15:59:58,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 15:59:58,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 15:59:58,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213150150] [2021-08-12 15:59:58,400 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 15:59:58,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 15:59:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 15:59:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 15:59:58,400 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-08-12 16:00:01,251 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 16:00:01,878 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 16:00:02,515 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 16:00:04,361 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-08-12 16:00:05,833 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 16:00:06,138 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-08-12 16:00:06,460 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-08-12 16:00:07,803 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 16:00:08,001 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2021-08-12 16:00:17,669 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-08-12 16:00:18,144 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 16:00:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 16:00:19,118 INFO L93 Difference]: Finished difference Result 15807 states and 40645 transitions. [2021-08-12 16:00:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-08-12 16:00:19,119 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-08-12 16:00:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 16:00:19,220 INFO L225 Difference]: With dead ends: 15807 [2021-08-12 16:00:19,220 INFO L226 Difference]: Without dead ends: 15247 [2021-08-12 16:00:19,240 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 14006.7ms TimeCoverageRelationStatistics Valid=1620, Invalid=15672, Unknown=0, NotChecked=0, Total=17292 [2021-08-12 16:00:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15247 states. [2021-08-12 16:00:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15247 to 9997. [2021-08-12 16:00:20,010 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-08-12 16:00:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 25636 transitions. [2021-08-12 16:00:20,115 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 25636 transitions. Word has length 184 [2021-08-12 16:00:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 16:00:20,116 INFO L482 AbstractCegarLoop]: Abstraction has 9997 states and 25636 transitions. [2021-08-12 16:00:20,116 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-08-12 16:00:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 25636 transitions. [2021-08-12 16:00:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 16:00:20,126 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 16:00:20,127 INFO L550 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-08-12 16:00:20,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-12 16:00:20,127 INFO L430 AbstractCegarLoop]: === Iteration 33 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 16:00:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 16:00:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1942160421, now seen corresponding path program 17 times [2021-08-12 16:00:20,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 16:00:20,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228869033] [2021-08-12 16:00:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 16:00:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 16:00:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 16:00:24,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 16:00:24,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228869033] [2021-08-12 16:00:24,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228869033] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 16:00:24,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 16:00:24,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 16:00:24,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217776844] [2021-08-12 16:00:24,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 16:00:24,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 16:00:24,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 16:00:24,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 16:00:24,310 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-08-12 16:00:25,543 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-08-12 16:00:26,740 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 16:00:27,000 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 16:00:29,668 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 16:00:29,991 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-08-12 16:00:30,331 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-08-12 16:00:31,531 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 16:00:33,119 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2021-08-12 16:00:35,993 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 16:00:39,442 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-08-12 16:00:42,123 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-08-12 16:00:43,177 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 16:00:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 16:00:44,212 INFO L93 Difference]: Finished difference Result 15767 states and 40555 transitions. [2021-08-12 16:00:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-08-12 16:00:44,213 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-08-12 16:00:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 16:00:44,297 INFO L225 Difference]: With dead ends: 15767 [2021-08-12 16:00:44,297 INFO L226 Difference]: Without dead ends: 15207 [2021-08-12 16:00:44,303 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4806 ImplicationChecksByTransitivity, 12733.3ms TimeCoverageRelationStatistics Valid=1635, Invalid=15921, Unknown=0, NotChecked=0, Total=17556 [2021-08-12 16:00:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2021-08-12 16:00:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 10023. [2021-08-12 16:00:45,079 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-08-12 16:00:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 25706 transitions. [2021-08-12 16:00:45,169 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 25706 transitions. Word has length 184 [2021-08-12 16:00:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 16:00:45,169 INFO L482 AbstractCegarLoop]: Abstraction has 10023 states and 25706 transitions. [2021-08-12 16:00:45,170 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-08-12 16:00:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 25706 transitions. [2021-08-12 16:00:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 16:00:45,179 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 16:00:45,179 INFO L550 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-08-12 16:00:45,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-12 16:00:45,179 INFO L430 AbstractCegarLoop]: === Iteration 34 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 16:00:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 16:00:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 956827493, now seen corresponding path program 18 times [2021-08-12 16:00:45,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 16:00:45,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022457507] [2021-08-12 16:00:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 16:00:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 16:00:45,931 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 16:00:47,167 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 16:00:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 16:00:49,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 16:00:49,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022457507] [2021-08-12 16:00:49,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022457507] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 16:00:49,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 16:00:49,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 16:00:49,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031613218] [2021-08-12 16:00:49,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 16:00:49,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 16:00:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 16:00:49,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 16:00:49,758 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-08-12 16:00:52,154 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2021-08-12 16:00:52,577 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2021-08-12 16:00:52,937 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-08-12 16:01:03,787 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-08-12 16:01:04,476 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-08-12 16:01:05,150 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-08-12 16:01:05,466 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-08-12 16:01:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 16:01:08,932 INFO L93 Difference]: Finished difference Result 15789 states and 40615 transitions. [2021-08-12 16:01:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-08-12 16:01:08,933 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-08-12 16:01:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 16:01:09,042 INFO L225 Difference]: With dead ends: 15789 [2021-08-12 16:01:09,042 INFO L226 Difference]: Without dead ends: 15229 [2021-08-12 16:01:09,051 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4993 ImplicationChecksByTransitivity, 12868.4ms TimeCoverageRelationStatistics Valid=1665, Invalid=16695, Unknown=0, NotChecked=0, Total=18360 [2021-08-12 16:01:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15229 states. [2021-08-12 16:01:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15229 to 10036. [2021-08-12 16:01:09,974 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-08-12 16:01:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 25741 transitions. [2021-08-12 16:01:10,059 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 25741 transitions. Word has length 184 [2021-08-12 16:01:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 16:01:10,060 INFO L482 AbstractCegarLoop]: Abstraction has 10036 states and 25741 transitions. [2021-08-12 16:01:10,060 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-08-12 16:01:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 25741 transitions. [2021-08-12 16:01:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 16:01:10,070 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 16:01:10,070 INFO L550 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-08-12 16:01:10,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-12 16:01:10,070 INFO L430 AbstractCegarLoop]: === Iteration 35 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 16:01:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 16:01:10,070 INFO L82 PathProgramCache]: Analyzing trace with hash 913127371, now seen corresponding path program 19 times [2021-08-12 16:01:10,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 16:01:10,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091540427] [2021-08-12 16:01:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 16:01:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 16:01:10,568 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 16:01:11,787 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 16:01:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 16:01:14,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 16:01:14,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091540427] [2021-08-12 16:01:14,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091540427] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 16:01:14,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 16:01:14,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 16:01:14,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226507141] [2021-08-12 16:01:14,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 16:01:14,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 16:01:14,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 16:01:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 16:01:14,365 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-08-12 16:01:17,293 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 16:01:17,835 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 16:01:20,522 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 16:01:20,808 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-08-12 16:01:21,093 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-08-12 16:01:22,153 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 16:01:23,549 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2021-08-12 16:01:24,344 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2021-08-12 16:01:26,324 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2021-08-12 16:01:26,825 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 16:01:30,869 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-08-12 16:01:33,541 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 16:01:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 16:01:34,572 INFO L93 Difference]: Finished difference Result 16919 states and 43555 transitions. [2021-08-12 16:01:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-08-12 16:01:34,573 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-08-12 16:01:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 16:01:34,669 INFO L225 Difference]: With dead ends: 16919 [2021-08-12 16:01:34,672 INFO L226 Difference]: Without dead ends: 16359 [2021-08-12 16:01:34,677 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5065 ImplicationChecksByTransitivity, 13610.2ms TimeCoverageRelationStatistics Valid=1693, Invalid=16667, Unknown=0, NotChecked=0, Total=18360 [2021-08-12 16:01:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2021-08-12 16:01:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 10348. [2021-08-12 16:01:35,690 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-08-12 16:01:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-08-12 16:01:35,776 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-08-12 16:01:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 16:01:35,777 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-08-12 16:01:35,777 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-08-12 16:01:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-08-12 16:01:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 16:01:35,787 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 16:01:35,787 INFO L550 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-08-12 16:01:35,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-12 16:01:35,787 INFO L430 AbstractCegarLoop]: === Iteration 36 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 16:01:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 16:01:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1490581689, now seen corresponding path program 20 times [2021-08-12 16:01:35,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 16:01:35,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375252120] [2021-08-12 16:01:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 16:01:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 16:01:36,407 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-08-12 16:01:37,839 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-08-12 16:01:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 16:01:40,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 16:01:40,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375252120] [2021-08-12 16:01:40,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375252120] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 16:01:40,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 16:01:40,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-08-12 16:01:40,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779957022] [2021-08-12 16:01:40,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-08-12 16:01:40,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 16:01:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-12 16:01:40,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-08-12 16:01:40,225 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-08-12 16:01:41,250 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-08-12 16:01:42,290 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-08-12 16:01:42,553 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2021-08-12 16:01:44,983 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-08-12 16:01:45,292 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-08-12 16:01:46,166 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-08-12 16:01:46,460 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-08-12 16:01:48,182 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-08-12 16:01:49,732 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-08-12 16:01:52,522 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-08-12 16:01:56,307 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-08-12 16:01:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 16:01:57,231 INFO L93 Difference]: Finished difference Result 14903 states and 38423 transitions. [2021-08-12 16:01:57,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-08-12 16:01:57,232 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-08-12 16:01:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 16:01:57,326 INFO L225 Difference]: With dead ends: 14903 [2021-08-12 16:01:57,326 INFO L226 Difference]: Without dead ends: 14343 [2021-08-12 16:01:57,332 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4570 ImplicationChecksByTransitivity, 11952.8ms TimeCoverageRelationStatistics Valid=1596, Invalid=15174, Unknown=0, NotChecked=0, Total=16770 [2021-08-12 16:01:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2021-08-12 16:01:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 10348. [2021-08-12 16:01:58,189 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-08-12 16:01:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-08-12 16:01:58,288 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-08-12 16:01:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 16:01:58,288 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-08-12 16:01:58,288 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-08-12 16:01:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-08-12 16:01:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-12 16:01:58,298 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 16:01:58,298 INFO L550 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-08-12 16:01:58,299 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-12 16:01:58,299 INFO L430 AbstractCegarLoop]: === Iteration 37 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 16:01:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 16:01:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash 473197579, now seen corresponding path program 21 times [2021-08-12 16:01:58,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 16:01:58,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811457402] [2021-08-12 16:01:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 16:01:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2021-08-12 16:02:14,362 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,366 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,366 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,367 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,368 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,368 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,369 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,369 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,370 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,370 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,371 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,371 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,372 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,372 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,373 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,374 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,374 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,375 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,375 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,375 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,375 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,376 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,376 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,376 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,376 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,377 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,377 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,377 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,378 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,378 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,378 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,379 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,379 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,379 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,379 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,380 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,380 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,380 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,380 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,380 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,381 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,381 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,381 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,381 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,381 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-08-12 16:02:14,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-12 16:02:14,383 WARN L547 AbstractCegarLoop]: Verification canceled [2021-08-12 16:02:14,385 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 16:02:14,386 WARN L188 ceAbstractionStarter]: Timeout [2021-08-12 16:02:14,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 04:02:14 BasicIcfg [2021-08-12 16:02:14,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 16:02:14,387 INFO L168 Benchmark]: Toolchain (without parser) took 547773.09 ms. Allocated memory was 233.8 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 197.7 MB in the beginning and 3.6 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 8.0 GB. [2021-08-12 16:02:14,387 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 233.8 MB. Free memory is still 216.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 16:02:14,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.04 ms. Allocated memory is still 233.8 MB. Free memory was 197.5 MB in the beginning and 170.0 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2021-08-12 16:02:14,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.38 ms. Allocated memory is still 233.8 MB. Free memory was 170.0 MB in the beginning and 167.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 16:02:14,387 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 233.8 MB. Free memory was 167.3 MB in the beginning and 164.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 16:02:14,387 INFO L168 Benchmark]: RCFGBuilder took 895.90 ms. Allocated memory is still 233.8 MB. Free memory was 164.7 MB in the beginning and 117.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2021-08-12 16:02:14,387 INFO L168 Benchmark]: TraceAbstraction took 546344.70 ms. Allocated memory was 233.8 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 116.5 MB in the beginning and 3.6 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 8.0 GB. [2021-08-12 16:02:14,388 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.13 ms. Allocated memory is still 233.8 MB. Free memory is still 216.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 457.04 ms. Allocated memory is still 233.8 MB. Free memory was 197.5 MB in the beginning and 170.0 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 37.38 ms. Allocated memory is still 233.8 MB. Free memory was 170.0 MB in the beginning and 167.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 233.8 MB. Free memory was 167.3 MB in the beginning and 164.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 895.90 ms. Allocated memory is still 233.8 MB. Free memory was 164.7 MB in the beginning and 117.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 546344.70 ms. Allocated memory was 233.8 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 116.5 MB in the beginning and 3.6 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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. - 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. - 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: 546129.9ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 342.8ms, AutomataDifference: 402105.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1246.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 14701 SDtfs, 75663 SDslu, 297489 SDs, 0 SdLazy, 145162 SolverSat, 4018 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115492.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3785 GetRequests, 494 SyntacticMatches, 168 SemanticMatches, 3123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101250 ImplicationChecksByTransitivity, 289329.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 1954, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 23775.5ms AutomataMinimizationTime, 36 MinimizatonAttempts, 105502 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 117.7ms SsaConstructionTime, 841.2ms SatisfiabilityAnalysisTime, 98818.4ms 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