/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 12:11:43,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 12:11:43,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 12:11:43,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 12:11:43,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 12:11:43,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 12:11:43,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 12:11:43,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 12:11:43,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 12:11:43,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 12:11:43,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 12:11:43,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 12:11:43,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 12:11:43,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 12:11:43,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 12:11:43,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 12:11:43,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 12:11:43,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 12:11:43,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 12:11:43,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 12:11:43,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 12:11:43,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 12:11:43,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 12:11:43,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 12:11:43,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 12:11:43,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 12:11:43,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 12:11:43,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 12:11:43,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 12:11:43,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 12:11:43,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 12:11:43,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 12:11:43,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 12:11:43,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 12:11:43,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 12:11:43,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 12:11:43,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 12:11:43,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 12:11:43,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 12:11:43,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 12:11:43,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 12:11:43,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-01-10 12:11:43,646 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 12:11:43,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 12:11:43,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 12:11:43,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 12:11:43,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 12:11:43,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 12:11:43,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 12:11:43,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 12:11:43,648 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 12:11:43,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 12:11:43,649 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 12:11:43,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 12:11:43,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 12:11:43,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 12:11:43,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 12:11:43,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 12:11:43,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 12:11:43,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 12:11:43,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 12:11:43,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 12:11:43,652 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 12:11:43,652 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 12:11:43,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 12:11:43,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 12:11:43,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 12:11:43,850 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 12:11:43,850 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 12:11:43,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-01-10 12:11:44,866 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 12:11:45,074 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 12:11:45,074 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-01-10 12:11:45,087 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96026b17/d1d16484805e42a3b5383451703af761/FLAG899ad3a74 [2023-01-10 12:11:45,096 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96026b17/d1d16484805e42a3b5383451703af761 [2023-01-10 12:11:45,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 12:11:45,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 12:11:45,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 12:11:45,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 12:11:45,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 12:11:45,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d16567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45, skipping insertion in model container [2023-01-10 12:11:45,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 12:11:45,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 12:11:45,455 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-01-10 12:11:45,459 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-01-10 12:11:45,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 12:11:45,471 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 12:11:45,526 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-01-10 12:11:45,528 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-01-10 12:11:45,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 12:11:45,564 INFO L208 MainTranslator]: Completed translation [2023-01-10 12:11:45,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45 WrapperNode [2023-01-10 12:11:45,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 12:11:45,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 12:11:45,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 12:11:45,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 12:11:45,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,605 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-01-10 12:11:45,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 12:11:45,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 12:11:45,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 12:11:45,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 12:11:45,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,641 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 12:11:45,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 12:11:45,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 12:11:45,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 12:11:45,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (1/1) ... [2023-01-10 12:11:45,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 12:11:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:45,675 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) [2023-01-10 12:11:45,695 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 [2023-01-10 12:11:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-01-10 12:11:45,721 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-01-10 12:11:45,721 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-01-10 12:11:45,721 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-01-10 12:11:45,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 12:11:45,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 12:11:45,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 12:11:45,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 12:11:45,722 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-10 12:11:45,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 12:11:45,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 12:11:45,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 12:11:45,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 12:11:45,724 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 12:11:45,869 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 12:11:45,870 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 12:11:46,158 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 12:11:46,168 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 12:11:46,168 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-10 12:11:46,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:11:46 BoogieIcfgContainer [2023-01-10 12:11:46,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 12:11:46,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 12:11:46,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 12:11:46,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 12:11:46,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:11:45" (1/3) ... [2023-01-10 12:11:46,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dc7a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:11:46, skipping insertion in model container [2023-01-10 12:11:46,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:45" (2/3) ... [2023-01-10 12:11:46,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dc7a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:11:46, skipping insertion in model container [2023-01-10 12:11:46,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:11:46" (3/3) ... [2023-01-10 12:11:46,176 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-01-10 12:11:46,186 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 12:11:46,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 12:11:46,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-10 12:11:46,194 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 12:11:46,293 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-10 12:11:46,324 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:11:46,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:46,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:11:46,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-01-10 12:11:46,366 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:11:46,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:11:46,376 INFO L357 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b29fb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:11:46,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-01-10 12:11:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328207138] [2023-01-10 12:11:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328207138] [2023-01-10 12:11:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328207138] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:11:46,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 12:11:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 12:11:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216370995] [2023-01-10 12:11:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:11:46,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 12:11:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:46,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 12:11:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 12:11:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:46,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:46,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:46,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:46,624 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:11:46,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 12:11:46,632 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-10 12:11:46,634 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/5) [2023-01-10 12:11:46,638 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:11:46,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:46,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:11:46,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-01-10 12:11:46,687 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:11:46,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 12:11:46,688 INFO L357 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b29fb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:11:46,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 12:11:46,700 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:11:46,700 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/5) [2023-01-10 12:11:46,703 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:11:46,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:46,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:11:46,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-01-10 12:11:46,710 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:11:46,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 12:11:46,711 INFO L357 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b29fb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:11:46,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 12:11:46,861 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:11:46,862 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/5) [2023-01-10 12:11:46,867 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:11:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:46,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:11:46,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-01-10 12:11:46,876 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:11:46,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:11:46,877 INFO L357 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b29fb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:11:46,877 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 12:11:46,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:11:46,878 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:11:46,878 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/5) [2023-01-10 12:11:46,881 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:11:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:46,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:11:46,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-01-10 12:11:46,890 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:11:46,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:11:46,890 INFO L357 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b29fb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:11:46,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:11:46,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 377823052, now seen corresponding path program 1 times [2023-01-10 12:11:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374140442] [2023-01-10 12:11:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:47,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:47,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374140442] [2023-01-10 12:11:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374140442] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:11:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 12:11:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 12:11:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424907324] [2023-01-10 12:11:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:11:47,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 12:11:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:47,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 12:11:47,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 12:11:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,033 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:47,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:47,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-10 12:11:47,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1980787883, now seen corresponding path program 1 times [2023-01-10 12:11:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815304238] [2023-01-10 12:11:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815304238] [2023-01-10 12:11:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815304238] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:11:47,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 12:11:47,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-10 12:11:47,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882215059] [2023-01-10 12:11:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:11:47,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-10 12:11:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:47,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-10 12:11:47,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-10 12:11:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,356 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:47,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:47,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:47,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 12:11:47,441 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1105576446, now seen corresponding path program 1 times [2023-01-10 12:11:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616896242] [2023-01-10 12:11:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616896242] [2023-01-10 12:11:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616896242] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:11:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 12:11:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-10 12:11:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104485803] [2023-01-10 12:11:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:11:47,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-10 12:11:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-10 12:11:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-10 12:11:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:47,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:47,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:47,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:47,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-10 12:11:47,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash -409483404, now seen corresponding path program 1 times [2023-01-10 12:11:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:47,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569316868] [2023-01-10 12:11:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569316868] [2023-01-10 12:11:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569316868] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:11:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614980333] [2023-01-10 12:11:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:47,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:47,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:11:47,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-10 12:11:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:47,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-10 12:11:47,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:11:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:48,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:11:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614980333] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:11:48,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:11:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-10 12:11:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580138354] [2023-01-10 12:11:48,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:11:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-10 12:11:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-10 12:11:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-10 12:11:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,088 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:48,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:48,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-10 12:11:48,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:48,371 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash 906746592, now seen corresponding path program 2 times [2023-01-10 12:11:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009993692] [2023-01-10 12:11:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-01-10 12:11:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009993692] [2023-01-10 12:11:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009993692] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:11:48,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 12:11:48,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-10 12:11:48,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88983936] [2023-01-10 12:11:48,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:11:48,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-10 12:11:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-10 12:11:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-10 12:11:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:48,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:48,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:48,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-10 12:11:48,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:48,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1248774004, now seen corresponding path program 1 times [2023-01-10 12:11:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921690231] [2023-01-10 12:11:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921690231] [2023-01-10 12:11:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921690231] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:11:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216038485] [2023-01-10 12:11:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:48,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:48,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:48,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:11:48,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-10 12:11:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:49,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-10 12:11:49,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:11:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:49,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:11:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216038485] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:11:49,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:11:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-01-10 12:11:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589531247] [2023-01-10 12:11:49,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:11:49,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-10 12:11:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-10 12:11:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-01-10 12:11:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:49,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:49,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.61111111111111) internal successors, (335), 18 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:49,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:49,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:49,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:49,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:49,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:49,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:49,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-10 12:11:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:49,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1297608548, now seen corresponding path program 2 times [2023-01-10 12:11:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597594823] [2023-01-10 12:11:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597594823] [2023-01-10 12:11:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597594823] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:11:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935148084] [2023-01-10 12:11:50,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 12:11:50,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:50,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:50,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:11:50,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-10 12:11:50,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-10 12:11:50,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:11:50,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-01-10 12:11:50,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:11:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2023-01-10 12:11:50,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-10 12:11:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935148084] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:11:50,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-10 12:11:50,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2023-01-10 12:11:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945532784] [2023-01-10 12:11:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:11:50,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-10 12:11:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-10 12:11:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-01-10 12:11:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:50,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:50,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:50,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:50,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:50,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:50,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:50,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:50,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:50,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:11:50,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-10 12:11:50,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-01-10 12:11:50,527 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1553903413, now seen corresponding path program 1 times [2023-01-10 12:11:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:50,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161527009] [2023-01-10 12:11:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161527009] [2023-01-10 12:11:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161527009] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:11:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836342478] [2023-01-10 12:11:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:51,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:11:51,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-10 12:11:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:51,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 16 conjunts are in the unsatisfiable core [2023-01-10 12:11:51,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:11:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:51,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:11:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836342478] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:11:51,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:11:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-01-10 12:11:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296789061] [2023-01-10 12:11:51,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:11:51,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-10 12:11:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-10 12:11:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-01-10 12:11:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:51,807 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:51,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.88235294117647) internal successors, (574), 34 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:11:51,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:11:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:11:52,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-10 12:11:52,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:52,520 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1081392251, now seen corresponding path program 2 times [2023-01-10 12:11:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:52,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096763489] [2023-01-10 12:11:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:11:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:11:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096763489] [2023-01-10 12:11:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096763489] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:11:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259014187] [2023-01-10 12:11:53,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 12:11:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:11:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:11:53,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:11:53,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-10 12:11:54,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 12:11:54,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:11:54,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-10 12:11:54,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:11:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:54,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:11:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 3165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:11:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259014187] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:11:55,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:11:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-01-10 12:11:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180932349] [2023-01-10 12:11:55,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:11:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-10 12:11:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:11:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-10 12:11:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-01-10 12:11:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:55,684 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:11:55,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.837209302325583) internal successors, (724), 43 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:11:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:11:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:11:56,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-10 12:11:56,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-10 12:11:56,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:11:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:11:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash -134443383, now seen corresponding path program 3 times [2023-01-10 12:11:56,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:11:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711419805] [2023-01-10 12:11:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:11:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:11:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:12:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1409 proven. 28 refuted. 0 times theorem prover too weak. 4283 trivial. 0 not checked. [2023-01-10 12:12:01,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:12:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711419805] [2023-01-10 12:12:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711419805] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:12:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367762047] [2023-01-10 12:12:01,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 12:12:01,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:12:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:12:01,586 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:12:01,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-10 12:12:01,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-10 12:12:01,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:12:01,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-10 12:12:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:12:04,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 12:12:04,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:04,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:12:04,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:12:04,565 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-01-10 12:12:04,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2023-01-10 12:12:04,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:04,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-10 12:12:04,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-10 12:12:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 588 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 0 not checked. [2023-01-10 12:12:04,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:12:04,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1319 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1319) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2023-01-10 12:12:04,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:12:04,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-01-10 12:12:04,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:12:04,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-01-10 12:12:04,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-01-10 12:12:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 498 proven. 434 refuted. 0 times theorem prover too weak. 4698 trivial. 90 not checked. [2023-01-10 12:12:05,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367762047] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:12:05,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:12:05,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 39 [2023-01-10 12:12:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518011024] [2023-01-10 12:12:05,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:12:05,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-01-10 12:12:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:12:05,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-01-10 12:12:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1228, Unknown=1, NotChecked=72, Total=1482 [2023-01-10 12:12:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:05,491 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:12:05,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 12.256410256410257) internal successors, (478), 39 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:12:05,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:05,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:05,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:05,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:12:05,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:05,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:12:05,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:12:05,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:12:05,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:12:05,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:12:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:12:06,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-10 12:12:06,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-10 12:12:06,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:12:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:12:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2058172751, now seen corresponding path program 1 times [2023-01-10 12:12:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:12:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55824878] [2023-01-10 12:12:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:12:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:12:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:12:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 5749 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:12:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:12:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55824878] [2023-01-10 12:12:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55824878] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:12:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949973457] [2023-01-10 12:12:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:12:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:12:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:12:08,569 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:12:08,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-10 12:12:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:12:08,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-10 12:12:08,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:12:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 6281 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:12:09,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-10 12:12:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949973457] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:12:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-10 12:12:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-01-10 12:12:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177335589] [2023-01-10 12:12:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:12:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-10 12:12:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:12:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-10 12:12:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-01-10 12:12:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:09,635 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:12:09,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 18.41860465116279) internal successors, (792), 43 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:12:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:12:09,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:12:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:12:10,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-10 12:12:10,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-10 12:12:10,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:12:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:12:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -453073797, now seen corresponding path program 2 times [2023-01-10 12:12:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:12:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707135280] [2023-01-10 12:12:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:12:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:12:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:12:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 1409 proven. 42 refuted. 0 times theorem prover too weak. 4249 trivial. 0 not checked. [2023-01-10 12:12:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:12:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707135280] [2023-01-10 12:12:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707135280] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:12:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216071781] [2023-01-10 12:12:14,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 12:12:14,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:12:14,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:12:14,455 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:12:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-10 12:12:14,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 12:12:14,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:12:14,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 78 conjunts are in the unsatisfiable core [2023-01-10 12:12:14,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:12:14,899 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-10 12:12:14,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-10 12:12:14,937 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-10 12:12:14,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:12:15,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 12:12:15,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:12:15,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:12:15,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:12:15,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:12:15,623 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-01-10 12:12:15,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:12:15,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:15,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:12:15,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-01-10 12:12:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2023-01-10 12:12:15,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-10 12:12:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216071781] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:12:15,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-10 12:12:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 35 [2023-01-10 12:12:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623793167] [2023-01-10 12:12:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:12:15,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-10 12:12:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:12:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-10 12:12:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 12:12:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:15,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:12:15,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.529411764705882) internal successors, (179), 17 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:12:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:12:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:12:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:12:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:12:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:12:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:12:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:12:16,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-10 12:12:16,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-10 12:12:16,606 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:12:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:12:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1813225211, now seen corresponding path program 3 times [2023-01-10 12:12:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:12:16,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701686314] [2023-01-10 12:12:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:12:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:12:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:12:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 3240 proven. 42 refuted. 0 times theorem prover too weak. 2418 trivial. 0 not checked. [2023-01-10 12:12:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:12:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701686314] [2023-01-10 12:12:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701686314] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:12:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153666283] [2023-01-10 12:12:20,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 12:12:20,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:12:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:12:20,625 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:12:20,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-10 12:12:20,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-10 12:12:20,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:12:20,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 64 conjunts are in the unsatisfiable core [2023-01-10 12:12:21,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:12:23,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 12:12:23,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:23,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:12:23,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:12:23,557 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:12:23,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:12:23,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:23,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:12:23,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:12:23,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:23,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:12:24,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:12:24,056 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-01-10 12:12:24,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2023-01-10 12:12:24,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:12:24,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:12:24,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-01-10 12:12:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 1079 proven. 439 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2023-01-10 12:12:24,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:13:05,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:13:05,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 84 [2023-01-10 12:13:05,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:13:05,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 129 [2023-01-10 12:13:05,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-01-10 12:13:05,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-01-10 12:13:05,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:13:05,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2023-01-10 12:13:05,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-01-10 12:13:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 632 proven. 448 refuted. 438 times theorem prover too weak. 4182 trivial. 0 not checked. [2023-01-10 12:13:22,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153666283] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:13:22,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:13:22,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 53 [2023-01-10 12:13:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047798190] [2023-01-10 12:13:22,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:13:22,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-01-10 12:13:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:13:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-01-10 12:13:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=2299, Unknown=68, NotChecked=0, Total=2756 [2023-01-10 12:13:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:22,368 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:13:22,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 11.660377358490566) internal successors, (618), 53 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:13:22,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:13:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:13:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:13:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:13:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:13:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:13:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:13:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 12:13:25,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-10 12:13:25,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:13:25,654 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:13:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:13:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1323111156, now seen corresponding path program 4 times [2023-01-10 12:13:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:13:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648069772] [2023-01-10 12:13:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:13:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:13:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:13:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3850 proven. 270 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2023-01-10 12:13:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:13:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648069772] [2023-01-10 12:13:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648069772] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:13:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322593196] [2023-01-10 12:13:32,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 12:13:32,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:13:32,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:13:32,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:13:32,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-10 12:13:40,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 12:13:40,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:13:40,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 110 conjunts are in the unsatisfiable core [2023-01-10 12:13:40,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:13:42,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 12:13:42,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:42,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:13:42,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:13:42,615 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:13:42,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:13:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:42,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:13:42,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-01-10 12:13:42,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:42,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:13:43,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:13:43,222 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:13:43,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:13:43,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:43,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:13:43,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-01-10 12:13:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:43,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:13:43,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:13:43,934 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:13:43,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:13:44,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:44,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:13:44,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-01-10 12:13:44,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:44,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:13:44,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:13:44,556 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-01-10 12:13:44,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2023-01-10 12:13:44,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:13:44,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-10 12:13:44,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-10 12:13:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3857 proven. 449 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2023-01-10 12:13:44,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:13:44,999 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-01-10 12:13:45,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-01-10 12:13:45,019 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-01-10 12:13:45,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20))) is different from false [2023-01-10 12:13:45,087 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2889)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1))))) is different from false [2023-01-10 12:13:45,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2891 Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2889))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1)) 20))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))) is different from false [2023-01-10 12:13:45,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2891 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2889))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2891) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1)) 20)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))) is different from false [2023-01-10 12:13:45,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|))))) is different from false [2023-01-10 12:13:45,901 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2895)) .cse1) 20)))))) is different from false [2023-01-10 12:13:45,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2881)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ 1 (select .cse3 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|))))) is different from false [2023-01-10 12:13:45,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2881))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|)))) is different from false [2023-01-10 12:13:46,016 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2881))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2883) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))))) is different from false [2023-01-10 12:13:46,344 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2895)) .cse1) 20)))))))) is different from false [2023-01-10 12:13:46,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)))))))) is different from false [2023-01-10 12:13:46,469 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse4 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|))))))) is different from false [2023-01-10 12:13:46,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))))))))) is different from false [2023-01-10 12:13:46,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2874)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse6 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse5 .cse6 v_ArrVal_2891) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)))))))) is different from false [2023-01-10 12:13:46,881 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2874))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2877) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse8 .cse4 v_ArrVal_2883) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2895)) .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|))))))) (< (select .cse11 .cse10) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|)))) is different from false [2023-01-10 12:13:46,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2881 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2874 Int) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int) (v_ArrVal_2877 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2874))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2877) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse10 .cse7 v_ArrVal_2883) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse6 .cse7 v_ArrVal_2891) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))))))) is different from false [2023-01-10 12:13:47,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:13:47,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2162 treesize of output 1502 [2023-01-10 12:13:47,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:13:47,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1840 treesize of output 1814 [2023-01-10 12:13:47,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 359 [2023-01-10 12:13:47,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-10 12:13:47,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-10 12:13:47,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-10 12:13:47,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-01-10 12:13:48,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:13:48,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 283 [2023-01-10 12:13:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3343 proven. 308 refuted. 0 times theorem prover too weak. 1726 trivial. 613 not checked. [2023-01-10 12:13:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322593196] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:13:48,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:13:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 40] total 100 [2023-01-10 12:13:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610396282] [2023-01-10 12:13:48,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:13:48,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2023-01-10 12:13:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:13:48,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2023-01-10 12:13:48,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1036, Invalid=5467, Unknown=53, NotChecked=3344, Total=9900 [2023-01-10 12:13:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:48,849 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:13:48,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 8.26) internal successors, (826), 100 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 12:13:48,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:13:57,340 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse20 (select .cse19 .cse21))) (and (<= |c_~#stored_elements~0.base| 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse3 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1) 20)) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= 5 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse11 .cse4 v_ArrVal_2883) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse8 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_2895)) .cse1) 20)) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|)))))) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2887 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2891 Int) (v_ArrVal_2883 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2880 (Array Int Int)) (v_ArrVal_2889 Int)) (let ((.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2880))) (let ((.cse13 (select .cse17 |c_~#queue~0.base|))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (let ((.cse18 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2881))) (store (store .cse18 .cse4 v_ArrVal_2883) .cse1 (+ (select .cse18 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse12 (select .cse15 |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse16 .cse4 v_ArrVal_2891) .cse1 (+ 1 (select .cse16 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse1) 4)) v_ArrVal_2895)) .cse1) 20)))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (forall ((v_ArrVal_2895 Int)) (not (= (select (store .cse19 (+ (* .cse20 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2895) .cse21) 20))) (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse19 .cse21 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse22 (select .cse24 |c_~#queue~0.base|))) (or (< (select .cse22 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|) (not (= 20 (select (let ((.cse23 (select (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse22 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse25 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse25 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) v_ArrVal_2895)) .cse1))))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2891 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2895 Int) (v_ArrVal_2889 Int)) (let ((.cse27 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse19 .cse21 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2887))) (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (or (not (= 20 (select (let ((.cse26 (select (store (store .cse27 |c_~#queue~0.base| (let ((.cse28 (store .cse29 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2889))) (store (store .cse28 .cse4 v_ArrVal_2891) .cse1 (+ (select .cse28 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2894) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2895)) .cse1))) (< (select .cse29 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233|))))) (forall ((v_ArrVal_2895 Int)) (not (= 20 (let ((.cse31 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (select (let ((.cse30 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse30 (+ (* (select .cse30 .cse31) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2895)) .cse31))))) (not (= .cse20 20))))) is different from false [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-10 12:14:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 12:14:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-01-10 12:14:23,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-10 12:14:23,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-10 12:14:23,482 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:14:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:14:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2059771710, now seen corresponding path program 5 times [2023-01-10 12:14:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:14:23,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157718138] [2023-01-10 12:14:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:14:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:14:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:14:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3956 proven. 924 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2023-01-10 12:14:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:14:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157718138] [2023-01-10 12:14:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157718138] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:14:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021010562] [2023-01-10 12:14:39,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 12:14:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:14:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:14:39,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:14:39,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-10 12:17:34,222 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2023-01-10 12:17:34,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 12:17:34,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 449 conjunts are in the unsatisfiable core [2023-01-10 12:17:34,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:17:34,411 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:34,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-01-10 12:17:34,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 12:17:34,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-01-10 12:17:34,519 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:34,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-01-10 12:17:34,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:34,819 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:34,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-01-10 12:17:34,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:34,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2023-01-10 12:17:35,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2023-01-10 12:17:35,292 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:35,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 56 [2023-01-10 12:17:35,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:35,941 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:35,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-01-10 12:17:36,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:36,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2023-01-10 12:17:36,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 52 [2023-01-10 12:17:36,688 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:36,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2023-01-10 12:17:37,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:37,572 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:37,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 85 [2023-01-10 12:17:37,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:37,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2023-01-10 12:17:38,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 71 [2023-01-10 12:17:38,861 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:38,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 94 [2023-01-10 12:17:40,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:40,145 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:40,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 104 [2023-01-10 12:17:40,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:40,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 93 [2023-01-10 12:17:41,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 90 [2023-01-10 12:17:41,798 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:41,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 113 [2023-01-10 12:17:43,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:43,296 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:43,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 123 [2023-01-10 12:17:43,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:43,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 112 [2023-01-10 12:17:44,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 109 [2023-01-10 12:17:45,178 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:45,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 132 [2023-01-10 12:17:47,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:47,283 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:47,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 142 [2023-01-10 12:17:47,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:47,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 131 [2023-01-10 12:17:49,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 128 [2023-01-10 12:17:50,059 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:50,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 151 [2023-01-10 12:17:52,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:52,812 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:52,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 161 [2023-01-10 12:17:53,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:53,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 150 [2023-01-10 12:17:55,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 147 [2023-01-10 12:17:56,004 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-01-10 12:17:56,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 170 [2023-01-10 12:17:57,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:57,025 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-01-10 12:17:57,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2023-01-10 12:17:57,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:57,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2023-01-10 12:17:57,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-01-10 12:17:57,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:57,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:17:57,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:57,720 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:17:57,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:17:57,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:57,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:17:58,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-01-10 12:17:58,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:58,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:17:58,654 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:58,662 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-01-10 12:17:58,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2023-01-10 12:17:58,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:58,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:17:59,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:17:59,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:59,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:17:59,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:17:59,636 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:17:59,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:17:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:17:59,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:18:00,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:18:00,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:00,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:18:00,774 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:18:00,785 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:18:00,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:18:00,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:00,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:18:01,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:18:01,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:01,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:18:02,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:18:02,039 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:18:02,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:18:02,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:02,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:18:02,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:18:02,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:02,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:18:03,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:18:03,324 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:18:03,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:18:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:03,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:18:03,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:18:03,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:03,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-01-10 12:18:04,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:18:04,511 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-01-10 12:18:04,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:18:04,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:18:04,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:18:04,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-01-10 12:18:05,078 INFO L321 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2023-01-10 12:18:05,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-01-10 12:18:05,434 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-01-10 12:18:05,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2023-01-10 12:18:05,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-10 12:18:05,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-01-10 12:18:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 3234 proven. 2870 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-01-10 12:18:05,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-01-10 12:25:47,696 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:47,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:47,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:47,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:47,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:47,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:47,697 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:25:48,386 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:25:48,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-10 12:25:48,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-10 12:25:48,587 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 235 known predicates. [2023-01-10 12:25:48,592 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1] [2023-01-10 12:25:48,592 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (5/5) [2023-01-10 12:25:48,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 12:25:48,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 12:25:48,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:25:48 BasicIcfg [2023-01-10 12:25:48,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 12:25:48,598 INFO L158 Benchmark]: Toolchain (without parser) took 843499.64ms. Allocated memory was 182.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 131.1MB in the beginning and 522.1MB in the end (delta: -391.1MB). Peak memory consumption was 839.4MB. Max. memory is 8.0GB. [2023-01-10 12:25:48,598 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 182.5MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 12:25:48,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.84ms. Allocated memory is still 182.5MB. Free memory was 130.7MB in the beginning and 101.0MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-01-10 12:25:48,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.49ms. Allocated memory is still 182.5MB. Free memory was 101.0MB in the beginning and 98.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-01-10 12:25:48,598 INFO L158 Benchmark]: Boogie Preprocessor took 39.58ms. Allocated memory is still 182.5MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 12:25:48,598 INFO L158 Benchmark]: RCFGBuilder took 524.63ms. Allocated memory was 182.5MB in the beginning and 257.9MB in the end (delta: 75.5MB). Free memory was 95.8MB in the beginning and 210.5MB in the end (delta: -114.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2023-01-10 12:25:48,598 INFO L158 Benchmark]: TraceAbstraction took 842425.48ms. Allocated memory was 257.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 209.4MB in the beginning and 522.1MB in the end (delta: -312.7MB). Peak memory consumption was 840.7MB. Max. memory is 8.0GB. [2023-01-10 12:25:48,599 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.25ms. Allocated memory is still 182.5MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.84ms. Allocated memory is still 182.5MB. Free memory was 130.7MB in the beginning and 101.0MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.49ms. Allocated memory is still 182.5MB. Free memory was 101.0MB in the beginning and 98.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.58ms. Allocated memory is still 182.5MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 524.63ms. Allocated memory was 182.5MB in the beginning and 257.9MB in the end (delta: 75.5MB). Free memory was 95.8MB in the beginning and 210.5MB in the end (delta: -114.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * TraceAbstraction took 842425.48ms. Allocated memory was 257.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 209.4MB in the beginning and 522.1MB in the end (delta: -312.7MB). Peak memory consumption was 840.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Traversal Statistics Data States: 51, Transitions: 50, Traversal time: 14691477.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 51, Transitions: 52, Traversal time: 7696826.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Traversal Statistics Data States: 60, Transitions: 61, Traversal time: 9443166.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 356, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 323, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 323, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 323, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 312, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 312, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 323, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 312, unknown conditional: 0, unknown unconditional: 312] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 303, Positive conditional cache size: 0, Positive unconditional cache size: 303, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 33 - StatisticsResult: Traversal Statistics Data States: 364, Transitions: 399, Traversal time: 131080241.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 5 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2110663424674460.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9043, independent: 8234, independent conditional: 8234, independent unconditional: 0, dependent: 809, dependent conditional: 809, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8247, independent: 8234, independent conditional: 8234, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8247, independent: 8234, independent conditional: 8234, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8275, independent: 8234, independent conditional: 0, independent unconditional: 8234, dependent: 41, dependent conditional: 28, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8275, independent: 8234, independent conditional: 0, independent unconditional: 8234, dependent: 41, dependent conditional: 13, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8275, independent: 8234, independent conditional: 0, independent unconditional: 8234, dependent: 41, dependent conditional: 13, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 464, independent: 460, independent conditional: 0, independent unconditional: 460, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8275, independent: 7774, independent conditional: 0, independent unconditional: 7774, dependent: 37, dependent conditional: 11, dependent unconditional: 26, unknown: 464, unknown conditional: 2, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 460, Positive conditional cache size: 0, Positive unconditional cache size: 460, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 6, Independence queries for same thread: 796 - StatisticsResult: Traversal Statistics Data States: 112, Transitions: 111, Traversal time: 18498295.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 110, Transitions: 110, Traversal time: 20543274.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 158, Transitions: 161, Traversal time: 78218054.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 187, Transitions: 190, Traversal time: 26605160.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 213, Transitions: 215, Traversal time: 66327272.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 246, Transitions: 256, Traversal time: 28285185.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 366, Transitions: 376, Traversal time: 159024308.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 449, Transitions: 461, Traversal time: 49058405.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 689, Transitions: 701, Traversal time: 488071566.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 839, Transitions: 851, Traversal time: 741677877.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 909, Transitions: 931, Traversal time: 692686425.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 879, Transitions: 901, Traversal time: 872250514.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 879, Transitions: 901, Traversal time: 675964833.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 899, Transitions: 926, Traversal time: 3063156793.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - StatisticsResult: Traversal Statistics Data States: 907, Transitions: 936, Traversal time: 29054994057.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 14 - PositiveResult [Line: 1049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 791 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 235 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 282374420.0ns, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 34414020.0ns, FeasibilityCheckTime: 181913873.0ns, RefinementTime: 27998228.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 13436741.0ns, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 51 mSDtfsCounter, 0 mSolverCounterSat, 622433.0ns SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7409429.0ns SsaConstructionTime, 37328230.0ns SatisfiabilityAnalysisTime, 61916876.0ns InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 15427586.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 10096568.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 2798190.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 154098471.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 148893344.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 2527455.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 7472448.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 206713.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 5073336.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 841704035785.0ns, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 41617660705.0ns, FeasibilityCheckTime: 797794528267.0ns, RefinementTime: 18544383.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 1779605.0ns, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10246 SdHoareTripleChecker+Valid, 4824411543.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10246 mSDsluCounter, 27334 SdHoareTripleChecker+Invalid, 4282045002.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13711 IncrementalHoareTripleChecker+Unchecked, 24143 mSDsCounter, 421 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5930 IncrementalHoareTripleChecker+Invalid, 20062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 421 mSolverCounterUnsat, 3191 mSDtfsCounter, 5930 mSolverCounterSat, 105141243.0ns SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 375, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 578373789.0ns SsaConstructionTime, 9054892478.0ns SatisfiabilityAnalysisTime, 101796872292.0ns InterpolantComputationTime, 11398 NumberOfCodeBlocks, 10102 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 14902 ConstructedInterpolants, 168 QuantifiedInterpolants, 115017 SizeOfPredicates, 187 NumberOfNonLiveVariables, 9038 ConjunctsInSsa, 403 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 72355/89247 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown