/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 21:26:56,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 21:26:56,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 21:26:56,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 21:26:56,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 21:26:56,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 21:26:56,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 21:26:56,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 21:26:56,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 21:26:56,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 21:26:56,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 21:26:56,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 21:26:56,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 21:26:56,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 21:26:56,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 21:26:56,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 21:26:56,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 21:26:56,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 21:26:56,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 21:26:56,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 21:26:56,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 21:26:56,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 21:26:56,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 21:26:56,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 21:26:56,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 21:26:56,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 21:26:56,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 21:26:56,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 21:26:56,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 21:26:56,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 21:26:56,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 21:26:56,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 21:26:56,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 21:26:56,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 21:26:56,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 21:26:56,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 21:26:56,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 21:26:56,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 21:26:56,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 21:26:56,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 21:26:56,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 21:26:56,847 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-06-04 21:26:56,879 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 21:26:56,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 21:26:56,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 21:26:56,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 21:26:56,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 21:26:56,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 21:26:56,882 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 21:26:56,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 21:26:56,883 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 21:26:56,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 21:26:56,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 21:26:56,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 21:26:56,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 21:26:56,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 21:26:56,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 21:26:56,884 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 21:26:56,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 21:26:56,885 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 21:26:56,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 21:26:56,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 21:26:56,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 21:26:56,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 21:26:56,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 21:26:56,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 21:26:56,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 21:26:56,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 21:26:56,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 21:26:56,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 21:26:56,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 21:26:56,887 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 21:26:56,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 21:26:56,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-04 21:26:57,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 21:26:57,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 21:26:57,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 21:26:57,266 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 21:26:57,267 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 21:26:57,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2021-06-04 21:26:57,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7c212e2/f23642d74e4d4888bd1f251b2a1b6e60/FLAG686f833cd [2021-06-04 21:26:57,961 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 21:26:57,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2021-06-04 21:26:57,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7c212e2/f23642d74e4d4888bd1f251b2a1b6e60/FLAG686f833cd [2021-06-04 21:26:58,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7c212e2/f23642d74e4d4888bd1f251b2a1b6e60 [2021-06-04 21:26:58,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 21:26:58,339 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 21:26:58,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 21:26:58,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 21:26:58,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 21:26:58,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:58,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46928125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58, skipping insertion in model container [2021-06-04 21:26:58,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:58,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 21:26:58,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 21:26:58,775 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_longer.i[43296,43309] [2021-06-04 21:26:58,779 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_longer.i[43503,43516] [2021-06-04 21:26:58,781 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_longer.i[43783,43796] [2021-06-04 21:26:58,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:26:58,792 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 21:26:58,829 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_longer.i[43296,43309] [2021-06-04 21:26:58,831 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_longer.i[43503,43516] [2021-06-04 21:26:58,833 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_longer.i[43783,43796] [2021-06-04 21:26:58,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:26:58,945 INFO L208 MainTranslator]: Completed translation [2021-06-04 21:26:58,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58 WrapperNode [2021-06-04 21:26:58,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 21:26:58,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 21:26:58,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 21:26:58,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 21:26:58,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:58,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:58,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 21:26:58,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 21:26:58,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 21:26:58,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 21:26:58,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:58,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:59,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:59,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:59,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:59,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:59,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... [2021-06-04 21:26:59,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 21:26:59,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 21:26:59,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 21:26:59,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 21:26:59,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 21:26:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-04 21:26:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-04 21:26:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-04 21:26:59,121 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-04 21:26:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 21:26:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 21:26:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-04 21:26:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 21:26:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-04 21:26:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 21:26:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 21:26:59,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 21:26:59,123 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 21:26:59,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 21:26:59,691 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-04 21:26:59,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:26:59 BoogieIcfgContainer [2021-06-04 21:26:59,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 21:26:59,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 21:26:59,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 21:26:59,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 21:26:59,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 09:26:58" (1/3) ... [2021-06-04 21:26:59,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2fb571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:26:59, skipping insertion in model container [2021-06-04 21:26:59,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:26:58" (2/3) ... [2021-06-04 21:26:59,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2fb571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:26:59, skipping insertion in model container [2021-06-04 21:26:59,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:26:59" (3/3) ... [2021-06-04 21:26:59,699 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2021-06-04 21:26:59,704 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 21:26:59,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 21:26:59,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-04 21:26:59,705 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 21:26:59,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,750 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,751 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,752 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,753 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,754 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,755 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,756 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,757 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,758 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,759 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,760 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,761 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,764 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,765 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,766 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,767 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,768 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,769 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,770 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,771 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,772 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,773 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,774 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,775 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,776 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,777 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,778 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,779 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,780 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,781 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,782 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,782 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,782 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,782 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,782 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,782 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,787 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,788 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,790 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,793 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,795 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,795 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,795 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,795 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,805 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,810 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,811 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,812 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,813 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,814 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,815 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,816 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,817 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,818 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,818 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,818 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,820 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,820 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,820 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,820 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,820 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,821 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,822 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,823 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,824 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,824 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,828 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,828 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,828 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,829 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,831 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,831 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:26:59,866 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-04 21:26:59,882 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 21:26:59,897 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 21:26:59,898 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 21:26:59,898 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 21:26:59,898 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 21:26:59,898 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 21:26:59,898 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 21:26:59,898 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 21:26:59,898 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 21:26:59,912 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-04 21:27:01,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-04 21:27:01,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:01,310 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:01,311 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 617310073, now seen corresponding path program 1 times [2021-06-04 21:27:01,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:01,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154163144] [2021-06-04 21:27:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:01,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:01,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154163144] [2021-06-04 21:27:01,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154163144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:01,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:01,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 21:27:01,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295754249] [2021-06-04 21:27:01,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-04 21:27:01,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-04 21:27:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-04 21:27:01,663 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:01,974 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-04 21:27:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-04 21:27:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-04 21:27:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:02,129 INFO L225 Difference]: With dead ends: 23006 [2021-06-04 21:27:02,130 INFO L226 Difference]: Without dead ends: 22283 [2021-06-04 21:27:02,131 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-04 21:27:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2021-06-04 21:27:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22283. [2021-06-04 21:27:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22283 states, 22280 states have (on average 2.798653500897666) internal successors, (62354), 22282 states have internal predecessors, (62354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22283 states to 22283 states and 62354 transitions. [2021-06-04 21:27:03,222 INFO L78 Accepts]: Start accepts. Automaton has 22283 states and 62354 transitions. Word has length 48 [2021-06-04 21:27:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:03,223 INFO L482 AbstractCegarLoop]: Abstraction has 22283 states and 62354 transitions. [2021-06-04 21:27:03,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 62354 transitions. [2021-06-04 21:27:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-04 21:27:03,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:03,239 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:03,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 21:27:03,239 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -383819529, now seen corresponding path program 1 times [2021-06-04 21:27:03,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:03,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564750195] [2021-06-04 21:27:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:03,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:03,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564750195] [2021-06-04 21:27:03,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564750195] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:03,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:03,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:27:03,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202948617] [2021-06-04 21:27:03,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:27:03,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:03,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:27:03,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:27:03,709 INFO L87 Difference]: Start difference. First operand 22283 states and 62354 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:04,496 INFO L93 Difference]: Finished difference Result 22280 states and 62350 transitions. [2021-06-04 21:27:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:27:04,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-04 21:27:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:04,557 INFO L225 Difference]: With dead ends: 22280 [2021-06-04 21:27:04,557 INFO L226 Difference]: Without dead ends: 22280 [2021-06-04 21:27:04,558 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 326.6ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:27:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2021-06-04 21:27:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 22280. [2021-06-04 21:27:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22280 states, 22277 states have (on average 2.798850832697401) internal successors, (62350), 22279 states have internal predecessors, (62350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 62350 transitions. [2021-06-04 21:27:05,494 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 62350 transitions. Word has length 83 [2021-06-04 21:27:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:05,495 INFO L482 AbstractCegarLoop]: Abstraction has 22280 states and 62350 transitions. [2021-06-04 21:27:05,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 62350 transitions. [2021-06-04 21:27:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-04 21:27:05,500 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:05,501 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:05,501 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 21:27:05,501 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1409373696, now seen corresponding path program 1 times [2021-06-04 21:27:05,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:05,502 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334528617] [2021-06-04 21:27:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:05,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:05,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334528617] [2021-06-04 21:27:05,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334528617] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:05,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:05,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:27:05,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043496807] [2021-06-04 21:27:05,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-04 21:27:05,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:05,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-04 21:27:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-04 21:27:05,621 INFO L87 Difference]: Start difference. First operand 22280 states and 62350 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:05,819 INFO L93 Difference]: Finished difference Result 22063 states and 61535 transitions. [2021-06-04 21:27:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-04 21:27:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-04 21:27:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:05,874 INFO L225 Difference]: With dead ends: 22063 [2021-06-04 21:27:05,874 INFO L226 Difference]: Without dead ends: 22063 [2021-06-04 21:27:05,875 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:27:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2021-06-04 21:27:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22063. [2021-06-04 21:27:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22063 states, 22060 states have (on average 2.7894378966455124) internal successors, (61535), 22062 states have internal predecessors, (61535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22063 states to 22063 states and 61535 transitions. [2021-06-04 21:27:06,652 INFO L78 Accepts]: Start accepts. Automaton has 22063 states and 61535 transitions. Word has length 84 [2021-06-04 21:27:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:06,654 INFO L482 AbstractCegarLoop]: Abstraction has 22063 states and 61535 transitions. [2021-06-04 21:27:06,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22063 states and 61535 transitions. [2021-06-04 21:27:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-04 21:27:06,667 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:06,668 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:06,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 21:27:06,668 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1743993907, now seen corresponding path program 1 times [2021-06-04 21:27:06,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:06,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665828359] [2021-06-04 21:27:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:06,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:06,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665828359] [2021-06-04 21:27:06,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665828359] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:06,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:06,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:27:06,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005325037] [2021-06-04 21:27:06,776 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:06,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:06,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:06,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:06,777 INFO L87 Difference]: Start difference. First operand 22063 states and 61535 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:06,845 INFO L93 Difference]: Finished difference Result 15355 states and 42187 transitions. [2021-06-04 21:27:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-04 21:27:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:06,884 INFO L225 Difference]: With dead ends: 15355 [2021-06-04 21:27:06,885 INFO L226 Difference]: Without dead ends: 15112 [2021-06-04 21:27:06,888 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2021-06-04 21:27:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 15112. [2021-06-04 21:27:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15112 states, 15110 states have (on average 2.7499007279947056) internal successors, (41551), 15111 states have internal predecessors, (41551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 41551 transitions. [2021-06-04 21:27:07,389 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 41551 transitions. Word has length 93 [2021-06-04 21:27:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:07,390 INFO L482 AbstractCegarLoop]: Abstraction has 15112 states and 41551 transitions. [2021-06-04 21:27:07,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 41551 transitions. [2021-06-04 21:27:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 21:27:07,400 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:07,400 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:07,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 21:27:07,401 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash -477175304, now seen corresponding path program 1 times [2021-06-04 21:27:07,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:07,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302738366] [2021-06-04 21:27:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:07,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:07,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302738366] [2021-06-04 21:27:07,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302738366] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:07,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:07,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-04 21:27:07,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553297162] [2021-06-04 21:27:07,461 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-04 21:27:07,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-04 21:27:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-04 21:27:07,461 INFO L87 Difference]: Start difference. First operand 15112 states and 41551 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:07,564 INFO L93 Difference]: Finished difference Result 26661 states and 73631 transitions. [2021-06-04 21:27:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-04 21:27:07,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-04 21:27:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:07,629 INFO L225 Difference]: With dead ends: 26661 [2021-06-04 21:27:07,629 INFO L226 Difference]: Without dead ends: 26571 [2021-06-04 21:27:07,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-04 21:27:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26571 states. [2021-06-04 21:27:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26571 to 15217. [2021-06-04 21:27:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15217 states, 15215 states have (on average 2.7484719027275717) internal successors, (41818), 15216 states have internal predecessors, (41818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15217 states to 15217 states and 41818 transitions. [2021-06-04 21:27:08,290 INFO L78 Accepts]: Start accepts. Automaton has 15217 states and 41818 transitions. Word has length 99 [2021-06-04 21:27:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:08,291 INFO L482 AbstractCegarLoop]: Abstraction has 15217 states and 41818 transitions. [2021-06-04 21:27:08,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15217 states and 41818 transitions. [2021-06-04 21:27:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-04 21:27:08,298 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:08,298 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:08,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 21:27:08,298 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1731505684, now seen corresponding path program 1 times [2021-06-04 21:27:08,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:08,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431220212] [2021-06-04 21:27:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:08,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:08,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431220212] [2021-06-04 21:27:08,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431220212] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:08,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:08,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-04 21:27:08,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202770532] [2021-06-04 21:27:08,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-04 21:27:08,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-04 21:27:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-04 21:27:08,663 INFO L87 Difference]: Start difference. First operand 15217 states and 41818 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:09,366 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-04 21:27:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:09,732 INFO L93 Difference]: Finished difference Result 15327 states and 42117 transitions. [2021-06-04 21:27:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 21:27:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-06-04 21:27:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:09,753 INFO L225 Difference]: With dead ends: 15327 [2021-06-04 21:27:09,753 INFO L226 Difference]: Without dead ends: 15327 [2021-06-04 21:27:09,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 851.4ms TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:27:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2021-06-04 21:27:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 15267. [2021-06-04 21:27:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15267 states, 15265 states have (on average 2.748444153291844) internal successors, (41955), 15266 states have internal predecessors, (41955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15267 states to 15267 states and 41955 transitions. [2021-06-04 21:27:10,058 INFO L78 Accepts]: Start accepts. Automaton has 15267 states and 41955 transitions. Word has length 100 [2021-06-04 21:27:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:10,059 INFO L482 AbstractCegarLoop]: Abstraction has 15267 states and 41955 transitions. [2021-06-04 21:27:10,059 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 15267 states and 41955 transitions. [2021-06-04 21:27:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-04 21:27:10,067 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:10,067 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:10,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 21:27:10,068 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 588694202, now seen corresponding path program 1 times [2021-06-04 21:27:10,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:10,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419152768] [2021-06-04 21:27:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:10,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:10,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419152768] [2021-06-04 21:27:10,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419152768] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:10,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:10,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-04 21:27:10,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929933149] [2021-06-04 21:27:10,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-04 21:27:10,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-04 21:27:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-04 21:27:10,874 INFO L87 Difference]: Start difference. First operand 15267 states and 41955 transitions. Second operand has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:12,052 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2021-06-04 21:27:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:13,217 INFO L93 Difference]: Finished difference Result 15277 states and 41997 transitions. [2021-06-04 21:27:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-04 21:27:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-06-04 21:27:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:13,239 INFO L225 Difference]: With dead ends: 15277 [2021-06-04 21:27:13,239 INFO L226 Difference]: Without dead ends: 15262 [2021-06-04 21:27:13,240 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2002.0ms TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2021-06-04 21:27:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15262 states. [2021-06-04 21:27:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15262 to 15262. [2021-06-04 21:27:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15262 states, 15260 states have (on average 2.750524246395806) internal successors, (41973), 15261 states have internal predecessors, (41973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15262 states to 15262 states and 41973 transitions. [2021-06-04 21:27:13,554 INFO L78 Accepts]: Start accepts. Automaton has 15262 states and 41973 transitions. Word has length 104 [2021-06-04 21:27:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:13,554 INFO L482 AbstractCegarLoop]: Abstraction has 15262 states and 41973 transitions. [2021-06-04 21:27:13,555 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15262 states and 41973 transitions. [2021-06-04 21:27:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-04 21:27:13,560 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:13,561 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:13,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 21:27:13,561 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1887066075, now seen corresponding path program 1 times [2021-06-04 21:27:13,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:13,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226148015] [2021-06-04 21:27:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:13,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:13,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226148015] [2021-06-04 21:27:13,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226148015] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:13,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:13,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:27:13,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954749355] [2021-06-04 21:27:13,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:27:13,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:27:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:27:13,955 INFO L87 Difference]: Start difference. First operand 15262 states and 41973 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:14,956 INFO L93 Difference]: Finished difference Result 17982 states and 49376 transitions. [2021-06-04 21:27:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-04 21:27:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-04 21:27:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:14,979 INFO L225 Difference]: With dead ends: 17982 [2021-06-04 21:27:14,979 INFO L226 Difference]: Without dead ends: 17982 [2021-06-04 21:27:14,980 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 753.5ms TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2021-06-04 21:27:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17982 states. [2021-06-04 21:27:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17982 to 16042. [2021-06-04 21:27:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16042 states, 16040 states have (on average 2.748067331670823) internal successors, (44079), 16041 states have internal predecessors, (44079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16042 states to 16042 states and 44079 transitions. [2021-06-04 21:27:15,307 INFO L78 Accepts]: Start accepts. Automaton has 16042 states and 44079 transitions. Word has length 105 [2021-06-04 21:27:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:15,308 INFO L482 AbstractCegarLoop]: Abstraction has 16042 states and 44079 transitions. [2021-06-04 21:27:15,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16042 states and 44079 transitions. [2021-06-04 21:27:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-04 21:27:15,315 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:15,315 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:15,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 21:27:15,315 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1261951723, now seen corresponding path program 2 times [2021-06-04 21:27:15,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:15,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84399893] [2021-06-04 21:27:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:16,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:16,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84399893] [2021-06-04 21:27:16,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84399893] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:16,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:16,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-04 21:27:16,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197286600] [2021-06-04 21:27:16,025 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-04 21:27:16,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-04 21:27:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:27:16,026 INFO L87 Difference]: Start difference. First operand 16042 states and 44079 transitions. Second operand has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:16,517 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2021-06-04 21:27:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:18,398 INFO L93 Difference]: Finished difference Result 18485 states and 50800 transitions. [2021-06-04 21:27:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-04 21:27:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-04 21:27:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:18,420 INFO L225 Difference]: With dead ends: 18485 [2021-06-04 21:27:18,421 INFO L226 Difference]: Without dead ends: 18260 [2021-06-04 21:27:18,421 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2177.8ms TimeCoverageRelationStatistics Valid=515, Invalid=2035, Unknown=0, NotChecked=0, Total=2550 [2021-06-04 21:27:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18260 states. [2021-06-04 21:27:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18260 to 16342. [2021-06-04 21:27:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16342 states, 16340 states have (on average 2.752264381884945) internal successors, (44972), 16341 states have internal predecessors, (44972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 44972 transitions. [2021-06-04 21:27:18,736 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 44972 transitions. Word has length 105 [2021-06-04 21:27:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:18,736 INFO L482 AbstractCegarLoop]: Abstraction has 16342 states and 44972 transitions. [2021-06-04 21:27:18,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 28 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 44972 transitions. [2021-06-04 21:27:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-04 21:27:18,742 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:18,742 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:18,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 21:27:18,742 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1732922443, now seen corresponding path program 1 times [2021-06-04 21:27:18,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:18,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667869954] [2021-06-04 21:27:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:19,522 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:19,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667869954] [2021-06-04 21:27:19,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667869954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:19,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:19,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-04 21:27:19,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017472095] [2021-06-04 21:27:19,523 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-04 21:27:19,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-04 21:27:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-04 21:27:19,524 INFO L87 Difference]: Start difference. First operand 16342 states and 44972 transitions. Second operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:21,995 INFO L93 Difference]: Finished difference Result 18538 states and 51034 transitions. [2021-06-04 21:27:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:27:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-04 21:27:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:22,017 INFO L225 Difference]: With dead ends: 18538 [2021-06-04 21:27:22,017 INFO L226 Difference]: Without dead ends: 17908 [2021-06-04 21:27:22,018 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 2109.2ms TimeCoverageRelationStatistics Valid=545, Invalid=2317, Unknown=0, NotChecked=0, Total=2862 [2021-06-04 21:27:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17908 states. [2021-06-04 21:27:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17908 to 15487. [2021-06-04 21:27:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15487 states, 15485 states have (on average 2.754342912495964) internal successors, (42651), 15486 states have internal predecessors, (42651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15487 states to 15487 states and 42651 transitions. [2021-06-04 21:27:22,299 INFO L78 Accepts]: Start accepts. Automaton has 15487 states and 42651 transitions. Word has length 109 [2021-06-04 21:27:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:22,300 INFO L482 AbstractCegarLoop]: Abstraction has 15487 states and 42651 transitions. [2021-06-04 21:27:22,300 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 15487 states and 42651 transitions. [2021-06-04 21:27:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-04 21:27:22,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:22,306 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:22,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 21:27:22,306 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1462976531, now seen corresponding path program 2 times [2021-06-04 21:27:22,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:22,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995952215] [2021-06-04 21:27:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:23,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:23,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995952215] [2021-06-04 21:27:23,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995952215] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:23,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:23,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-04 21:27:23,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974573225] [2021-06-04 21:27:23,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-04 21:27:23,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-04 21:27:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-04 21:27:23,157 INFO L87 Difference]: Start difference. First operand 15487 states and 42651 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:24,572 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2021-06-04 21:27:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:25,626 INFO L93 Difference]: Finished difference Result 15463 states and 42602 transitions. [2021-06-04 21:27:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:27:25,627 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-04 21:27:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:25,649 INFO L225 Difference]: With dead ends: 15463 [2021-06-04 21:27:25,650 INFO L226 Difference]: Without dead ends: 15373 [2021-06-04 21:27:25,651 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 2256.1ms TimeCoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:27:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15373 states. [2021-06-04 21:27:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15373 to 14527. [2021-06-04 21:27:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14527 states, 14526 states have (on average 2.7556794712928543) internal successors, (40029), 14526 states have internal predecessors, (40029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14527 states to 14527 states and 40029 transitions. [2021-06-04 21:27:25,917 INFO L78 Accepts]: Start accepts. Automaton has 14527 states and 40029 transitions. Word has length 109 [2021-06-04 21:27:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:25,917 INFO L482 AbstractCegarLoop]: Abstraction has 14527 states and 40029 transitions. [2021-06-04 21:27:25,918 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14527 states and 40029 transitions. [2021-06-04 21:27:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-06-04 21:27:25,930 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:25,931 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:25,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 21:27:25,931 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:25,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1328138375, now seen corresponding path program 1 times [2021-06-04 21:27:25,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:25,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361021217] [2021-06-04 21:27:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:25,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:25,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361021217] [2021-06-04 21:27:25,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361021217] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:25,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:25,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:27:25,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070143312] [2021-06-04 21:27:25,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:25,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:25,972 INFO L87 Difference]: Start difference. First operand 14527 states and 40029 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:26,009 INFO L93 Difference]: Finished difference Result 7076 states and 18145 transitions. [2021-06-04 21:27:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2021-06-04 21:27:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:26,018 INFO L225 Difference]: With dead ends: 7076 [2021-06-04 21:27:26,018 INFO L226 Difference]: Without dead ends: 7076 [2021-06-04 21:27:26,018 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2021-06-04 21:27:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5822. [2021-06-04 21:27:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5822 states, 5820 states have (on average 2.566838487972509) internal successors, (14939), 5821 states have internal predecessors, (14939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 14939 transitions. [2021-06-04 21:27:26,105 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 14939 transitions. Word has length 171 [2021-06-04 21:27:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:26,105 INFO L482 AbstractCegarLoop]: Abstraction has 5822 states and 14939 transitions. [2021-06-04 21:27:26,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 14939 transitions. [2021-06-04 21:27:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-04 21:27:26,113 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:26,113 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:26,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 21:27:26,114 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash 307883539, now seen corresponding path program 1 times [2021-06-04 21:27:26,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:26,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487902111] [2021-06-04 21:27:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:26,611 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-06-04 21:27:26,761 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2021-06-04 21:27:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:27,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:27,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487902111] [2021-06-04 21:27:27,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487902111] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:27,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:27,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:27:27,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606536055] [2021-06-04 21:27:27,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:27:27,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:27,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:27:27,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:27:27,320 INFO L87 Difference]: Start difference. First operand 5822 states and 14939 transitions. Second operand has 20 states, 20 states have (on average 8.6) internal successors, (172), 20 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:28,113 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2021-06-04 21:27:28,276 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 49 [2021-06-04 21:27:28,485 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2021-06-04 21:27:28,687 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 66 [2021-06-04 21:27:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:29,136 INFO L93 Difference]: Finished difference Result 5780 states and 14812 transitions. [2021-06-04 21:27:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-04 21:27:29,137 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.6) internal successors, (172), 20 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2021-06-04 21:27:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:29,144 INFO L225 Difference]: With dead ends: 5780 [2021-06-04 21:27:29,144 INFO L226 Difference]: Without dead ends: 5780 [2021-06-04 21:27:29,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2124.5ms TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2021-06-04 21:27:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2021-06-04 21:27:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5486. [2021-06-04 21:27:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 5484 states have (on average 2.5656455142231946) internal successors, (14070), 5485 states have internal predecessors, (14070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 14070 transitions. [2021-06-04 21:27:29,212 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 14070 transitions. Word has length 172 [2021-06-04 21:27:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:29,213 INFO L482 AbstractCegarLoop]: Abstraction has 5486 states and 14070 transitions. [2021-06-04 21:27:29,213 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 8.6) internal successors, (172), 20 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 14070 transitions. [2021-06-04 21:27:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:29,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:29,219 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:29,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 21:27:29,219 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -399593919, now seen corresponding path program 1 times [2021-06-04 21:27:29,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:29,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270503097] [2021-06-04 21:27:29,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:30,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:30,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270503097] [2021-06-04 21:27:30,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270503097] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:30,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:30,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-04 21:27:30,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217029789] [2021-06-04 21:27:30,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-04 21:27:30,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-04 21:27:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-04 21:27:30,002 INFO L87 Difference]: Start difference. First operand 5486 states and 14070 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:32,699 INFO L93 Difference]: Finished difference Result 7004 states and 17949 transitions. [2021-06-04 21:27:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-04 21:27:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-04 21:27:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:32,706 INFO L225 Difference]: With dead ends: 7004 [2021-06-04 21:27:32,706 INFO L226 Difference]: Without dead ends: 7004 [2021-06-04 21:27:32,707 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2475.1ms TimeCoverageRelationStatistics Valid=766, Invalid=2894, Unknown=0, NotChecked=0, Total=3660 [2021-06-04 21:27:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2021-06-04 21:27:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6390. [2021-06-04 21:27:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6390 states, 6388 states have (on average 2.5671571696931745) internal successors, (16399), 6389 states have internal predecessors, (16399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 16399 transitions. [2021-06-04 21:27:32,791 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 16399 transitions. Word has length 176 [2021-06-04 21:27:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:32,791 INFO L482 AbstractCegarLoop]: Abstraction has 6390 states and 16399 transitions. [2021-06-04 21:27:32,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 16399 transitions. [2021-06-04 21:27:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:32,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:32,799 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:32,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 21:27:32,799 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:32,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122175, now seen corresponding path program 2 times [2021-06-04 21:27:32,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:32,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678219576] [2021-06-04 21:27:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:33,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:33,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678219576] [2021-06-04 21:27:33,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678219576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:33,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:33,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-06-04 21:27:33,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991600591] [2021-06-04 21:27:33,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-04 21:27:33,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-04 21:27:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-06-04 21:27:33,981 INFO L87 Difference]: Start difference. First operand 6390 states and 16399 transitions. Second operand has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:35,306 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2021-06-04 21:27:35,943 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2021-06-04 21:27:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:38,232 INFO L93 Difference]: Finished difference Result 10790 states and 27903 transitions. [2021-06-04 21:27:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-04 21:27:38,233 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-04 21:27:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:38,243 INFO L225 Difference]: With dead ends: 10790 [2021-06-04 21:27:38,243 INFO L226 Difference]: Without dead ends: 10790 [2021-06-04 21:27:38,244 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 3781.2ms TimeCoverageRelationStatistics Valid=1102, Invalid=4300, Unknown=0, NotChecked=0, Total=5402 [2021-06-04 21:27:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10790 states. [2021-06-04 21:27:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10790 to 9241. [2021-06-04 21:27:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 9239 states have (on average 2.594436627340621) internal successors, (23970), 9240 states have internal predecessors, (23970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 23970 transitions. [2021-06-04 21:27:38,361 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 23970 transitions. Word has length 176 [2021-06-04 21:27:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:38,361 INFO L482 AbstractCegarLoop]: Abstraction has 9241 states and 23970 transitions. [2021-06-04 21:27:38,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 23970 transitions. [2021-06-04 21:27:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-04 21:27:38,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:38,370 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:38,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 21:27:38,370 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -788395354, now seen corresponding path program 1 times [2021-06-04 21:27:38,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:38,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008176504] [2021-06-04 21:27:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:39,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:39,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008176504] [2021-06-04 21:27:39,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008176504] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:39,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:39,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-04 21:27:39,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340952593] [2021-06-04 21:27:39,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-04 21:27:39,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-04 21:27:39,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:27:39,078 INFO L87 Difference]: Start difference. First operand 9241 states and 23970 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:41,101 INFO L93 Difference]: Finished difference Result 8320 states and 21398 transitions. [2021-06-04 21:27:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-04 21:27:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-06-04 21:27:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:41,110 INFO L225 Difference]: With dead ends: 8320 [2021-06-04 21:27:41,110 INFO L226 Difference]: Without dead ends: 8320 [2021-06-04 21:27:41,111 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1975.7ms TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:27:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2021-06-04 21:27:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 8026. [2021-06-04 21:27:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8026 states, 8024 states have (on average 2.5742771684945165) internal successors, (20656), 8025 states have internal predecessors, (20656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8026 states to 8026 states and 20656 transitions. [2021-06-04 21:27:41,228 INFO L78 Accepts]: Start accepts. Automaton has 8026 states and 20656 transitions. Word has length 180 [2021-06-04 21:27:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:41,229 INFO L482 AbstractCegarLoop]: Abstraction has 8026 states and 20656 transitions. [2021-06-04 21:27:41,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8026 states and 20656 transitions. [2021-06-04 21:27:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:27:41,237 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:41,237 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:41,237 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-04 21:27:41,237 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -858234869, now seen corresponding path program 1 times [2021-06-04 21:27:41,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:41,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667900300] [2021-06-04 21:27:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:41,974 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:27:42,129 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:27:42,305 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:27:43,581 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-04 21:27:46,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-06-04 21:27:46,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:46,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667900300] [2021-06-04 21:27:46,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667900300] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:46,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:46,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:27:46,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349939625] [2021-06-04 21:27:46,249 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:27:46,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:46,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:27:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:27:46,250 INFO L87 Difference]: Start difference. First operand 8026 states and 20656 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:47,908 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:27:49,182 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2021-06-04 21:27:49,798 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-04 21:27:50,402 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-04 21:27:51,046 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-04 21:27:51,950 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-04 21:27:52,945 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-04 21:27:54,527 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2021-06-04 21:27:56,755 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:27:57,086 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:27:57,432 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:27:59,815 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:28:03,152 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:28:03,563 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-04 21:28:05,895 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:28:07,074 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:28:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:08,558 INFO L93 Difference]: Finished difference Result 11919 states and 30719 transitions. [2021-06-04 21:28:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-04 21:28:08,559 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:28:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:08,571 INFO L225 Difference]: With dead ends: 11919 [2021-06-04 21:28:08,572 INFO L226 Difference]: Without dead ends: 11499 [2021-06-04 21:28:08,575 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4364 ImplicationChecksByTransitivity, 17743.7ms TimeCoverageRelationStatistics Valid=1539, Invalid=14717, Unknown=0, NotChecked=0, Total=16256 [2021-06-04 21:28:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11499 states. [2021-06-04 21:28:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11499 to 9438. [2021-06-04 21:28:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:28:08,701 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:28:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:08,702 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:28:08,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:28:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:28:08,710 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:08,710 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:28:08,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-04 21:28:08,710 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1302633973, now seen corresponding path program 2 times [2021-06-04 21:28:08,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:08,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578205791] [2021-06-04 21:28:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:09,592 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:28:09,762 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:28:09,947 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:28:11,229 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-04 21:28:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:13,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:13,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578205791] [2021-06-04 21:28:13,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578205791] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:13,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:13,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:28:13,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951704421] [2021-06-04 21:28:13,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:28:13,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:28:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:28:13,958 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:15,846 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:28:16,418 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:28:17,636 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 52 [2021-06-04 21:28:18,304 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-04 21:28:19,008 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-04 21:28:19,738 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-04 21:28:20,661 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-04 21:28:21,619 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-04 21:28:23,378 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2021-06-04 21:28:26,049 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:28:26,446 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:28:26,912 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:28:30,160 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:28:34,331 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:28:37,778 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:28:39,349 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:28:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:41,313 INFO L93 Difference]: Finished difference Result 13443 states and 34525 transitions. [2021-06-04 21:28:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:28:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:28:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:41,328 INFO L225 Difference]: With dead ends: 13443 [2021-06-04 21:28:41,328 INFO L226 Difference]: Without dead ends: 13023 [2021-06-04 21:28:41,331 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4427 ImplicationChecksByTransitivity, 18881.5ms TimeCoverageRelationStatistics Valid=1565, Invalid=14947, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:28:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2021-06-04 21:28:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 9438. [2021-06-04 21:28:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:28:41,456 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:28:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:41,456 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:28:41,457 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:28:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:28:41,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:41,465 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:28:41,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-04 21:28:41,465 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:41,465 INFO L82 PathProgramCache]: Analyzing trace with hash 868546213, now seen corresponding path program 3 times [2021-06-04 21:28:41,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:41,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890538875] [2021-06-04 21:28:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:42,173 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:28:42,485 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:28:42,873 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:28:43,288 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:28:43,653 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:28:44,005 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:28:44,248 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-04 21:28:45,013 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:28:45,922 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:28:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:51,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:51,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890538875] [2021-06-04 21:28:51,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890538875] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:51,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:51,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:28:51,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922260468] [2021-06-04 21:28:51,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:28:51,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:51,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:28:51,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:28:51,887 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:54,516 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:28:55,131 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:28:55,788 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:28:56,359 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 56 [2021-06-04 21:28:56,852 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-04 21:28:57,454 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-04 21:28:58,237 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-04 21:28:59,053 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-04 21:29:00,500 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 74 [2021-06-04 21:29:02,329 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:29:02,627 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:29:02,906 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:29:04,699 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:29:07,261 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:29:09,690 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:29:10,831 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:29:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:11,903 INFO L93 Difference]: Finished difference Result 13507 states and 34685 transitions. [2021-06-04 21:29:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-04 21:29:11,903 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:29:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:11,919 INFO L225 Difference]: With dead ends: 13507 [2021-06-04 21:29:11,919 INFO L226 Difference]: Without dead ends: 13087 [2021-06-04 21:29:11,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4589 ImplicationChecksByTransitivity, 22468.7ms TimeCoverageRelationStatistics Valid=1612, Invalid=15418, Unknown=0, NotChecked=0, Total=17030 [2021-06-04 21:29:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-04 21:29:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9438. [2021-06-04 21:29:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:29:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:29:12,058 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:29:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:12,058 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:29:12,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-06-04 21:29:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:29:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:29:12,067 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:12,067 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:12,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-04 21:29:12,067 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:29:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1647526667, now seen corresponding path program 4 times [2021-06-04 21:29:12,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:12,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596063541] [2021-06-04 21:29:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:12,890 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:29:13,204 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:29:13,487 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:29:15,438 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:29:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:29:19,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:19,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596063541] [2021-06-04 21:29:19,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596063541] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:19,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:19,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:29:19,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137772192] [2021-06-04 21:29:19,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:29:19,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:29:19,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:29:19,972 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:29:23,801 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:29:24,911 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:29:26,618 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:29:27,622 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:29:28,943 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:29:30,285 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-04 21:29:31,512 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2021-06-04 21:29:32,791 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-04 21:29:34,353 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-04 21:29:36,017 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-04 21:29:37,068 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2021-06-04 21:29:38,679 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:29:38,932 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:29:39,181 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:29:40,887 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:29:43,133 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:29:45,348 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:29:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:47,196 INFO L93 Difference]: Finished difference Result 13491 states and 34649 transitions. [2021-06-04 21:29:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-04 21:29:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:29:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:47,213 INFO L225 Difference]: With dead ends: 13491 [2021-06-04 21:29:47,213 INFO L226 Difference]: Without dead ends: 13071 [2021-06-04 21:29:47,215 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4659 ImplicationChecksByTransitivity, 27076.4ms TimeCoverageRelationStatistics Valid=1643, Invalid=15649, Unknown=0, NotChecked=0, Total=17292 [2021-06-04 21:29:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13071 states. [2021-06-04 21:29:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13071 to 9438. [2021-06-04 21:29:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:29:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:29:47,359 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:29:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:47,359 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:29:47,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:29:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:29:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:29:47,368 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:47,369 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:47,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-04 21:29:47,369 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:29:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -276826587, now seen corresponding path program 5 times [2021-06-04 21:29:47,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:47,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231577332] [2021-06-04 21:29:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:48,119 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:29:48,334 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:29:48,553 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:29:49,998 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:29:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:29:53,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:53,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231577332] [2021-06-04 21:29:53,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231577332] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:53,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:53,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:29:53,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202452307] [2021-06-04 21:29:53,674 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:29:53,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:29:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:29:53,675 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:29:56,456 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:29:57,134 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:29:58,161 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:29:58,834 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:29:59,570 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:30:00,628 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 79 [2021-06-04 21:30:01,698 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2021-06-04 21:30:02,593 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:30:04,121 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-04 21:30:05,149 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-04 21:30:06,305 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2021-06-04 21:30:07,571 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-04 21:30:08,757 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 83 [2021-06-04 21:30:10,151 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-04 21:30:11,552 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 81 [2021-06-04 21:30:16,851 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:30:17,332 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:30:17,916 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:30:18,493 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-04 21:30:19,958 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:30:22,241 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:30:24,446 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:30:25,470 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:30:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:26,493 INFO L93 Difference]: Finished difference Result 13595 states and 34905 transitions. [2021-06-04 21:30:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-04 21:30:26,493 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:30:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:26,509 INFO L225 Difference]: With dead ends: 13595 [2021-06-04 21:30:26,509 INFO L226 Difference]: Without dead ends: 13175 [2021-06-04 21:30:26,511 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5083 ImplicationChecksByTransitivity, 27657.7ms TimeCoverageRelationStatistics Valid=1769, Invalid=16863, Unknown=0, NotChecked=0, Total=18632 [2021-06-04 21:30:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2021-06-04 21:30:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 9438. [2021-06-04 21:30:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9436 states have (on average 2.5559559135226793) internal successors, (24118), 9437 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:30:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 24118 transitions. [2021-06-04 21:30:26,649 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 24118 transitions. Word has length 184 [2021-06-04 21:30:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:26,649 INFO L482 AbstractCegarLoop]: Abstraction has 9438 states and 24118 transitions. [2021-06-04 21:30:26,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:30:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 24118 transitions. [2021-06-04 21:30:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:30:26,659 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:26,659 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:26,659 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-04 21:30:26,659 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:30:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -410727541, now seen corresponding path program 6 times [2021-06-04 21:30:26,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:26,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776158479] [2021-06-04 21:30:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:27,436 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:30:27,670 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:30:27,874 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:30:29,289 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:30:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:30:32,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:32,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776158479] [2021-06-04 21:30:32,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776158479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:32,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:32,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:30:32,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632757980] [2021-06-04 21:30:32,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:30:32,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:30:32,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:30:32,743 INFO L87 Difference]: Start difference. First operand 9438 states and 24118 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:30:35,807 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:30:36,589 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:30:37,787 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:30:38,521 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:30:39,273 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:30:40,328 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:30:41,397 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:30:42,292 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:30:43,914 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-04 21:30:44,985 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-04 21:30:46,149 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-04 21:30:47,465 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 86 [2021-06-04 21:30:48,867 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 84 [2021-06-04 21:30:54,531 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:30:55,077 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:30:55,755 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:31:00,875 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:31:06,305 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:31:08,383 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:31:09,324 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:31:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:31:10,260 INFO L93 Difference]: Finished difference Result 13507 states and 34707 transitions. [2021-06-04 21:31:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-04 21:31:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:31:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:31:10,274 INFO L225 Difference]: With dead ends: 13507 [2021-06-04 21:31:10,274 INFO L226 Difference]: Without dead ends: 13087 [2021-06-04 21:31:10,275 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4805 ImplicationChecksByTransitivity, 25542.0ms TimeCoverageRelationStatistics Valid=1687, Invalid=16135, Unknown=0, NotChecked=0, Total=17822 [2021-06-04 21:31:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2021-06-04 21:31:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 9516. [2021-06-04 21:31:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9516 states, 9514 states have (on average 2.5570737859995796) internal successors, (24328), 9515 states have internal predecessors, (24328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:31:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 24328 transitions. [2021-06-04 21:31:10,397 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 24328 transitions. Word has length 184 [2021-06-04 21:31:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:31:10,397 INFO L482 AbstractCegarLoop]: Abstraction has 9516 states and 24328 transitions. [2021-06-04 21:31:10,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:31:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 24328 transitions. [2021-06-04 21:31:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:31:10,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:31:10,405 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:31:10,405 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-04 21:31:10,405 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:31:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:31:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2715019, now seen corresponding path program 7 times [2021-06-04 21:31:10,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:31:10,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526301782] [2021-06-04 21:31:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:31:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:31:11,079 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:31:11,257 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:31:11,468 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:31:12,794 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:31:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:31:16,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:31:16,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526301782] [2021-06-04 21:31:16,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526301782] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:31:16,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:31:16,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:31:16,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909314400] [2021-06-04 21:31:16,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:31:16,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:31:16,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:31:16,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:31:16,146 INFO L87 Difference]: Start difference. First operand 9516 states and 24328 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:31:18,498 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:31:19,153 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:31:20,210 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:31:20,865 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:31:21,572 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:31:22,539 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:31:23,568 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:31:24,422 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:31:25,921 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-04 21:31:26,962 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-04 21:31:28,046 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-04 21:31:29,394 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-04 21:31:30,807 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-04 21:31:35,383 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:31:35,760 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:31:36,189 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:31:39,317 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:31:43,236 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:31:46,663 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:31:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:31:48,147 INFO L93 Difference]: Finished difference Result 13448 states and 34580 transitions. [2021-06-04 21:31:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-06-04 21:31:48,147 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:31:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:31:48,162 INFO L225 Difference]: With dead ends: 13448 [2021-06-04 21:31:48,162 INFO L226 Difference]: Without dead ends: 13028 [2021-06-04 21:31:48,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5037 ImplicationChecksByTransitivity, 25143.1ms TimeCoverageRelationStatistics Valid=1716, Invalid=16916, Unknown=0, NotChecked=0, Total=18632 [2021-06-04 21:31:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2021-06-04 21:31:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 9529. [2021-06-04 21:31:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9529 states, 9527 states have (on average 2.557258318463315) internal successors, (24363), 9528 states have internal predecessors, (24363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:31:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9529 states to 9529 states and 24363 transitions. [2021-06-04 21:31:48,301 INFO L78 Accepts]: Start accepts. Automaton has 9529 states and 24363 transitions. Word has length 184 [2021-06-04 21:31:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:31:48,302 INFO L482 AbstractCegarLoop]: Abstraction has 9529 states and 24363 transitions. [2021-06-04 21:31:48,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:31:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9529 states and 24363 transitions. [2021-06-04 21:31:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:31:48,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:31:48,310 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:31:48,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-04 21:31:48,310 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:31:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:31:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1807828059, now seen corresponding path program 8 times [2021-06-04 21:31:48,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:31:48,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180166790] [2021-06-04 21:31:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:31:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:31:48,997 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:31:49,200 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:31:49,435 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:31:49,595 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:31:50,582 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:31:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:31:53,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:31:53,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180166790] [2021-06-04 21:31:53,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180166790] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:31:53,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:31:53,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:31:53,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248335229] [2021-06-04 21:31:53,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:31:53,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:31:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:31:53,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:31:53,347 INFO L87 Difference]: Start difference. First operand 9529 states and 24363 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:31:55,274 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:31:55,889 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:31:56,814 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:31:57,434 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:31:58,048 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:31:58,883 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:31:59,811 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:32:00,565 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:32:01,973 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-04 21:32:02,891 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-04 21:32:03,927 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-04 21:32:05,147 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-04 21:32:06,452 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-04 21:32:11,531 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:32:11,912 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:32:12,355 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:32:15,591 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:32:19,829 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:32:23,410 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:32:25,057 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:32:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:32:27,140 INFO L93 Difference]: Finished difference Result 13461 states and 34615 transitions. [2021-06-04 21:32:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-06-04 21:32:27,141 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:32:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:32:27,156 INFO L225 Difference]: With dead ends: 13461 [2021-06-04 21:32:27,156 INFO L226 Difference]: Without dead ends: 13041 [2021-06-04 21:32:27,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 23697.8ms TimeCoverageRelationStatistics Valid=1753, Invalid=17707, Unknown=0, NotChecked=0, Total=19460 [2021-06-04 21:32:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13041 states. [2021-06-04 21:32:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13041 to 9542. [2021-06-04 21:32:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9542 states, 9540 states have (on average 2.5574423480083857) internal successors, (24398), 9541 states have internal predecessors, (24398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:32:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 24398 transitions. [2021-06-04 21:32:27,292 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 24398 transitions. Word has length 184 [2021-06-04 21:32:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:32:27,293 INFO L482 AbstractCegarLoop]: Abstraction has 9542 states and 24398 transitions. [2021-06-04 21:32:27,293 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:32:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 24398 transitions. [2021-06-04 21:32:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:32:27,300 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:32:27,300 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:32:27,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-04 21:32:27,300 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:32:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:32:27,301 INFO L82 PathProgramCache]: Analyzing trace with hash -92526133, now seen corresponding path program 9 times [2021-06-04 21:32:27,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:32:27,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547664239] [2021-06-04 21:32:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:32:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:32:28,089 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:32:28,293 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:32:28,501 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:32:29,569 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:32:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:32:32,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:32:32,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547664239] [2021-06-04 21:32:32,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547664239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:32:32,166 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:32:32,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:32:32,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323384029] [2021-06-04 21:32:32,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:32:32,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:32:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:32:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:32:32,167 INFO L87 Difference]: Start difference. First operand 9542 states and 24398 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:32:34,386 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:32:35,257 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:32:35,826 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:32:36,454 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:32:37,303 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:32:38,170 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:32:38,931 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 52 [2021-06-04 21:32:40,343 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 56 [2021-06-04 21:32:41,255 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 59 [2021-06-04 21:32:42,201 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 61 [2021-06-04 21:32:43,421 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2021-06-04 21:32:44,702 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 84 [2021-06-04 21:32:49,599 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:32:49,994 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:32:50,435 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:32:53,416 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:32:57,131 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:33:00,356 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:33:01,796 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:33:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:33:03,506 INFO L93 Difference]: Finished difference Result 14681 states and 37799 transitions. [2021-06-04 21:33:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-04 21:33:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:33:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:33:03,521 INFO L225 Difference]: With dead ends: 14681 [2021-06-04 21:33:03,522 INFO L226 Difference]: Without dead ends: 14261 [2021-06-04 21:33:03,523 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5230 ImplicationChecksByTransitivity, 22541.5ms TimeCoverageRelationStatistics Valid=1827, Invalid=17355, Unknown=0, NotChecked=0, Total=19182 [2021-06-04 21:33:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2021-06-04 21:33:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 9646. [2021-06-04 21:33:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9646 states, 9644 states have (on average 2.5588967233513067) internal successors, (24678), 9645 states have internal predecessors, (24678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:33:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 24678 transitions. [2021-06-04 21:33:03,659 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 24678 transitions. Word has length 184 [2021-06-04 21:33:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:33:03,659 INFO L482 AbstractCegarLoop]: Abstraction has 9646 states and 24678 transitions. [2021-06-04 21:33:03,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:33:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 24678 transitions. [2021-06-04 21:33:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:33:03,666 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:33:03,667 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:33:03,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-04 21:33:03,667 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:33:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:33:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 787291659, now seen corresponding path program 10 times [2021-06-04 21:33:03,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:33:03,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929193659] [2021-06-04 21:33:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:33:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:33:04,313 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:33:04,689 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:33:05,100 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:33:05,540 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:33:05,913 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:33:06,304 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-04 21:33:06,614 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-04 21:33:07,016 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-04 21:33:07,421 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:33:07,893 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-06-04 21:33:08,356 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:33:10,826 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2021-06-04 21:33:12,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-06-04 21:33:12,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:33:12,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929193659] [2021-06-04 21:33:12,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929193659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:33:12,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:33:12,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:33:12,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699119849] [2021-06-04 21:33:12,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:33:12,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:33:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:33:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:33:12,365 INFO L87 Difference]: Start difference. First operand 9646 states and 24678 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:33:14,156 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:33:14,864 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:33:15,357 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:33:15,871 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:33:16,626 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:33:17,403 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:33:18,014 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 52 [2021-06-04 21:33:19,227 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 56 [2021-06-04 21:33:20,050 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 59 [2021-06-04 21:33:20,898 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 61 [2021-06-04 21:33:21,914 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 86 [2021-06-04 21:33:22,954 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 84 [2021-06-04 21:33:27,091 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:33:27,470 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:33:27,795 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:33:30,537 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:33:34,140 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:33:37,087 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:33:38,279 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:33:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:33:39,964 INFO L93 Difference]: Finished difference Result 14609 states and 37563 transitions. [2021-06-04 21:33:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-06-04 21:33:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:33:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:33:39,979 INFO L225 Difference]: With dead ends: 14609 [2021-06-04 21:33:39,980 INFO L226 Difference]: Without dead ends: 14189 [2021-06-04 21:33:39,981 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5305 ImplicationChecksByTransitivity, 24395.3ms TimeCoverageRelationStatistics Valid=1937, Invalid=17245, Unknown=0, NotChecked=0, Total=19182 [2021-06-04 21:33:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2021-06-04 21:33:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 9659. [2021-06-04 21:33:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9659 states, 9657 states have (on average 2.5590763176970075) internal successors, (24713), 9658 states have internal predecessors, (24713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:33:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 24713 transitions. [2021-06-04 21:33:40,117 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 24713 transitions. Word has length 184 [2021-06-04 21:33:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:33:40,117 INFO L482 AbstractCegarLoop]: Abstraction has 9659 states and 24713 transitions. [2021-06-04 21:33:40,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:33:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 24713 transitions. [2021-06-04 21:33:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:33:40,125 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:33:40,125 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:33:40,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-04 21:33:40,125 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:33:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:33:40,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1611136987, now seen corresponding path program 11 times [2021-06-04 21:33:40,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:33:40,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358486862] [2021-06-04 21:33:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:33:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:33:40,971 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:33:41,282 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:33:41,670 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:33:41,993 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:33:42,524 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-04 21:33:43,185 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:33:44,026 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:33:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:33:49,491 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:33:49,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358486862] [2021-06-04 21:33:49,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358486862] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:33:49,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:33:49,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:33:49,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574509094] [2021-06-04 21:33:49,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:33:49,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:33:49,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:33:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:33:49,492 INFO L87 Difference]: Start difference. First operand 9659 states and 24713 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:33:53,809 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:33:54,439 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:33:54,734 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:33:55,025 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:33:55,381 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:33:55,955 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:33:56,523 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:33:59,335 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:33:59,612 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:33:59,855 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:34:01,637 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:34:03,887 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:34:05,893 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:34:06,762 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:34:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:34:07,606 INFO L93 Difference]: Finished difference Result 14313 states and 36777 transitions. [2021-06-04 21:34:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:34:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:34:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:34:07,621 INFO L225 Difference]: With dead ends: 14313 [2021-06-04 21:34:07,621 INFO L226 Difference]: Without dead ends: 13893 [2021-06-04 21:34:07,622 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4461 ImplicationChecksByTransitivity, 20688.1ms TimeCoverageRelationStatistics Valid=1594, Invalid=14918, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:34:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2021-06-04 21:34:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 9698. [2021-06-04 21:34:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9698 states, 9696 states have (on average 2.559612211221122) internal successors, (24818), 9697 states have internal predecessors, (24818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:34:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 24818 transitions. [2021-06-04 21:34:07,753 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 24818 transitions. Word has length 184 [2021-06-04 21:34:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:34:07,753 INFO L482 AbstractCegarLoop]: Abstraction has 9698 states and 24818 transitions. [2021-06-04 21:34:07,753 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:34:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 24818 transitions. [2021-06-04 21:34:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:34:07,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:34:07,763 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:34:07,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-04 21:34:07,764 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:34:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:34:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash 481639115, now seen corresponding path program 12 times [2021-06-04 21:34:07,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:34:07,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802527856] [2021-06-04 21:34:07,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:34:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:34:08,473 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:34:08,645 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:34:08,848 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:34:10,216 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:34:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:34:13,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:34:13,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802527856] [2021-06-04 21:34:13,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802527856] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:34:13,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:34:13,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:34:13,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637341194] [2021-06-04 21:34:13,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:34:13,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:34:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:34:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:34:13,739 INFO L87 Difference]: Start difference. First operand 9698 states and 24818 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:34:16,244 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:34:16,987 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:34:17,694 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:34:18,382 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:34:19,137 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:34:20,140 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:34:21,150 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:34:25,352 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:34:25,719 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:34:26,056 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:34:28,438 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2021-06-04 21:34:28,674 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:34:30,653 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:34:32,415 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:34:33,210 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:34:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:34:33,923 INFO L93 Difference]: Finished difference Result 14281 states and 36705 transitions. [2021-06-04 21:34:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:34:33,924 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:34:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:34:33,939 INFO L225 Difference]: With dead ends: 14281 [2021-06-04 21:34:33,939 INFO L226 Difference]: Without dead ends: 13861 [2021-06-04 21:34:33,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4459 ImplicationChecksByTransitivity, 18604.4ms TimeCoverageRelationStatistics Valid=1594, Invalid=14918, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:34:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13861 states. [2021-06-04 21:34:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13861 to 9711. [2021-06-04 21:34:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9711 states, 9709 states have (on average 2.5597898856730867) internal successors, (24853), 9710 states have internal predecessors, (24853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:34:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 24853 transitions. [2021-06-04 21:34:34,069 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 24853 transitions. Word has length 184 [2021-06-04 21:34:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:34:34,069 INFO L482 AbstractCegarLoop]: Abstraction has 9711 states and 24853 transitions. [2021-06-04 21:34:34,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:34:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 24853 transitions. [2021-06-04 21:34:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:34:34,077 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:34:34,077 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:34:34,077 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-04 21:34:34,077 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:34:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:34:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 317652773, now seen corresponding path program 13 times [2021-06-04 21:34:34,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:34:34,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66105377] [2021-06-04 21:34:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:34:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:34:34,708 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:34:34,867 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:34:35,053 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:34:36,193 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:34:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:34:39,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:34:39,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66105377] [2021-06-04 21:34:39,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66105377] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:34:39,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:34:39,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:34:39,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167265661] [2021-06-04 21:34:39,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:34:39,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:34:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:34:39,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:34:39,219 INFO L87 Difference]: Start difference. First operand 9711 states and 24853 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:34:41,225 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:34:41,722 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:34:42,261 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:34:42,788 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:34:43,365 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:34:44,207 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:34:45,050 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:34:48,092 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:34:48,982 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-04 21:34:49,299 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:34:49,540 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:34:51,850 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:34:55,335 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:34:58,248 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:34:59,501 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:35:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:35:01,075 INFO L93 Difference]: Finished difference Result 13833 states and 35557 transitions. [2021-06-04 21:35:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-04 21:35:01,076 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:35:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:35:01,094 INFO L225 Difference]: With dead ends: 13833 [2021-06-04 21:35:01,094 INFO L226 Difference]: Without dead ends: 13413 [2021-06-04 21:35:01,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4378 ImplicationChecksByTransitivity, 17219.5ms TimeCoverageRelationStatistics Valid=1564, Invalid=14692, Unknown=0, NotChecked=0, Total=16256 [2021-06-04 21:35:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2021-06-04 21:35:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 9724. [2021-06-04 21:35:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9724 states, 9722 states have (on average 2.559967084961942) internal successors, (24888), 9723 states have internal predecessors, (24888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 24888 transitions. [2021-06-04 21:35:01,333 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 24888 transitions. Word has length 184 [2021-06-04 21:35:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:35:01,334 INFO L482 AbstractCegarLoop]: Abstraction has 9724 states and 24888 transitions. [2021-06-04 21:35:01,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 24888 transitions. [2021-06-04 21:35:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:35:01,342 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:35:01,342 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:35:01,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-04 21:35:01,342 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:35:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:35:01,348 INFO L82 PathProgramCache]: Analyzing trace with hash 421691335, now seen corresponding path program 14 times [2021-06-04 21:35:01,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:35:01,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873237860] [2021-06-04 21:35:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:35:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:35:01,940 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:35:02,092 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:35:02,275 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:35:03,312 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:35:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:35:05,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:35:05,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873237860] [2021-06-04 21:35:05,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873237860] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:35:05,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:35:05,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:35:05,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396369926] [2021-06-04 21:35:05,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:35:05,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:35:05,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:35:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:35:05,900 INFO L87 Difference]: Start difference. First operand 9724 states and 24888 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:07,595 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:35:08,104 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:35:08,549 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:35:09,014 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:35:09,528 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:35:10,292 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:35:11,084 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:35:13,914 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:35:14,217 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:35:15,579 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:35:17,698 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:35:20,301 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:35:22,711 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:35:23,744 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:35:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:35:24,779 INFO L93 Difference]: Finished difference Result 13801 states and 35485 transitions. [2021-06-04 21:35:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-04 21:35:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:35:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:35:24,795 INFO L225 Difference]: With dead ends: 13801 [2021-06-04 21:35:24,795 INFO L226 Difference]: Without dead ends: 13381 [2021-06-04 21:35:24,797 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4440 ImplicationChecksByTransitivity, 15890.6ms TimeCoverageRelationStatistics Valid=1595, Invalid=14917, Unknown=0, NotChecked=0, Total=16512 [2021-06-04 21:35:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2021-06-04 21:35:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 9854. [2021-06-04 21:35:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9854 states, 9852 states have (on average 2.5617133576938693) internal successors, (25238), 9853 states have internal predecessors, (25238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 25238 transitions. [2021-06-04 21:35:24,933 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 25238 transitions. Word has length 184 [2021-06-04 21:35:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:35:24,934 INFO L482 AbstractCegarLoop]: Abstraction has 9854 states and 25238 transitions. [2021-06-04 21:35:24,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 25238 transitions. [2021-06-04 21:35:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:35:24,942 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:35:24,942 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:35:24,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-04 21:35:24,942 INFO L430 AbstractCegarLoop]: === Iteration 31 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:35:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:35:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1697699831, now seen corresponding path program 15 times [2021-06-04 21:35:24,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:35:24,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115759702] [2021-06-04 21:35:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:35:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:35:25,540 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-04 21:35:25,852 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:35:26,147 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:35:26,480 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:35:26,761 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-04 21:35:27,275 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-06-04 21:35:28,543 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:35:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:35:33,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:35:33,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115759702] [2021-06-04 21:35:33,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115759702] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:35:33,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:35:33,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:35:33,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485702863] [2021-06-04 21:35:33,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:35:33,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:35:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:35:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:35:33,337 INFO L87 Difference]: Start difference. First operand 9854 states and 25238 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:36,586 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2021-06-04 21:35:37,146 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:35:37,491 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:35:37,815 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:35:38,194 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:35:38,768 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:35:39,379 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:35:41,795 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:35:42,100 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:35:42,345 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-04 21:35:43,296 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:35:45,559 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:35:48,038 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:35:50,377 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:35:51,420 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:35:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:35:52,346 INFO L93 Difference]: Finished difference Result 15755 states and 40499 transitions. [2021-06-04 21:35:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-04 21:35:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:35:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:35:52,363 INFO L225 Difference]: With dead ends: 15755 [2021-06-04 21:35:52,363 INFO L226 Difference]: Without dead ends: 15335 [2021-06-04 21:35:52,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4615 ImplicationChecksByTransitivity, 19191.2ms TimeCoverageRelationStatistics Valid=1628, Invalid=15402, Unknown=0, NotChecked=0, Total=17030 [2021-06-04 21:35:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15335 states. [2021-06-04 21:35:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15335 to 9958. [2021-06-04 21:35:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9958 states, 9956 states have (on average 2.564383286460426) internal successors, (25531), 9957 states have internal predecessors, (25531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 25531 transitions. [2021-06-04 21:35:52,498 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 25531 transitions. Word has length 184 [2021-06-04 21:35:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:35:52,498 INFO L482 AbstractCegarLoop]: Abstraction has 9958 states and 25531 transitions. [2021-06-04 21:35:52,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:35:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 25531 transitions. [2021-06-04 21:35:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:35:52,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:35:52,506 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:35:52,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-04 21:35:52,506 INFO L430 AbstractCegarLoop]: === Iteration 32 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:35:52,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:35:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2078488249, now seen corresponding path program 16 times [2021-06-04 21:35:52,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:35:52,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404056192] [2021-06-04 21:35:52,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:35:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:35:53,165 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:35:53,356 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:35:53,571 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:35:55,035 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:35:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:35:58,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:35:58,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404056192] [2021-06-04 21:35:58,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404056192] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:35:58,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:35:58,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:35:58,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484361407] [2021-06-04 21:35:58,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:35:58,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:35:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:35:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:35:58,765 INFO L87 Difference]: Start difference. First operand 9958 states and 25531 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:01,878 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:36:02,761 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:36:03,548 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:36:04,345 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:36:05,215 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:36:06,336 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:36:07,487 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:36:11,247 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:36:11,647 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:36:12,020 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-04 21:36:13,700 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:36:16,198 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:36:18,530 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:36:20,734 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:36:21,700 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:36:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:36:22,590 INFO L93 Difference]: Finished difference Result 15667 states and 40285 transitions. [2021-06-04 21:36:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-04 21:36:22,591 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:36:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:36:22,606 INFO L225 Difference]: With dead ends: 15667 [2021-06-04 21:36:22,606 INFO L226 Difference]: Without dead ends: 15247 [2021-06-04 21:36:22,608 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4696 ImplicationChecksByTransitivity, 20026.6ms TimeCoverageRelationStatistics Valid=1640, Invalid=15652, Unknown=0, NotChecked=0, Total=17292 [2021-06-04 21:36:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15247 states. [2021-06-04 21:36:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15247 to 9997. [2021-06-04 21:36:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 9995 states have (on average 2.56488244122061) internal successors, (25636), 9996 states have internal predecessors, (25636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 25636 transitions. [2021-06-04 21:36:22,741 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 25636 transitions. Word has length 184 [2021-06-04 21:36:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:36:22,741 INFO L482 AbstractCegarLoop]: Abstraction has 9997 states and 25636 transitions. [2021-06-04 21:36:22,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 25636 transitions. [2021-06-04 21:36:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:36:22,748 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:36:22,749 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:36:22,749 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-04 21:36:22,749 INFO L430 AbstractCegarLoop]: === Iteration 33 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:36:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:36:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1942160421, now seen corresponding path program 17 times [2021-06-04 21:36:22,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:36:22,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498806255] [2021-06-04 21:36:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:36:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:36:23,330 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:36:23,489 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:36:23,680 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:36:24,833 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:36:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:36:27,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:36:27,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498806255] [2021-06-04 21:36:27,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498806255] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:36:27,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:36:27,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:36:27,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210502436] [2021-06-04 21:36:27,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:36:27,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:36:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:36:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:36:27,883 INFO L87 Difference]: Start difference. First operand 9997 states and 25636 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:30,056 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 51 [2021-06-04 21:36:30,669 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:36:31,210 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:36:31,745 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:36:32,364 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:36:33,270 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:36:34,214 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:36:37,674 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:36:38,052 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:36:39,902 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:36:44,437 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:36:48,106 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:36:50,175 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:36:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:36:51,914 INFO L93 Difference]: Finished difference Result 15627 states and 40195 transitions. [2021-06-04 21:36:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-04 21:36:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:36:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:36:51,928 INFO L225 Difference]: With dead ends: 15627 [2021-06-04 21:36:51,928 INFO L226 Difference]: Without dead ends: 15207 [2021-06-04 21:36:51,929 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4782 ImplicationChecksByTransitivity, 17540.7ms TimeCoverageRelationStatistics Valid=1655, Invalid=15901, Unknown=0, NotChecked=0, Total=17556 [2021-06-04 21:36:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2021-06-04 21:36:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 10023. [2021-06-04 21:36:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10023 states, 10021 states have (on average 2.565213052589562) internal successors, (25706), 10022 states have internal predecessors, (25706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10023 states to 10023 states and 25706 transitions. [2021-06-04 21:36:52,056 INFO L78 Accepts]: Start accepts. Automaton has 10023 states and 25706 transitions. Word has length 184 [2021-06-04 21:36:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:36:52,057 INFO L482 AbstractCegarLoop]: Abstraction has 10023 states and 25706 transitions. [2021-06-04 21:36:52,057 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 10023 states and 25706 transitions. [2021-06-04 21:36:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:36:52,064 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:36:52,064 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:36:52,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-04 21:36:52,065 INFO L430 AbstractCegarLoop]: === Iteration 34 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:36:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:36:52,065 INFO L82 PathProgramCache]: Analyzing trace with hash 956827493, now seen corresponding path program 18 times [2021-06-04 21:36:52,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:36:52,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226718108] [2021-06-04 21:36:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:36:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:36:52,727 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:36:52,940 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:36:53,120 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:36:54,194 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:36:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:36:56,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:36:56,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226718108] [2021-06-04 21:36:56,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226718108] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:36:56,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:36:56,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:36:56,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003805090] [2021-06-04 21:36:56,826 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:36:56,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:36:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:36:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:36:56,827 INFO L87 Difference]: Start difference. First operand 10023 states and 25706 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:36:59,042 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:36:59,503 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:36:59,973 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:37:00,518 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:37:01,337 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 81 [2021-06-04 21:37:02,183 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 79 [2021-06-04 21:37:05,102 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-06-04 21:37:09,894 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2021-06-04 21:37:12,855 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-04 21:37:14,614 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-04 21:37:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:37:17,962 INFO L93 Difference]: Finished difference Result 15649 states and 40255 transitions. [2021-06-04 21:37:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-04 21:37:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:37:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:37:17,976 INFO L225 Difference]: With dead ends: 15649 [2021-06-04 21:37:17,977 INFO L226 Difference]: Without dead ends: 15229 [2021-06-04 21:37:17,977 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4979 ImplicationChecksByTransitivity, 17024.4ms TimeCoverageRelationStatistics Valid=1685, Invalid=16675, Unknown=0, NotChecked=0, Total=18360 [2021-06-04 21:37:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15229 states. [2021-06-04 21:37:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15229 to 10036. [2021-06-04 21:37:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10036 states, 10034 states have (on average 2.5653777157663944) internal successors, (25741), 10035 states have internal predecessors, (25741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:37:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 25741 transitions. [2021-06-04 21:37:18,097 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 25741 transitions. Word has length 184 [2021-06-04 21:37:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:37:18,097 INFO L482 AbstractCegarLoop]: Abstraction has 10036 states and 25741 transitions. [2021-06-04 21:37:18,097 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:37:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 25741 transitions. [2021-06-04 21:37:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:37:18,104 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:37:18,104 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:37:18,105 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-04 21:37:18,105 INFO L430 AbstractCegarLoop]: === Iteration 35 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:37:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:37:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 913127371, now seen corresponding path program 19 times [2021-06-04 21:37:18,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:37:18,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637309103] [2021-06-04 21:37:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:37:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:37:18,726 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:37:18,906 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:37:19,076 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:37:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:37:22,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:37:22,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637309103] [2021-06-04 21:37:22,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637309103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:37:22,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:37:22,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:37:22,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664615385] [2021-06-04 21:37:22,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:37:22,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:37:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:37:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:37:22,527 INFO L87 Difference]: Start difference. First operand 10036 states and 25741 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:37:24,492 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:37:24,875 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:37:25,269 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:37:25,744 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:37:26,517 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:37:27,259 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:37:30,004 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:37:30,320 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:37:31,780 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:37:33,782 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2021-06-04 21:37:35,989 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:37:39,455 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:37:42,482 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:37:43,827 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:37:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:37:45,303 INFO L93 Difference]: Finished difference Result 16779 states and 43195 transitions. [2021-06-04 21:37:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-04 21:37:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:37:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:37:45,320 INFO L225 Difference]: With dead ends: 16779 [2021-06-04 21:37:45,321 INFO L226 Difference]: Without dead ends: 16359 [2021-06-04 21:37:45,322 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 16102.5ms TimeCoverageRelationStatistics Valid=1713, Invalid=16647, Unknown=0, NotChecked=0, Total=18360 [2021-06-04 21:37:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2021-06-04 21:37:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 10348. [2021-06-04 21:37:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10346 states have (on average 2.5692054900444616) internal successors, (26581), 10347 states have internal predecessors, (26581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:37:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-04 21:37:45,462 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-04 21:37:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:37:45,462 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-04 21:37:45,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:37:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-04 21:37:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:37:45,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:37:45,470 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:37:45,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-04 21:37:45,470 INFO L430 AbstractCegarLoop]: === Iteration 36 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:37:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:37:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1490581689, now seen corresponding path program 20 times [2021-06-04 21:37:45,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:37:45,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183263880] [2021-06-04 21:37:45,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:37:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:37:46,235 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-06-04 21:37:46,478 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-04 21:37:46,758 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-04 21:37:48,869 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-04 21:37:51,501 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-06-04 21:37:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:37:52,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:37:52,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183263880] [2021-06-04 21:37:52,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183263880] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:37:52,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:37:52,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-04 21:37:52,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177357136] [2021-06-04 21:37:52,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-04 21:37:52,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:37:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-04 21:37:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-04 21:37:52,739 INFO L87 Difference]: Start difference. First operand 10348 states and 26581 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:37:54,435 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2021-06-04 21:37:54,759 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 52 [2021-06-04 21:37:55,083 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2021-06-04 21:37:55,450 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 57 [2021-06-04 21:37:56,056 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2021-06-04 21:37:56,682 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 80 [2021-06-04 21:37:59,175 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-04 21:37:59,481 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-04 21:38:00,358 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-04 21:38:00,585 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-04 21:38:01,733 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-04 21:38:02,823 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2021-06-04 21:38:05,660 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-04 21:38:08,127 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-04 21:38:09,159 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-04 21:38:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:38:10,501 INFO L93 Difference]: Finished difference Result 14763 states and 38063 transitions. [2021-06-04 21:38:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-04 21:38:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-04 21:38:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:38:10,516 INFO L225 Difference]: With dead ends: 14763 [2021-06-04 21:38:10,516 INFO L226 Difference]: Without dead ends: 14343 [2021-06-04 21:38:10,518 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4546 ImplicationChecksByTransitivity, 16740.1ms TimeCoverageRelationStatistics Valid=1616, Invalid=15154, Unknown=0, NotChecked=0, Total=16770 [2021-06-04 21:38:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2021-06-04 21:38:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 10348. [2021-06-04 21:38:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10346 states have (on average 2.5692054900444616) internal successors, (26581), 10347 states have internal predecessors, (26581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:38:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 26581 transitions. [2021-06-04 21:38:10,647 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 26581 transitions. Word has length 184 [2021-06-04 21:38:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:38:10,647 INFO L482 AbstractCegarLoop]: Abstraction has 10348 states and 26581 transitions. [2021-06-04 21:38:10,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:38:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 26581 transitions. [2021-06-04 21:38:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-04 21:38:10,655 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:38:10,655 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:38:10,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-04 21:38:10,655 INFO L430 AbstractCegarLoop]: === Iteration 37 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:38:10,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:38:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash 473197579, now seen corresponding path program 21 times [2021-06-04 21:38:10,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:38:10,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183439790] [2021-06-04 21:38:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:38:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2021-06-04 21:39:59,528 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,537 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,538 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,538 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,539 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,539 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,540 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,541 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,542 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,542 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,543 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,544 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,545 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,545 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,546 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,547 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,548 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,548 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,549 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,549 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,549 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,550 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,550 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,550 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,551 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,551 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,551 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,552 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,552 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,553 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,553 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,558 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,559 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,559 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,559 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,559 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,560 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,560 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,560 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,560 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,560 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,561 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,561 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,561 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,561 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2021-06-04 21:39:59,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-04 21:39:59,563 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-04 21:39:59,565 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 21:39:59,567 WARN L196 ceAbstractionStarter]: Timeout [2021-06-04 21:39:59,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 09:39:59 BasicIcfg [2021-06-04 21:39:59,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 21:39:59,568 INFO L168 Benchmark]: Toolchain (without parser) took 781228.78 ms. Allocated memory was 369.1 MB in the beginning and 8.5 GB in the end (delta: 8.2 GB). Free memory was 331.0 MB in the beginning and 6.0 GB in the end (delta: -5.6 GB). Peak memory consumption was 6.1 GB. Max. memory is 16.0 GB. [2021-06-04 21:39:59,568 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 369.1 MB. Free memory was 349.8 MB in the beginning and 349.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 21:39:59,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.91 ms. Allocated memory is still 369.1 MB. Free memory was 330.8 MB in the beginning and 303.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. [2021-06-04 21:39:59,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.72 ms. Allocated memory is still 369.1 MB. Free memory was 303.4 MB in the beginning and 301.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:39:59,568 INFO L168 Benchmark]: Boogie Preprocessor took 29.96 ms. Allocated memory is still 369.1 MB. Free memory was 301.1 MB in the beginning and 298.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-04 21:39:59,568 INFO L168 Benchmark]: RCFGBuilder took 670.20 ms. Allocated memory is still 369.1 MB. Free memory was 298.1 MB in the beginning and 249.8 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-06-04 21:39:59,568 INFO L168 Benchmark]: TraceAbstraction took 779873.29 ms. Allocated memory was 369.1 MB in the beginning and 8.5 GB in the end (delta: 8.2 GB). Free memory was 249.8 MB in the beginning and 6.0 GB in the end (delta: -5.7 GB). Peak memory consumption was 6.0 GB. Max. memory is 16.0 GB. [2021-06-04 21:39:59,569 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 369.1 MB. Free memory was 349.8 MB in the beginning and 349.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 599.91 ms. Allocated memory is still 369.1 MB. Free memory was 330.8 MB in the beginning and 303.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.72 ms. Allocated memory is still 369.1 MB. Free memory was 303.4 MB in the beginning and 301.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.96 ms. Allocated memory is still 369.1 MB. Free memory was 301.1 MB in the beginning and 298.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 670.20 ms. Allocated memory is still 369.1 MB. Free memory was 298.1 MB in the beginning and 249.8 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 779873.29 ms. Allocated memory was 369.1 MB in the beginning and 8.5 GB in the end (delta: 8.2 GB). Free memory was 249.8 MB in the beginning and 6.0 GB in the end (delta: -5.7 GB). Peak memory consumption was 6.0 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 185 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 183 interpolants. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 779668.4ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 335.7ms, AutomataDifference: 524571.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1366.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 14701 SDtfs, 77411 SDslu, 298986 SDs, 0 SdLazy, 147789 SolverSat, 4156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 189587.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3779 GetRequests, 531 SyntacticMatches, 129 SemanticMatches, 3119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100415 ImplicationChecksByTransitivity, 435040.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 1949, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8979.2ms AutomataMinimizationTime, 36 MinimizatonAttempts, 105494 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 117.2ms SsaConstructionTime, 978.6ms SatisfiabilityAnalysisTime, 134001.7ms InterpolantComputationTime, 5594 NumberOfCodeBlocks, 5594 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5558 ConstructedInterpolants, 0 QuantifiedInterpolants, 383875 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