./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d61d37b92252d412fbccdc68a4003feabf5567d4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 21:48:37,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 21:48:37,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 21:48:37,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 21:48:37,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 21:48:37,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 21:48:37,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 21:48:37,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 21:48:37,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 21:48:37,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 21:48:37,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 21:48:37,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 21:48:37,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 21:48:37,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 21:48:37,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 21:48:37,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 21:48:37,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 21:48:37,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 21:48:37,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 21:48:37,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 21:48:37,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 21:48:37,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 21:48:37,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 21:48:37,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 21:48:37,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 21:48:37,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 21:48:37,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 21:48:37,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 21:48:37,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 21:48:37,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 21:48:37,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 21:48:37,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 21:48:37,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 21:48:37,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 21:48:37,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 21:48:37,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 21:48:37,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 21:48:37,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 21:48:37,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 21:48:37,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 21:48:37,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 21:48:37,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 21:48:37,736 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 21:48:37,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 21:48:37,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 21:48:37,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 21:48:37,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 21:48:37,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 21:48:37,739 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 21:48:37,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 21:48:37,740 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 21:48:37,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 21:48:37,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 21:48:37,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 21:48:37,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 21:48:37,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 21:48:37,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 21:48:37,742 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 21:48:37,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 21:48:37,742 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 21:48:37,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 21:48:37,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 21:48:37,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 21:48:37,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 21:48:37,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 21:48:37,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 21:48:37,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 21:48:37,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 21:48:37,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 21:48:37,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 21:48:37,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 21:48:37,745 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 21:48:37,745 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d61d37b92252d412fbccdc68a4003feabf5567d4 [2021-08-29 21:48:38,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 21:48:38,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 21:48:38,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 21:48:38,089 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 21:48:38,089 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 21:48:38,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longest.i [2021-08-29 21:48:38,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d15f36d/730b68361cfa4956b25710f687811d7b/FLAG9598d1699 [2021-08-29 21:48:38,723 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 21:48:38,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2021-08-29 21:48:38,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d15f36d/730b68361cfa4956b25710f687811d7b/FLAG9598d1699 [2021-08-29 21:48:39,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d15f36d/730b68361cfa4956b25710f687811d7b [2021-08-29 21:48:39,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 21:48:39,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 21:48:39,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 21:48:39,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 21:48:39,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 21:48:39,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42125173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39, skipping insertion in model container [2021-08-29 21:48:39,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 21:48:39,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 21:48:39,503 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2021-08-29 21:48:39,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2021-08-29 21:48:39,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2021-08-29 21:48:39,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 21:48:39,530 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 21:48:39,579 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2021-08-29 21:48:39,581 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2021-08-29 21:48:39,583 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2021-08-29 21:48:39,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 21:48:39,645 INFO L208 MainTranslator]: Completed translation [2021-08-29 21:48:39,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39 WrapperNode [2021-08-29 21:48:39,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 21:48:39,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 21:48:39,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 21:48:39,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 21:48:39,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 21:48:39,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 21:48:39,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 21:48:39,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 21:48:39,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 21:48:39,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 21:48:39,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 21:48:39,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 21:48:39,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (1/1) ... [2021-08-29 21:48:39,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 21:48:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 21:48:39,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 21:48:39,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 21:48:39,823 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-08-29 21:48:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-08-29 21:48:39,824 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 21:48:39,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 21:48:39,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 21:48:39,826 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-29 21:48:40,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 21:48:40,166 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-29 21:48:40,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:40 BoogieIcfgContainer [2021-08-29 21:48:40,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 21:48:40,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 21:48:40,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 21:48:40,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 21:48:40,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:48:39" (1/3) ... [2021-08-29 21:48:40,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785f5ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:48:40, skipping insertion in model container [2021-08-29 21:48:40,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:39" (2/3) ... [2021-08-29 21:48:40,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785f5ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:48:40, skipping insertion in model container [2021-08-29 21:48:40,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:40" (3/3) ... [2021-08-29 21:48:40,175 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2021-08-29 21:48:40,179 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 21:48:40,180 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 21:48:40,180 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-08-29 21:48:40,180 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 21:48:40,226 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,226 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,227 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,227 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,227 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,228 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,228 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,228 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,228 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,228 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,229 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,230 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,230 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,230 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,230 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,230 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,231 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,231 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,231 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,232 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,232 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,233 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,233 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,234 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,235 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,235 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,235 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,236 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,236 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,237 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,237 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,237 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,237 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,237 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,238 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,238 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,238 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,238 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,238 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,239 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,239 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,239 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,239 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,239 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,239 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,240 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,240 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,240 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,240 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,240 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,240 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,241 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,242 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,242 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,242 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,242 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,242 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,242 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,243 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,243 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,243 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,243 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,243 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,244 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,244 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,244 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,244 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,245 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,246 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,246 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,246 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,246 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,246 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,246 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,247 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,247 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,247 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,247 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,247 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,247 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,248 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,249 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,249 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,249 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,249 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,249 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,249 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,250 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,250 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,250 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,250 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,250 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,250 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,251 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,252 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,253 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,253 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,253 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,253 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,253 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,253 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,254 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,255 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,255 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,255 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,255 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,255 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,255 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,256 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,256 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,256 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,256 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,278 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,278 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,278 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,278 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,278 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,278 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,279 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,279 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,279 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,279 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,279 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,279 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,280 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,280 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,280 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,280 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,280 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,280 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,281 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,281 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,281 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,281 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,281 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,281 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,282 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,282 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,282 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,282 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,282 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,282 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,283 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,283 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,283 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,283 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,283 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,284 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,284 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,284 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,284 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,284 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,284 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,285 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,285 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,285 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,285 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,285 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,285 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,286 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,286 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,286 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,286 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,286 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,286 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,287 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,287 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,287 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,287 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,287 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,288 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,289 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,289 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,290 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,290 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,290 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,290 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,291 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,291 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,291 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,292 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,292 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,292 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,293 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,294 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,295 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,296 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,296 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,296 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,296 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,296 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,296 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,297 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,297 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,297 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,297 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,297 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,298 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,299 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,299 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,299 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,299 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,299 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,300 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,300 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,300 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,300 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,300 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,300 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,301 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,302 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,302 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,302 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,302 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,302 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,303 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,303 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,303 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,303 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,303 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,303 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,304 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,304 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,304 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,304 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,304 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,304 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,305 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,305 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,305 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,305 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,305 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,306 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,306 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,306 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,306 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,306 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,306 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,307 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,307 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,307 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,307 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,307 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,307 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,308 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,308 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,308 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,308 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,308 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,308 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,309 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,309 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,309 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,309 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,309 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,309 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,310 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,310 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,310 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,310 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,310 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,310 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,311 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,311 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,311 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,311 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,311 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,311 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,312 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,313 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,313 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,314 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,315 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,315 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,315 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,315 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,315 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,315 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,316 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,316 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,316 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,316 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,316 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,316 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,317 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,317 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,317 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,317 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,317 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,318 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,318 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,318 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,318 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,318 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,318 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,319 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,320 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,321 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,322 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,322 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,322 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,322 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,322 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,322 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,323 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,324 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,324 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,324 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,324 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,324 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,324 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,325 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,325 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,325 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,325 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,325 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,325 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,326 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,327 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,327 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,327 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,327 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,327 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,327 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,328 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,329 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,329 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,329 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,329 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,329 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,329 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,330 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,330 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,330 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,330 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,330 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,330 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,331 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,332 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,332 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,332 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,332 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,332 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,332 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,333 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,334 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,334 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,334 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,334 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,334 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,334 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,335 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,336 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,336 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,336 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,336 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,336 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,336 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,337 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,338 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,338 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,338 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,338 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,338 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,338 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,339 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,340 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,341 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,345 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,345 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,345 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,345 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,345 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,345 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,350 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,350 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,350 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,350 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,350 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,350 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,351 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,351 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,351 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,351 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,351 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,351 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,352 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,353 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,353 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,353 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,353 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,353 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,353 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,354 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,354 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,354 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,354 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,356 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,356 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,357 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,358 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,358 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,358 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,358 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,358 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,358 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,359 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 21:48:40,365 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-29 21:48:40,413 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 21:48:40,427 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 21:48:40,427 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-29 21:48:40,446 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 21:48:40,459 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 255 transitions, 526 flow [2021-08-29 21:48:40,462 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 255 transitions, 526 flow [2021-08-29 21:48:40,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 247 places, 255 transitions, 526 flow [2021-08-29 21:48:40,563 INFO L129 PetriNetUnfolder]: 15/253 cut-off events. [2021-08-29 21:48:40,566 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-08-29 21:48:40,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 15/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 358 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 182. Up to 2 conditions per place. [2021-08-29 21:48:40,592 INFO L116 LiptonReduction]: Number of co-enabled transitions 15600 [2021-08-29 21:48:57,897 INFO L131 LiptonReduction]: Checked pairs total: 30428 [2021-08-29 21:48:57,898 INFO L133 LiptonReduction]: Total number of compositions: 227 [2021-08-29 21:48:57,911 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 67 transitions, 150 flow [2021-08-29 21:48:57,958 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1055 states, 1050 states have (on average 2.800952380952381) internal successors, (2941), 1054 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 1055 states, 1050 states have (on average 2.800952380952381) internal successors, (2941), 1054 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-08-29 21:48:57,968 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:57,968 INFO L513 BasicCegarLoop]: trace histogram [1] [2021-08-29 21:48:57,968 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1006, now seen corresponding path program 1 times [2021-08-29 21:48:57,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:57,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705994011] [2021-08-29 21:48:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:57,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:48:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:48:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:48:58,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:48:58,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705994011] [2021-08-29 21:48:58,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705994011] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:48:58,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:48:58,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-08-29 21:48:58,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378590246] [2021-08-29 21:48:58,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-29 21:48:58,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:48:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-29 21:48:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-29 21:48:58,087 INFO L87 Difference]: Start difference. First operand has 1055 states, 1050 states have (on average 2.800952380952381) internal successors, (2941), 1054 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:48:58,134 INFO L93 Difference]: Finished difference Result 1054 states and 2844 transitions. [2021-08-29 21:48:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-29 21:48:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2021-08-29 21:48:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:48:58,155 INFO L225 Difference]: With dead ends: 1054 [2021-08-29 21:48:58,156 INFO L226 Difference]: Without dead ends: 1052 [2021-08-29 21:48:58,156 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.00ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-29 21:48:58,159 INFO L928 BasicCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.74ms IncrementalHoareTripleChecker+Time [2021-08-29 21:48:58,160 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 12.74ms Time] [2021-08-29 21:48:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-08-29 21:48:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2021-08-29 21:48:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1049 states have (on average 2.7063870352716872) internal successors, (2839), 1051 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2839 transitions. [2021-08-29 21:48:58,244 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2839 transitions. Word has length 1 [2021-08-29 21:48:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:48:58,244 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 2839 transitions. [2021-08-29 21:48:58,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2839 transitions. [2021-08-29 21:48:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 21:48:58,246 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:58,246 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:48:58,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 21:48:58,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1421396547, now seen corresponding path program 1 times [2021-08-29 21:48:58,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:58,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917099109] [2021-08-29 21:48:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:58,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:48:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:48:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:48:58,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:48:58,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917099109] [2021-08-29 21:48:58,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917099109] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:48:58,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:48:58,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 21:48:58,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052685406] [2021-08-29 21:48:58,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 21:48:58,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:48:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 21:48:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:48:58,362 INFO L87 Difference]: Start difference. First operand 1052 states and 2839 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:48:58,403 INFO L93 Difference]: Finished difference Result 1052 states and 2805 transitions. [2021-08-29 21:48:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 21:48:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-08-29 21:48:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:48:58,411 INFO L225 Difference]: With dead ends: 1052 [2021-08-29 21:48:58,411 INFO L226 Difference]: Without dead ends: 1052 [2021-08-29 21:48:58,411 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.90ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:48:58,417 INFO L928 BasicCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.90ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.72ms IncrementalHoareTripleChecker+Time [2021-08-29 21:48:58,417 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 107 Invalid, 31 Unknown, 0 Unchecked, 2.90ms Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 21.72ms Time] [2021-08-29 21:48:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-08-29 21:48:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2021-08-29 21:48:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1049 states have (on average 2.6739752144899906) internal successors, (2805), 1051 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2805 transitions. [2021-08-29 21:48:58,444 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2805 transitions. Word has length 11 [2021-08-29 21:48:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:48:58,444 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 2805 transitions. [2021-08-29 21:48:58,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2805 transitions. [2021-08-29 21:48:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 21:48:58,446 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:58,446 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:48:58,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 21:48:58,446 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1250736731, now seen corresponding path program 1 times [2021-08-29 21:48:58,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:58,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081581049] [2021-08-29 21:48:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:58,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:48:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:48:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:48:58,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:48:58,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081581049] [2021-08-29 21:48:58,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081581049] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:48:58,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:48:58,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 21:48:58,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779185959] [2021-08-29 21:48:58,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 21:48:58,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:48:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 21:48:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:48:58,574 INFO L87 Difference]: Start difference. First operand 1052 states and 2805 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:48:58,619 INFO L93 Difference]: Finished difference Result 924 states and 2406 transitions. [2021-08-29 21:48:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 21:48:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-08-29 21:48:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:48:58,625 INFO L225 Difference]: With dead ends: 924 [2021-08-29 21:48:58,626 INFO L226 Difference]: Without dead ends: 898 [2021-08-29 21:48:58,626 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.77ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:48:58,628 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.23ms IncrementalHoareTripleChecker+Time [2021-08-29 21:48:58,629 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 25 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 26.23ms Time] [2021-08-29 21:48:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-08-29 21:48:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2021-08-29 21:48:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 895 states have (on average 2.618994413407821) internal successors, (2344), 897 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 2344 transitions. [2021-08-29 21:48:58,655 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 2344 transitions. Word has length 13 [2021-08-29 21:48:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:48:58,655 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 2344 transitions. [2021-08-29 21:48:58,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 2344 transitions. [2021-08-29 21:48:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 21:48:58,661 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:58,661 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:48:58,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 21:48:58,664 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash 168552944, now seen corresponding path program 1 times [2021-08-29 21:48:58,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:58,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960448385] [2021-08-29 21:48:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:58,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:48:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:48:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:48:58,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:48:58,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960448385] [2021-08-29 21:48:58,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960448385] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:48:58,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:48:58,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 21:48:58,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562134835] [2021-08-29 21:48:58,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 21:48:58,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:48:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 21:48:58,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 21:48:58,842 INFO L87 Difference]: Start difference. First operand 898 states and 2344 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:48:59,003 INFO L93 Difference]: Finished difference Result 897 states and 2341 transitions. [2021-08-29 21:48:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 21:48:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-08-29 21:48:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:48:59,008 INFO L225 Difference]: With dead ends: 897 [2021-08-29 21:48:59,008 INFO L226 Difference]: Without dead ends: 897 [2021-08-29 21:48:59,009 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.21ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-29 21:48:59,011 INFO L928 BasicCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.69ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.65ms IncrementalHoareTripleChecker+Time [2021-08-29 21:48:59,013 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 164 Unknown, 0 Unchecked, 3.69ms Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 126.65ms Time] [2021-08-29 21:48:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-08-29 21:48:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2021-08-29 21:48:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 894 states have (on average 2.6185682326621924) internal successors, (2341), 896 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2341 transitions. [2021-08-29 21:48:59,036 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2341 transitions. Word has length 13 [2021-08-29 21:48:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:48:59,036 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 2341 transitions. [2021-08-29 21:48:59,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2341 transitions. [2021-08-29 21:48:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 21:48:59,037 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:59,038 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:48:59,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 21:48:59,038 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 232049695, now seen corresponding path program 1 times [2021-08-29 21:48:59,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:59,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654211867] [2021-08-29 21:48:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:59,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:48:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:48:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:48:59,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:48:59,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654211867] [2021-08-29 21:48:59,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654211867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:48:59,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:48:59,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 21:48:59,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094674057] [2021-08-29 21:48:59,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 21:48:59,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:48:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 21:48:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 21:48:59,217 INFO L87 Difference]: Start difference. First operand 897 states and 2341 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:48:59,409 INFO L93 Difference]: Finished difference Result 1014 states and 2633 transitions. [2021-08-29 21:48:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 21:48:59,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 21:48:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:48:59,415 INFO L225 Difference]: With dead ends: 1014 [2021-08-29 21:48:59,415 INFO L226 Difference]: Without dead ends: 1014 [2021-08-29 21:48:59,416 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.20ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 21:48:59,416 INFO L928 BasicCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.60ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.24ms IncrementalHoareTripleChecker+Time [2021-08-29 21:48:59,417 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 97 Invalid, 264 Unknown, 0 Unchecked, 1.60ms Time], IncrementalHoareTripleChecker [8 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 170.24ms Time] [2021-08-29 21:48:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-08-29 21:48:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 941. [2021-08-29 21:48:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 938 states have (on average 2.6108742004264394) internal successors, (2449), 940 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2449 transitions. [2021-08-29 21:48:59,440 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2449 transitions. Word has length 14 [2021-08-29 21:48:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:48:59,440 INFO L470 AbstractCegarLoop]: Abstraction has 941 states and 2449 transitions. [2021-08-29 21:48:59,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2449 transitions. [2021-08-29 21:48:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 21:48:59,441 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:59,441 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:48:59,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 21:48:59,441 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:59,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1795796853, now seen corresponding path program 2 times [2021-08-29 21:48:59,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:59,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279463660] [2021-08-29 21:48:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:59,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:48:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:48:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:48:59,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:48:59,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279463660] [2021-08-29 21:48:59,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279463660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:48:59,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:48:59,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 21:48:59,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550775189] [2021-08-29 21:48:59,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 21:48:59,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:48:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 21:48:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-29 21:48:59,694 INFO L87 Difference]: Start difference. First operand 941 states and 2449 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:48:59,963 INFO L93 Difference]: Finished difference Result 1039 states and 2685 transitions. [2021-08-29 21:48:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 21:48:59,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 21:48:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:48:59,968 INFO L225 Difference]: With dead ends: 1039 [2021-08-29 21:48:59,968 INFO L226 Difference]: Without dead ends: 1039 [2021-08-29 21:48:59,969 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 120.24ms TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-29 21:48:59,969 INFO L928 BasicCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 203.09ms IncrementalHoareTripleChecker+Time [2021-08-29 21:48:59,969 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 127 Invalid, 309 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [14 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 203.09ms Time] [2021-08-29 21:48:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-08-29 21:48:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 886. [2021-08-29 21:48:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 883 states have (on average 2.608154020385051) internal successors, (2303), 885 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2303 transitions. [2021-08-29 21:48:59,991 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2303 transitions. Word has length 14 [2021-08-29 21:48:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:48:59,991 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 2303 transitions. [2021-08-29 21:48:59,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:48:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2303 transitions. [2021-08-29 21:48:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 21:48:59,992 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:48:59,992 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:48:59,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 21:48:59,992 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:48:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:48:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2058735148, now seen corresponding path program 1 times [2021-08-29 21:48:59,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:48:59,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461147239] [2021-08-29 21:48:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:48:59,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:00,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:00,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461147239] [2021-08-29 21:49:00,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461147239] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:00,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:00,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 21:49:00,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429642960] [2021-08-29 21:49:00,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 21:49:00,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 21:49:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-29 21:49:00,206 INFO L87 Difference]: Start difference. First operand 886 states and 2303 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:00,505 INFO L93 Difference]: Finished difference Result 884 states and 2299 transitions. [2021-08-29 21:49:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 21:49:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 21:49:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:00,510 INFO L225 Difference]: With dead ends: 884 [2021-08-29 21:49:00,510 INFO L226 Difference]: Without dead ends: 884 [2021-08-29 21:49:00,511 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 112.57ms TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-29 21:49:00,511 INFO L928 BasicCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 198.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.53ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 239.82ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:00,511 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 385 Unknown, 0 Unchecked, 1.53ms Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 239.82ms Time] [2021-08-29 21:49:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-08-29 21:49:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2021-08-29 21:49:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 881 states have (on average 2.6095346197502836) internal successors, (2299), 883 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2299 transitions. [2021-08-29 21:49:00,539 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2299 transitions. Word has length 14 [2021-08-29 21:49:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:00,540 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 2299 transitions. [2021-08-29 21:49:00,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2299 transitions. [2021-08-29 21:49:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 21:49:00,541 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:00,541 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:49:00,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 21:49:00,541 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -90335867, now seen corresponding path program 1 times [2021-08-29 21:49:00,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:00,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211654727] [2021-08-29 21:49:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:00,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:00,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:00,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211654727] [2021-08-29 21:49:00,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211654727] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:00,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:00,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-29 21:49:00,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541967916] [2021-08-29 21:49:00,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 21:49:00,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 21:49:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-29 21:49:00,813 INFO L87 Difference]: Start difference. First operand 884 states and 2299 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:01,210 INFO L93 Difference]: Finished difference Result 971 states and 2519 transitions. [2021-08-29 21:49:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 21:49:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 21:49:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:01,215 INFO L225 Difference]: With dead ends: 971 [2021-08-29 21:49:01,215 INFO L226 Difference]: Without dead ends: 949 [2021-08-29 21:49:01,216 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 182.18ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-08-29 21:49:01,216 INFO L928 BasicCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 221.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.35ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 260.25ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:01,216 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 253 Invalid, 424 Unknown, 0 Unchecked, 2.35ms Time], IncrementalHoareTripleChecker [15 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 260.25ms Time] [2021-08-29 21:49:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-08-29 21:49:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 895. [2021-08-29 21:49:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 892 states have (on average 2.6065022421524664) internal successors, (2325), 894 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2325 transitions. [2021-08-29 21:49:01,238 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2325 transitions. Word has length 15 [2021-08-29 21:49:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:01,238 INFO L470 AbstractCegarLoop]: Abstraction has 895 states and 2325 transitions. [2021-08-29 21:49:01,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2325 transitions. [2021-08-29 21:49:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 21:49:01,239 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:01,239 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 21:49:01,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 21:49:01,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash 603699695, now seen corresponding path program 2 times [2021-08-29 21:49:01,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:01,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820666598] [2021-08-29 21:49:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:01,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:01,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:01,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820666598] [2021-08-29 21:49:01,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820666598] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:01,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:01,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-29 21:49:01,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692390827] [2021-08-29 21:49:01,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 21:49:01,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:01,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 21:49:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-29 21:49:01,490 INFO L87 Difference]: Start difference. First operand 895 states and 2325 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:01,781 INFO L93 Difference]: Finished difference Result 903 states and 2352 transitions. [2021-08-29 21:49:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 21:49:01,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 21:49:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:01,786 INFO L225 Difference]: With dead ends: 903 [2021-08-29 21:49:01,786 INFO L226 Difference]: Without dead ends: 897 [2021-08-29 21:49:01,786 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 151.10ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-29 21:49:01,787 INFO L928 BasicCegarLoop]: 54 mSDtfsCounter, 80 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.06ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 211.81ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:01,787 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 191 Invalid, 319 Unknown, 0 Unchecked, 2.06ms Time], IncrementalHoareTripleChecker [19 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 211.81ms Time] [2021-08-29 21:49:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-08-29 21:49:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 840. [2021-08-29 21:49:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 2.6126340882002386) internal successors, (2192), 839 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2192 transitions. [2021-08-29 21:49:01,808 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2192 transitions. Word has length 15 [2021-08-29 21:49:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:01,809 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 2192 transitions. [2021-08-29 21:49:01,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2192 transitions. [2021-08-29 21:49:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-29 21:49:01,811 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:01,811 INFO L513 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] [2021-08-29 21:49:01,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 21:49:01,811 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash -119872251, now seen corresponding path program 1 times [2021-08-29 21:49:01,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:01,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163193617] [2021-08-29 21:49:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:01,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:01,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:01,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163193617] [2021-08-29 21:49:01,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163193617] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:01,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:01,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 21:49:01,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20133035] [2021-08-29 21:49:01,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 21:49:01,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:01,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 21:49:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:49:01,845 INFO L87 Difference]: Start difference. First operand 840 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:01,873 INFO L93 Difference]: Finished difference Result 372 states and 799 transitions. [2021-08-29 21:49:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 21:49:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-08-29 21:49:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:01,875 INFO L225 Difference]: With dead ends: 372 [2021-08-29 21:49:01,875 INFO L226 Difference]: Without dead ends: 366 [2021-08-29 21:49:01,876 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:49:01,876 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.09ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:01,877 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 23.09ms Time] [2021-08-29 21:49:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-29 21:49:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 294. [2021-08-29 21:49:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.1774744027303754) internal successors, (638), 293 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 638 transitions. [2021-08-29 21:49:01,884 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 638 transitions. Word has length 35 [2021-08-29 21:49:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:01,885 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 638 transitions. [2021-08-29 21:49:01,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 638 transitions. [2021-08-29 21:49:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 21:49:01,887 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:01,888 INFO L513 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] [2021-08-29 21:49:01,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 21:49:01,888 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1412494809, now seen corresponding path program 1 times [2021-08-29 21:49:01,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:01,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000582124] [2021-08-29 21:49:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:01,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:02,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:02,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000582124] [2021-08-29 21:49:02,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000582124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:02,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:02,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-29 21:49:02,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690979781] [2021-08-29 21:49:02,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 21:49:02,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:02,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 21:49:02,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-29 21:49:02,494 INFO L87 Difference]: Start difference. First operand 294 states and 638 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:03,115 INFO L93 Difference]: Finished difference Result 405 states and 869 transitions. [2021-08-29 21:49:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 21:49:03,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-29 21:49:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:03,118 INFO L225 Difference]: With dead ends: 405 [2021-08-29 21:49:03,118 INFO L226 Difference]: Without dead ends: 405 [2021-08-29 21:49:03,118 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 387.57ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-08-29 21:49:03,119 INFO L928 BasicCegarLoop]: 35 mSDtfsCounter, 110 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 358.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.51ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 414.89ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:03,119 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 168 Invalid, 464 Unknown, 0 Unchecked, 2.51ms Time], IncrementalHoareTripleChecker [26 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 414.89ms Time] [2021-08-29 21:49:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-08-29 21:49:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 388. [2021-08-29 21:49:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 2.157622739018088) internal successors, (835), 387 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 835 transitions. [2021-08-29 21:49:03,127 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 835 transitions. Word has length 36 [2021-08-29 21:49:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:03,128 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 835 transitions. [2021-08-29 21:49:03,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 835 transitions. [2021-08-29 21:49:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 21:49:03,129 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:03,129 INFO L513 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] [2021-08-29 21:49:03,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 21:49:03,129 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:03,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:03,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1231752497, now seen corresponding path program 2 times [2021-08-29 21:49:03,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:03,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385828431] [2021-08-29 21:49:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:03,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:03,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:03,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385828431] [2021-08-29 21:49:03,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385828431] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:03,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:03,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-29 21:49:03,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942723927] [2021-08-29 21:49:03,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 21:49:03,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 21:49:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-29 21:49:03,623 INFO L87 Difference]: Start difference. First operand 388 states and 835 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:04,165 INFO L93 Difference]: Finished difference Result 464 states and 996 transitions. [2021-08-29 21:49:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 21:49:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-29 21:49:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:04,167 INFO L225 Difference]: With dead ends: 464 [2021-08-29 21:49:04,167 INFO L226 Difference]: Without dead ends: 464 [2021-08-29 21:49:04,168 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 345.14ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-08-29 21:49:04,168 INFO L928 BasicCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 299.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.62ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 351.19ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:04,168 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 171 Invalid, 475 Unknown, 0 Unchecked, 2.62ms Time], IncrementalHoareTripleChecker [28 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 351.19ms Time] [2021-08-29 21:49:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-29 21:49:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 363. [2021-08-29 21:49:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.1685082872928176) internal successors, (785), 362 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 785 transitions. [2021-08-29 21:49:04,177 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 785 transitions. Word has length 36 [2021-08-29 21:49:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:04,177 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 785 transitions. [2021-08-29 21:49:04,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 785 transitions. [2021-08-29 21:49:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 21:49:04,178 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:04,178 INFO L513 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] [2021-08-29 21:49:04,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 21:49:04,178 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:04,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:04,179 INFO L82 PathProgramCache]: Analyzing trace with hash 996652937, now seen corresponding path program 3 times [2021-08-29 21:49:04,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:04,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875838191] [2021-08-29 21:49:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:04,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:04,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:04,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875838191] [2021-08-29 21:49:04,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875838191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:04,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:04,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-29 21:49:04,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687875925] [2021-08-29 21:49:04,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 21:49:04,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:04,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 21:49:04,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-29 21:49:04,474 INFO L87 Difference]: Start difference. First operand 363 states and 785 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:04,895 INFO L93 Difference]: Finished difference Result 415 states and 892 transitions. [2021-08-29 21:49:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 21:49:04,895 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-29 21:49:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:04,897 INFO L225 Difference]: With dead ends: 415 [2021-08-29 21:49:04,897 INFO L226 Difference]: Without dead ends: 415 [2021-08-29 21:49:04,898 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 261.22ms TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:04,898 INFO L928 BasicCegarLoop]: 35 mSDtfsCounter, 113 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 218.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.02ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 263.11ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:04,898 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 152 Invalid, 413 Unknown, 0 Unchecked, 2.02ms Time], IncrementalHoareTripleChecker [34 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 263.11ms Time] [2021-08-29 21:49:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-08-29 21:49:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 334. [2021-08-29 21:49:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.165165165165165) internal successors, (721), 333 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 721 transitions. [2021-08-29 21:49:04,906 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 721 transitions. Word has length 36 [2021-08-29 21:49:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:04,906 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 721 transitions. [2021-08-29 21:49:04,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 721 transitions. [2021-08-29 21:49:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 21:49:04,908 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:04,908 INFO L513 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] [2021-08-29 21:49:04,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 21:49:04,908 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1560047577, now seen corresponding path program 4 times [2021-08-29 21:49:04,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:04,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313669689] [2021-08-29 21:49:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:04,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:05,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:05,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313669689] [2021-08-29 21:49:05,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313669689] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:05,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:05,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-29 21:49:05,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396984554] [2021-08-29 21:49:05,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-29 21:49:05,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-29 21:49:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-29 21:49:05,442 INFO L87 Difference]: Start difference. First operand 334 states and 721 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:06,190 INFO L93 Difference]: Finished difference Result 465 states and 992 transitions. [2021-08-29 21:49:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-29 21:49:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-29 21:49:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:06,192 INFO L225 Difference]: With dead ends: 465 [2021-08-29 21:49:06,192 INFO L226 Difference]: Without dead ends: 465 [2021-08-29 21:49:06,192 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 504.92ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-08-29 21:49:06,193 INFO L928 BasicCegarLoop]: 36 mSDtfsCounter, 99 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 373.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 429.85ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:06,193 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 160 Invalid, 472 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [59 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 429.85ms Time] [2021-08-29 21:49:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-08-29 21:49:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 334. [2021-08-29 21:49:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.165165165165165) internal successors, (721), 333 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 721 transitions. [2021-08-29 21:49:06,201 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 721 transitions. Word has length 36 [2021-08-29 21:49:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:06,201 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 721 transitions. [2021-08-29 21:49:06,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 721 transitions. [2021-08-29 21:49:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 21:49:06,202 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:06,202 INFO L513 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] [2021-08-29 21:49:06,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 21:49:06,203 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1629535990, now seen corresponding path program 1 times [2021-08-29 21:49:06,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:06,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404415217] [2021-08-29 21:49:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:06,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:06,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:06,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404415217] [2021-08-29 21:49:06,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404415217] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:06,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:06,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-29 21:49:06,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931324678] [2021-08-29 21:49:06,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-29 21:49:06,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:06,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-29 21:49:06,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-08-29 21:49:06,957 INFO L87 Difference]: Start difference. First operand 334 states and 721 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:07,691 INFO L93 Difference]: Finished difference Result 579 states and 1245 transitions. [2021-08-29 21:49:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-29 21:49:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-08-29 21:49:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:07,693 INFO L225 Difference]: With dead ends: 579 [2021-08-29 21:49:07,694 INFO L226 Difference]: Without dead ends: 579 [2021-08-29 21:49:07,694 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 589.61ms TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-08-29 21:49:07,694 INFO L928 BasicCegarLoop]: 30 mSDtfsCounter, 154 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 375.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 444.79ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:07,695 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 218 Invalid, 607 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [36 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 444.79ms Time] [2021-08-29 21:49:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-08-29 21:49:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 520. [2021-08-29 21:49:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 2.1714836223506744) internal successors, (1127), 519 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1127 transitions. [2021-08-29 21:49:07,706 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1127 transitions. Word has length 37 [2021-08-29 21:49:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:07,706 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 1127 transitions. [2021-08-29 21:49:07,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1127 transitions. [2021-08-29 21:49:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 21:49:07,708 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:07,708 INFO L513 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] [2021-08-29 21:49:07,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 21:49:07,708 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1381607378, now seen corresponding path program 2 times [2021-08-29 21:49:07,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:07,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568468525] [2021-08-29 21:49:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:07,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:08,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:08,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568468525] [2021-08-29 21:49:08,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568468525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:08,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:08,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-29 21:49:08,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884063851] [2021-08-29 21:49:08,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-29 21:49:08,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-29 21:49:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-08-29 21:49:08,446 INFO L87 Difference]: Start difference. First operand 520 states and 1127 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:09,213 INFO L93 Difference]: Finished difference Result 740 states and 1601 transitions. [2021-08-29 21:49:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-29 21:49:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-08-29 21:49:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:09,216 INFO L225 Difference]: With dead ends: 740 [2021-08-29 21:49:09,216 INFO L226 Difference]: Without dead ends: 740 [2021-08-29 21:49:09,216 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 557.07ms TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2021-08-29 21:49:09,217 INFO L928 BasicCegarLoop]: 30 mSDtfsCounter, 137 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 392.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.17ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 455.76ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:09,217 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 236 Invalid, 634 Unknown, 0 Unchecked, 3.17ms Time], IncrementalHoareTripleChecker [37 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 455.76ms Time] [2021-08-29 21:49:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-08-29 21:49:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 495. [2021-08-29 21:49:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 2.1801619433198383) internal successors, (1077), 494 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1077 transitions. [2021-08-29 21:49:09,230 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1077 transitions. Word has length 37 [2021-08-29 21:49:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:09,230 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1077 transitions. [2021-08-29 21:49:09,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1077 transitions. [2021-08-29 21:49:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 21:49:09,232 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:09,232 INFO L513 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] [2021-08-29 21:49:09,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 21:49:09,232 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash -79759146, now seen corresponding path program 3 times [2021-08-29 21:49:09,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:09,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011936394] [2021-08-29 21:49:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:09,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:09,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:09,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011936394] [2021-08-29 21:49:09,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011936394] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:09,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:09,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-29 21:49:09,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820413465] [2021-08-29 21:49:09,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-29 21:49:09,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-29 21:49:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-29 21:49:09,705 INFO L87 Difference]: Start difference. First operand 495 states and 1077 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:10,144 INFO L93 Difference]: Finished difference Result 651 states and 1414 transitions. [2021-08-29 21:49:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 21:49:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-08-29 21:49:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:10,147 INFO L225 Difference]: With dead ends: 651 [2021-08-29 21:49:10,147 INFO L226 Difference]: Without dead ends: 651 [2021-08-29 21:49:10,148 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 339.09ms TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2021-08-29 21:49:10,152 INFO L928 BasicCegarLoop]: 30 mSDtfsCounter, 199 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 220.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.49ms SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 272.49ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:10,153 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 166 Invalid, 468 Unknown, 0 Unchecked, 2.49ms Time], IncrementalHoareTripleChecker [64 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 272.49ms Time] [2021-08-29 21:49:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-08-29 21:49:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 433. [2021-08-29 21:49:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.185185185185185) internal successors, (944), 432 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 944 transitions. [2021-08-29 21:49:10,165 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 944 transitions. Word has length 37 [2021-08-29 21:49:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:10,166 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 944 transitions. [2021-08-29 21:49:10,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 944 transitions. [2021-08-29 21:49:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 21:49:10,167 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:10,167 INFO L513 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] [2021-08-29 21:49:10,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 21:49:10,167 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash 736137304, now seen corresponding path program 4 times [2021-08-29 21:49:10,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:10,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744745363] [2021-08-29 21:49:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:10,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:10,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:10,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744745363] [2021-08-29 21:49:10,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744745363] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:10,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:10,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-29 21:49:10,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401329265] [2021-08-29 21:49:10,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-29 21:49:10,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-29 21:49:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-08-29 21:49:10,677 INFO L87 Difference]: Start difference. First operand 433 states and 944 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:11,158 INFO L93 Difference]: Finished difference Result 577 states and 1257 transitions. [2021-08-29 21:49:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 21:49:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-08-29 21:49:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:11,160 INFO L225 Difference]: With dead ends: 577 [2021-08-29 21:49:11,160 INFO L226 Difference]: Without dead ends: 577 [2021-08-29 21:49:11,160 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 398.25ms TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2021-08-29 21:49:11,160 INFO L928 BasicCegarLoop]: 33 mSDtfsCounter, 167 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.73ms SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 269.59ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:11,161 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 176 Invalid, 481 Unknown, 0 Unchecked, 1.73ms Time], IncrementalHoareTripleChecker [54 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 269.59ms Time] [2021-08-29 21:49:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-08-29 21:49:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 440. [2021-08-29 21:49:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.1845102505694762) internal successors, (959), 439 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 959 transitions. [2021-08-29 21:49:11,170 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 959 transitions. Word has length 37 [2021-08-29 21:49:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:11,170 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 959 transitions. [2021-08-29 21:49:11,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 959 transitions. [2021-08-29 21:49:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:11,171 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:11,172 INFO L513 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] [2021-08-29 21:49:11,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 21:49:11,172 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1022202648, now seen corresponding path program 1 times [2021-08-29 21:49:11,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:11,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590205173] [2021-08-29 21:49:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:11,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:12,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:12,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590205173] [2021-08-29 21:49:12,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590205173] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:12,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:12,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:12,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618856931] [2021-08-29 21:49:12,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:12,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:12,511 INFO L87 Difference]: Start difference. First operand 440 states and 959 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:15,199 INFO L93 Difference]: Finished difference Result 852 states and 1849 transitions. [2021-08-29 21:49:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-29 21:49:15,199 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:15,202 INFO L225 Difference]: With dead ends: 852 [2021-08-29 21:49:15,202 INFO L226 Difference]: Without dead ends: 820 [2021-08-29 21:49:15,203 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1917.91ms TimeCoverageRelationStatistics Valid=270, Invalid=1800, Unknown=0, NotChecked=0, Total=2070 [2021-08-29 21:49:15,204 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 296 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1099.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.70ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1270.28ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:15,204 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 224 Invalid, 1708 Unknown, 0 Unchecked, 5.70ms Time], IncrementalHoareTripleChecker [61 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 1270.28ms Time] [2021-08-29 21:49:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-08-29 21:49:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 584. [2021-08-29 21:49:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 2.1869639794168094) internal successors, (1275), 583 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1275 transitions. [2021-08-29 21:49:15,219 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1275 transitions. Word has length 38 [2021-08-29 21:49:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:15,219 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 1275 transitions. [2021-08-29 21:49:15,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1275 transitions. [2021-08-29 21:49:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:15,220 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:15,220 INFO L513 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] [2021-08-29 21:49:15,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 21:49:15,221 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash -662570692, now seen corresponding path program 2 times [2021-08-29 21:49:15,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:15,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476709903] [2021-08-29 21:49:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:15,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:16,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:16,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476709903] [2021-08-29 21:49:16,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476709903] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:16,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:16,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:16,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016936998] [2021-08-29 21:49:16,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:16,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:16,233 INFO L87 Difference]: Start difference. First operand 584 states and 1275 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:17,921 INFO L93 Difference]: Finished difference Result 802 states and 1731 transitions. [2021-08-29 21:49:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-29 21:49:17,922 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:17,927 INFO L225 Difference]: With dead ends: 802 [2021-08-29 21:49:17,927 INFO L226 Difference]: Without dead ends: 770 [2021-08-29 21:49:17,928 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1147.25ms TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-08-29 21:49:17,930 INFO L928 BasicCegarLoop]: 48 mSDtfsCounter, 161 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 789.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.78ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 931.92ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:17,931 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 298 Invalid, 1678 Unknown, 0 Unchecked, 4.78ms Time], IncrementalHoareTripleChecker [42 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 931.92ms Time] [2021-08-29 21:49:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-08-29 21:49:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 589. [2021-08-29 21:49:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 2.185374149659864) internal successors, (1285), 588 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1285 transitions. [2021-08-29 21:49:17,956 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1285 transitions. Word has length 38 [2021-08-29 21:49:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:17,957 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 1285 transitions. [2021-08-29 21:49:17,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1285 transitions. [2021-08-29 21:49:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:17,958 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:17,959 INFO L513 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] [2021-08-29 21:49:17,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 21:49:17,959 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 195776116, now seen corresponding path program 3 times [2021-08-29 21:49:17,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:17,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658784128] [2021-08-29 21:49:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:17,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:19,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:19,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658784128] [2021-08-29 21:49:19,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658784128] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:19,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:19,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:19,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841494445] [2021-08-29 21:49:19,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:19,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:19,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:19,038 INFO L87 Difference]: Start difference. First operand 589 states and 1285 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:20,907 INFO L93 Difference]: Finished difference Result 747 states and 1612 transitions. [2021-08-29 21:49:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-29 21:49:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:20,909 INFO L225 Difference]: With dead ends: 747 [2021-08-29 21:49:20,910 INFO L226 Difference]: Without dead ends: 715 [2021-08-29 21:49:20,910 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1205.29ms TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2021-08-29 21:49:20,911 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 143 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 895.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.76ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1065.22ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:20,911 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 271 Invalid, 1928 Unknown, 0 Unchecked, 4.76ms Time], IncrementalHoareTripleChecker [37 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1065.22ms Time] [2021-08-29 21:49:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2021-08-29 21:49:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 591. [2021-08-29 21:49:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 2.183050847457627) internal successors, (1288), 590 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1288 transitions. [2021-08-29 21:49:20,923 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1288 transitions. Word has length 38 [2021-08-29 21:49:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:20,924 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 1288 transitions. [2021-08-29 21:49:20,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1288 transitions. [2021-08-29 21:49:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:20,925 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:20,925 INFO L513 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] [2021-08-29 21:49:20,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-29 21:49:20,926 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1197515864, now seen corresponding path program 4 times [2021-08-29 21:49:20,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:20,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989180128] [2021-08-29 21:49:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:20,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:22,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:22,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989180128] [2021-08-29 21:49:22,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989180128] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:22,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:22,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:22,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818592021] [2021-08-29 21:49:22,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:22,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:22,027 INFO L87 Difference]: Start difference. First operand 591 states and 1288 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:23,697 INFO L93 Difference]: Finished difference Result 757 states and 1627 transitions. [2021-08-29 21:49:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-29 21:49:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:23,700 INFO L225 Difference]: With dead ends: 757 [2021-08-29 21:49:23,700 INFO L226 Difference]: Without dead ends: 725 [2021-08-29 21:49:23,700 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1244.17ms TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2021-08-29 21:49:23,701 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 170 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 726.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.82ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 841.61ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:23,701 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 196 Invalid, 1479 Unknown, 0 Unchecked, 3.82ms Time], IncrementalHoareTripleChecker [44 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 841.61ms Time] [2021-08-29 21:49:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-08-29 21:49:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 599. [2021-08-29 21:49:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 2.1739130434782608) internal successors, (1300), 598 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1300 transitions. [2021-08-29 21:49:23,714 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1300 transitions. Word has length 38 [2021-08-29 21:49:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:23,714 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 1300 transitions. [2021-08-29 21:49:23,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1300 transitions. [2021-08-29 21:49:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:23,716 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:23,716 INFO L513 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] [2021-08-29 21:49:23,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-29 21:49:23,716 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1917232534, now seen corresponding path program 5 times [2021-08-29 21:49:23,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:23,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608374925] [2021-08-29 21:49:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:23,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:24,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:24,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608374925] [2021-08-29 21:49:24,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608374925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:24,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:24,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:24,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790604637] [2021-08-29 21:49:24,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:24,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:24,812 INFO L87 Difference]: Start difference. First operand 599 states and 1300 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:26,431 INFO L93 Difference]: Finished difference Result 767 states and 1642 transitions. [2021-08-29 21:49:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-29 21:49:26,432 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:26,434 INFO L225 Difference]: With dead ends: 767 [2021-08-29 21:49:26,434 INFO L226 Difference]: Without dead ends: 735 [2021-08-29 21:49:26,435 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1217.02ms TimeCoverageRelationStatistics Valid=206, Invalid=1434, Unknown=0, NotChecked=0, Total=1640 [2021-08-29 21:49:26,435 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 156 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 700.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.60ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 825.44ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:26,435 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 218 Invalid, 1503 Unknown, 0 Unchecked, 3.60ms Time], IncrementalHoareTripleChecker [40 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 825.44ms Time] [2021-08-29 21:49:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-08-29 21:49:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 601. [2021-08-29 21:49:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 2.171666666666667) internal successors, (1303), 600 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1303 transitions. [2021-08-29 21:49:26,482 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1303 transitions. Word has length 38 [2021-08-29 21:49:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:26,482 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 1303 transitions. [2021-08-29 21:49:26,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1303 transitions. [2021-08-29 21:49:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:26,484 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:26,484 INFO L513 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] [2021-08-29 21:49:26,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-29 21:49:26,485 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1639082564, now seen corresponding path program 6 times [2021-08-29 21:49:26,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:26,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366890736] [2021-08-29 21:49:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:26,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:27,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:27,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366890736] [2021-08-29 21:49:27,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366890736] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:27,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:27,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:27,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45809973] [2021-08-29 21:49:27,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:27,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:27,491 INFO L87 Difference]: Start difference. First operand 601 states and 1303 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:29,117 INFO L93 Difference]: Finished difference Result 775 states and 1656 transitions. [2021-08-29 21:49:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-29 21:49:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:29,120 INFO L225 Difference]: With dead ends: 775 [2021-08-29 21:49:29,120 INFO L226 Difference]: Without dead ends: 743 [2021-08-29 21:49:29,121 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1162.33ms TimeCoverageRelationStatistics Valid=211, Invalid=1429, Unknown=0, NotChecked=0, Total=1640 [2021-08-29 21:49:29,121 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 140 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 736.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.48ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 855.35ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:29,122 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 200 Invalid, 1552 Unknown, 0 Unchecked, 3.48ms Time], IncrementalHoareTripleChecker [37 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 855.35ms Time] [2021-08-29 21:49:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2021-08-29 21:49:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 605. [2021-08-29 21:49:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 2.1705298013245033) internal successors, (1311), 604 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1311 transitions. [2021-08-29 21:49:29,133 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1311 transitions. Word has length 38 [2021-08-29 21:49:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:29,133 INFO L470 AbstractCegarLoop]: Abstraction has 605 states and 1311 transitions. [2021-08-29 21:49:29,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1311 transitions. [2021-08-29 21:49:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:29,135 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:29,135 INFO L513 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] [2021-08-29 21:49:29,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-29 21:49:29,136 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 121633456, now seen corresponding path program 7 times [2021-08-29 21:49:29,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:29,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971273631] [2021-08-29 21:49:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:29,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:30,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:30,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971273631] [2021-08-29 21:49:30,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971273631] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:30,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:30,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:30,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341601856] [2021-08-29 21:49:30,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:30,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:30,336 INFO L87 Difference]: Start difference. First operand 605 states and 1311 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:33,728 INFO L93 Difference]: Finished difference Result 1089 states and 2356 transitions. [2021-08-29 21:49:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-29 21:49:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:33,732 INFO L225 Difference]: With dead ends: 1089 [2021-08-29 21:49:33,732 INFO L226 Difference]: Without dead ends: 1057 [2021-08-29 21:49:33,733 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2659.22ms TimeCoverageRelationStatistics Valid=315, Invalid=2135, Unknown=0, NotChecked=0, Total=2450 [2021-08-29 21:49:33,733 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 285 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1081.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.09ms SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1242.78ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:33,733 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 250 Invalid, 1829 Unknown, 0 Unchecked, 4.09ms Time], IncrementalHoareTripleChecker [66 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1242.78ms Time] [2021-08-29 21:49:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-08-29 21:49:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 587. [2021-08-29 21:49:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 2.1655290102389078) internal successors, (1269), 586 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1269 transitions. [2021-08-29 21:49:33,746 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1269 transitions. Word has length 38 [2021-08-29 21:49:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:33,747 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 1269 transitions. [2021-08-29 21:49:33,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1269 transitions. [2021-08-29 21:49:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:33,748 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:33,748 INFO L513 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] [2021-08-29 21:49:33,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-29 21:49:33,749 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1824222984, now seen corresponding path program 8 times [2021-08-29 21:49:33,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:33,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029307047] [2021-08-29 21:49:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:33,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:34,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:34,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029307047] [2021-08-29 21:49:34,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029307047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:34,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:34,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-29 21:49:34,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521406807] [2021-08-29 21:49:34,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-29 21:49:34,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-29 21:49:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-08-29 21:49:34,697 INFO L87 Difference]: Start difference. First operand 587 states and 1269 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:37,097 INFO L93 Difference]: Finished difference Result 1035 states and 2233 transitions. [2021-08-29 21:49:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-29 21:49:37,097 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:37,100 INFO L225 Difference]: With dead ends: 1035 [2021-08-29 21:49:37,100 INFO L226 Difference]: Without dead ends: 1003 [2021-08-29 21:49:37,101 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1855.96ms TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2021-08-29 21:49:37,101 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 276 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 805.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.07ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 939.57ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:37,102 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 187 Invalid, 1636 Unknown, 0 Unchecked, 4.07ms Time], IncrementalHoareTripleChecker [82 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 939.57ms Time] [2021-08-29 21:49:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-08-29 21:49:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 581. [2021-08-29 21:49:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 2.163793103448276) internal successors, (1255), 580 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1255 transitions. [2021-08-29 21:49:37,115 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1255 transitions. Word has length 38 [2021-08-29 21:49:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:37,115 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 1255 transitions. [2021-08-29 21:49:37,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1255 transitions. [2021-08-29 21:49:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:37,116 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:37,116 INFO L513 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] [2021-08-29 21:49:37,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-29 21:49:37,117 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 508730746, now seen corresponding path program 9 times [2021-08-29 21:49:37,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:37,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838551392] [2021-08-29 21:49:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:37,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:38,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:38,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838551392] [2021-08-29 21:49:38,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838551392] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:38,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:38,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:38,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557577280] [2021-08-29 21:49:38,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:38,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:38,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:38,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:38,531 INFO L87 Difference]: Start difference. First operand 581 states and 1255 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:41,556 INFO L93 Difference]: Finished difference Result 997 states and 2150 transitions. [2021-08-29 21:49:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-29 21:49:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:41,558 INFO L225 Difference]: With dead ends: 997 [2021-08-29 21:49:41,558 INFO L226 Difference]: Without dead ends: 965 [2021-08-29 21:49:41,559 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2668.13ms TimeCoverageRelationStatistics Valid=307, Invalid=2045, Unknown=0, NotChecked=0, Total=2352 [2021-08-29 21:49:41,559 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 297 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 826.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.59ms SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 956.82ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:41,559 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 188 Invalid, 1622 Unknown, 0 Unchecked, 3.59ms Time], IncrementalHoareTripleChecker [86 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 956.82ms Time] [2021-08-29 21:49:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-08-29 21:49:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 591. [2021-08-29 21:49:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 2.1610169491525424) internal successors, (1275), 590 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1275 transitions. [2021-08-29 21:49:41,571 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1275 transitions. Word has length 38 [2021-08-29 21:49:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:41,571 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 1275 transitions. [2021-08-29 21:49:41,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1275 transitions. [2021-08-29 21:49:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 21:49:41,573 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:41,573 INFO L513 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] [2021-08-29 21:49:41,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-29 21:49:41,573 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1388135962, now seen corresponding path program 10 times [2021-08-29 21:49:41,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:41,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553700370] [2021-08-29 21:49:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:41,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:42,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:42,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553700370] [2021-08-29 21:49:42,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553700370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:42,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:42,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:42,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917127927] [2021-08-29 21:49:42,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:42,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:42,598 INFO L87 Difference]: Start difference. First operand 591 states and 1275 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:44,078 INFO L93 Difference]: Finished difference Result 853 states and 1815 transitions. [2021-08-29 21:49:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-29 21:49:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-08-29 21:49:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:44,080 INFO L225 Difference]: With dead ends: 853 [2021-08-29 21:49:44,080 INFO L226 Difference]: Without dead ends: 821 [2021-08-29 21:49:44,081 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1106.48ms TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2021-08-29 21:49:44,081 INFO L928 BasicCegarLoop]: 48 mSDtfsCounter, 179 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 679.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.53ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 789.61ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:44,081 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 254 Invalid, 1458 Unknown, 0 Unchecked, 3.53ms Time], IncrementalHoareTripleChecker [47 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 789.61ms Time] [2021-08-29 21:49:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-08-29 21:49:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 588. [2021-08-29 21:49:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 2.160136286201022) internal successors, (1268), 587 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1268 transitions. [2021-08-29 21:49:44,094 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1268 transitions. Word has length 38 [2021-08-29 21:49:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:44,094 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 1268 transitions. [2021-08-29 21:49:44,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1268 transitions. [2021-08-29 21:49:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 21:49:44,096 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:44,096 INFO L513 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] [2021-08-29 21:49:44,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-29 21:49:44,096 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1798240810, now seen corresponding path program 1 times [2021-08-29 21:49:44,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:44,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590113414] [2021-08-29 21:49:44,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:44,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:45,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:45,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590113414] [2021-08-29 21:49:45,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590113414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:45,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:45,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-29 21:49:45,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886005784] [2021-08-29 21:49:45,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-29 21:49:45,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-29 21:49:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-08-29 21:49:45,025 INFO L87 Difference]: Start difference. First operand 588 states and 1268 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:47,388 INFO L93 Difference]: Finished difference Result 936 states and 2019 transitions. [2021-08-29 21:49:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-29 21:49:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-08-29 21:49:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:47,390 INFO L225 Difference]: With dead ends: 936 [2021-08-29 21:49:47,390 INFO L226 Difference]: Without dead ends: 904 [2021-08-29 21:49:47,391 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1748.93ms TimeCoverageRelationStatistics Valid=384, Invalid=2268, Unknown=0, NotChecked=0, Total=2652 [2021-08-29 21:49:47,392 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 300 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 868.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.24ms SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1011.23ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:47,392 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 238 Invalid, 1883 Unknown, 0 Unchecked, 5.24ms Time], IncrementalHoareTripleChecker [90 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1011.23ms Time] [2021-08-29 21:49:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-08-29 21:49:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 590. [2021-08-29 21:49:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 2.161290322580645) internal successors, (1273), 589 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1273 transitions. [2021-08-29 21:49:47,405 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1273 transitions. Word has length 39 [2021-08-29 21:49:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:47,405 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 1273 transitions. [2021-08-29 21:49:47,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1273 transitions. [2021-08-29 21:49:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-29 21:49:47,407 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:47,407 INFO L513 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] [2021-08-29 21:49:47,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-29 21:49:47,407 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1444219410, now seen corresponding path program 1 times [2021-08-29 21:49:47,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:47,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034758128] [2021-08-29 21:49:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:47,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 21:49:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 21:49:47,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 21:49:47,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034758128] [2021-08-29 21:49:47,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034758128] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 21:49:47,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 21:49:47,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 21:49:47,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247267037] [2021-08-29 21:49:47,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 21:49:47,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 21:49:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 21:49:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:49:47,440 INFO L87 Difference]: Start difference. First operand 590 states and 1273 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 21:49:47,464 INFO L93 Difference]: Finished difference Result 650 states and 1393 transitions. [2021-08-29 21:49:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 21:49:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-08-29 21:49:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 21:49:47,466 INFO L225 Difference]: With dead ends: 650 [2021-08-29 21:49:47,466 INFO L226 Difference]: Without dead ends: 608 [2021-08-29 21:49:47,466 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.86ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 21:49:47,467 INFO L928 BasicCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.22ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.14ms IncrementalHoareTripleChecker+Time [2021-08-29 21:49:47,467 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.22ms Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 20.14ms Time] [2021-08-29 21:49:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-08-29 21:49:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 564. [2021-08-29 21:49:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 2.1474245115452932) internal successors, (1209), 563 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1209 transitions. [2021-08-29 21:49:47,478 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1209 transitions. Word has length 40 [2021-08-29 21:49:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 21:49:47,478 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 1209 transitions. [2021-08-29 21:49:47,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 21:49:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1209 transitions. [2021-08-29 21:49:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-29 21:49:47,480 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 21:49:47,480 INFO L513 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] [2021-08-29 21:49:47,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-29 21:49:47,480 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-29 21:49:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 21:49:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1536499998, now seen corresponding path program 2 times [2021-08-29 21:49:47,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 21:49:47,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969347991] [2021-08-29 21:49:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 21:49:47,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 21:49:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 21:49:47,534 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 21:49:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 21:49:47,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 21:49:47,645 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 21:49:47,645 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-08-29 21:49:47,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-08-29 21:49:47,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-08-29 21:49:47,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-08-29 21:49:47,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-08-29 21:49:47,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-08-29 21:49:47,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-08-29 21:49:47,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-29 21:49:47,656 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 21:49:47,656 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 21:49:47,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 09:49:47 BasicIcfg [2021-08-29 21:49:47,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 21:49:47,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 21:49:47,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 21:49:47,754 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 21:49:47,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:40" (3/4) ... [2021-08-29 21:49:47,756 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 21:49:47,828 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 21:49:47,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 21:49:47,828 INFO L158 Benchmark]: Toolchain (without parser) took 68797.14ms. Allocated memory was 58.7MB in the beginning and 234.9MB in the end (delta: 176.2MB). Free memory was 34.7MB in the beginning and 124.2MB in the end (delta: -89.4MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,829 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 39.1MB in the beginning and 39.1MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 21:49:47,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.99ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.6MB in the beginning and 46.9MB in the end (delta: -12.4MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.42ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 43.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,829 INFO L158 Benchmark]: Boogie Preprocessor took 48.12ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 41.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,830 INFO L158 Benchmark]: RCFGBuilder took 402.83ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 43.7MB in the end (delta: -1.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,830 INFO L158 Benchmark]: TraceAbstraction took 67583.19ms. Allocated memory was 71.3MB in the beginning and 234.9MB in the end (delta: 163.6MB). Free memory was 43.0MB in the beginning and 149.3MB in the end (delta: -106.3MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,830 INFO L158 Benchmark]: Witness Printer took 74.33ms. Allocated memory is still 234.9MB. Free memory was 149.3MB in the beginning and 124.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-08-29 21:49:47,831 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.15ms. Allocated memory is still 58.7MB. Free memory was 39.1MB in the beginning and 39.1MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.99ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.6MB in the beginning and 46.9MB in the end (delta: -12.4MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.42ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 43.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.12ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 41.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.83ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 43.7MB in the end (delta: -1.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67583.19ms. Allocated memory was 71.3MB in the beginning and 234.9MB in the end (delta: 163.6MB). Free memory was 43.0MB in the beginning and 149.3MB in the end (delta: -106.3MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. * Witness Printer took 74.33ms. Allocated memory is still 234.9MB. Free memory was 149.3MB in the beginning and 124.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17436.46ms, 247 PlacesBefore, 64 PlacesAfterwards, 255 TransitionsBefore, 67 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 124 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 24 ConcurrentYvCompositions, 5 ChoiceCompositions, 227 TotalNumberOfCompositions, 30428 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14906, positive: 14332, positive conditional: 0, positive unconditional: 14332, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10376, positive: 10183, positive conditional: 0, positive unconditional: 10183, negative: 193, negative conditional: 0, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10376, positive: 10150, positive conditional: 0, positive unconditional: 10150, negative: 226, negative conditional: 0, negative unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 226, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 193, negative conditional: 0, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 371, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 348, negative conditional: 0, negative unconditional: 348, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14906, positive: 4149, positive conditional: 0, positive unconditional: 4149, negative: 381, negative conditional: 0, negative unconditional: 381, unknown: 10376, unknown conditional: 0, unknown unconditional: 10376] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 478, Positive conditional cache size: 0, Positive unconditional cache size: 478, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(800)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1007] 1 int value, i; [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L980] EXPR 1 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L980] 1 q->element[q->tail] = x VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L981] EXPR 1 q->amount VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L988] 1 q->tail++ [L990] 1 return 0; [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L960] EXPR 1 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1037] COND TRUE 2 i<(800) [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1037] 2 i++ VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1018] COND TRUE 1 i<((800)-1) [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L980] EXPR 1 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L981] 1 q->amount++ [L982] EXPR 1 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L990] 1 return 0; VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1025] 1 stored_elements[i+1]=value VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1026] 1 enqueue_flag=(0) VAL [dequeue_flag=0, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1027] 1 dequeue_flag=(1) VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={14:0}] [L1037] COND TRUE 2 i<(800) [L1040] COND TRUE 2 \read(dequeue_flag) [L994] 2 int x; [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={14:0}] [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={14:0}] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={14:0}] [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (800)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1003] 2 return x; [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={14:0}] - UnprovableResult [Line: 1059]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 67240.77ms, OverallIterations: 31, TraceHistogramMax: 1, EmptinessCheckTime: 45.09ms, AutomataDifference: 30608.25ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 17530.72ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3890 SdHoareTripleChecker+Valid, 14947.27ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3890 mSDsluCounter, 5187 SdHoareTripleChecker+Invalid, 12764.93ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6584 mSDsCounter, 1048 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23231 IncrementalHoareTripleChecker+Invalid, 24279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1048 mSolverCounterUnsat, 1198 mSDtfsCounter, 23231 mSolverCounterSat, 85.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 100 SyntacticMatches, 53 SemanticMatches, 678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5072 ImplicationChecksByTransitivity, 21972.19ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1055occurred in iteration=0, InterpolantAutomatonStates: 535, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 526.02ms AutomataMinimizationTime, 30 MinimizatonAttempts, 4194 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 67.44ms SsaConstructionTime, 760.94ms SatisfiabilityAnalysisTime, 17256.86ms InterpolantComputationTime, 936 NumberOfCodeBlocks, 936 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 866 ConstructedInterpolants, 0 QuantifiedInterpolants, 32678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 21:49:47,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...