/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-14 19:04:10,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-14 19:04:10,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-14 19:04:11,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-14 19:04:11,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-14 19:04:11,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-14 19:04:11,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-14 19:04:11,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-14 19:04:11,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-14 19:04:11,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-14 19:04:11,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-14 19:04:11,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-14 19:04:11,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-14 19:04:11,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-14 19:04:11,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-14 19:04:11,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-14 19:04:11,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-14 19:04:11,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-14 19:04:11,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-14 19:04:11,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-14 19:04:11,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-14 19:04:11,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-14 19:04:11,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-14 19:04:11,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-14 19:04:11,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-14 19:04:11,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-14 19:04:11,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-14 19:04:11,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-14 19:04:11,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-14 19:04:11,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-14 19:04:11,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-14 19:04:11,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-14 19:04:11,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-14 19:04:11,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-14 19:04:11,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-14 19:04:11,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-14 19:04:11,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-14 19:04:11,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-14 19:04:11,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-14 19:04:11,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-14 19:04:11,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-14 19:04:11,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-14 19:04:11,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-14 19:04:11,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-14 19:04:11,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-14 19:04:11,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-14 19:04:11,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-14 19:04:11,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-14 19:04:11,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-14 19:04:11,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-14 19:04:11,084 INFO L138 SettingsManager]: * Use SBE=true [2022-11-14 19:04:11,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-14 19:04:11,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-14 19:04:11,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-14 19:04:11,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-14 19:04:11,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-14 19:04:11,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:11,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-14 19:04:11,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-14 19:04:11,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-14 19:04:11,087 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-14 19:04:11,087 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-14 19:04:11,087 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_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-11-14 19:04:11,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-14 19:04:11,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-14 19:04:11,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-14 19:04:11,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-14 19:04:11,319 INFO L275 PluginConnector]: CDTParser initialized [2022-11-14 19:04:11,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-11-14 19:04:11,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af9e9b78/36df4ebe28c54e43956b7f9ab24755f9/FLAG4775fa286 [2022-11-14 19:04:11,808 INFO L306 CDTParser]: Found 1 translation units. [2022-11-14 19:04:11,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-11-14 19:04:11,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af9e9b78/36df4ebe28c54e43956b7f9ab24755f9/FLAG4775fa286 [2022-11-14 19:04:11,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af9e9b78/36df4ebe28c54e43956b7f9ab24755f9 [2022-11-14 19:04:11,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-14 19:04:11,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-14 19:04:11,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:11,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-14 19:04:11,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-14 19:04:11,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:11" (1/1) ... [2022-11-14 19:04:11,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de2ed02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:11, skipping insertion in model container [2022-11-14 19:04:11,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:11" (1/1) ... [2022-11-14 19:04:11,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-14 19:04:11,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-14 19:04:12,321 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-14 19:04:12,326 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-14 19:04:12,331 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-14 19:04:12,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:12,346 INFO L203 MainTranslator]: Completed pre-run [2022-11-14 19:04:12,387 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-14 19:04:12,388 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-14 19:04:12,389 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-14 19:04:12,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:12,438 INFO L208 MainTranslator]: Completed translation [2022-11-14 19:04:12,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12 WrapperNode [2022-11-14 19:04:12,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:12,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:12,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-14 19:04:12,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-14 19:04:12,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,493 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 261 [2022-11-14 19:04:12,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:12,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-14 19:04:12,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-14 19:04:12,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-14 19:04:12,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,526 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-14 19:04:12,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-14 19:04:12,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-14 19:04:12,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-14 19:04:12,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (1/1) ... [2022-11-14 19:04:12,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:12,575 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) [2022-11-14 19:04:12,580 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 [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-14 19:04:12,601 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-14 19:04:12,601 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-14 19:04:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-14 19:04:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-14 19:04:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-14 19:04:12,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-14 19:04:12,603 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-14 19:04:12,726 INFO L235 CfgBuilder]: Building ICFG [2022-11-14 19:04:12,727 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-14 19:04:13,030 INFO L276 CfgBuilder]: Performing block encoding [2022-11-14 19:04:13,038 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-14 19:04:13,038 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-14 19:04:13,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:13 BoogieIcfgContainer [2022-11-14 19:04:13,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-14 19:04:13,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-14 19:04:13,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-14 19:04:13,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-14 19:04:13,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:04:11" (1/3) ... [2022-11-14 19:04:13,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3db57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:13, skipping insertion in model container [2022-11-14 19:04:13,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:12" (2/3) ... [2022-11-14 19:04:13,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3db57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:13, skipping insertion in model container [2022-11-14 19:04:13,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:13" (3/3) ... [2022-11-14 19:04:13,047 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-14 19:04:13,052 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-14 19:04:13,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-14 19:04:13,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-14 19:04:13,058 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-14 19:04:13,141 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-14 19:04:13,171 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-14 19:04:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:13,174 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) [2022-11-14 19:04:13,178 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 [2022-11-14 19:04:13,219 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-14 19:04:13,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-14 19:04:13,231 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;@50e1c2ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:13,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-14 19:04:13,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1108021859, now seen corresponding path program 1 times [2022-11-14 19:04:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:13,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674060861] [2022-11-14 19:04:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:13,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674060861] [2022-11-14 19:04:13,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674060861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:13,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:13,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-14 19:04:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564530824] [2022-11-14 19:04:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-14 19:04:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-14 19:04:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-14 19:04:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:13,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:13,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:13,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-14 19:04:13,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1299927559, now seen corresponding path program 1 times [2022-11-14 19:04:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:13,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080203566] [2022-11-14 19:04:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:22,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080203566] [2022-11-14 19:04:22,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080203566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:22,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:22,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361065396] [2022-11-14 19:04:22,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:22,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:22,204 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:22,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 20 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:22,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:22,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:26,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-14 19:04:26,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1176894351, now seen corresponding path program 1 times [2022-11-14 19:04:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:26,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272187041] [2022-11-14 19:04:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:27,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272187041] [2022-11-14 19:04:27,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272187041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:27,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:27,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-14 19:04:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404535823] [2022-11-14 19:04:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:27,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:04:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:04:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:04:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:27,029 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:27,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:27,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:27,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:27,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:27,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-14 19:04:27,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash 155091461, now seen corresponding path program 1 times [2022-11-14 19:04:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:27,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840526258] [2022-11-14 19:04:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:27,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840526258] [2022-11-14 19:04:27,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840526258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:27,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:27,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-14 19:04:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898177929] [2022-11-14 19:04:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:27,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-14 19:04:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-14 19:04:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-14 19:04:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:27,996 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:27,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:27,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:27,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:27,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:27,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:28,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-14 19:04:28,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1125066498, now seen corresponding path program 1 times [2022-11-14 19:04:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:28,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555754602] [2022-11-14 19:04:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:30,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555754602] [2022-11-14 19:04:30,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555754602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:30,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:30,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904053706] [2022-11-14 19:04:30,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:30,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:30,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:30,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 20 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:30,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:30,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:30,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:30,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:30,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:31,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-14 19:04:31,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1498429554, now seen corresponding path program 1 times [2022-11-14 19:04:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:31,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729826862] [2022-11-14 19:04:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:33,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:33,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729826862] [2022-11-14 19:04:33,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729826862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:33,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:33,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-14 19:04:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915256894] [2022-11-14 19:04:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:33,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-14 19:04:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-14 19:04:33,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-11-14 19:04:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:33,657 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.7) internal successors, (141), 31 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:33,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:33,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:33,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:33,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:33,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:33,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-14 19:04:35,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-14 19:04:35,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:35,609 INFO L85 PathProgramCache]: Analyzing trace with hash 793324901, now seen corresponding path program 1 times [2022-11-14 19:04:35,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:35,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110389745] [2022-11-14 19:04:35,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:35,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:36,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110389745] [2022-11-14 19:04:36,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110389745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:36,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:36,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-14 19:04:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445538069] [2022-11-14 19:04:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:36,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-14 19:04:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-14 19:04:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-11-14 19:04:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:36,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:36,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-14 19:04:36,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-14 19:04:37,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-14 19:04:37,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash 407110747, now seen corresponding path program 1 times [2022-11-14 19:04:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:37,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557066046] [2022-11-14 19:04:37,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:37,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557066046] [2022-11-14 19:04:37,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557066046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:37,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:37,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-14 19:04:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894506967] [2022-11-14 19:04:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:37,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-14 19:04:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-14 19:04:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-14 19:04:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:37,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 77.5) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:37,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-14 19:04:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-14 19:04:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:37,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-14 19:04:37,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:37,773 INFO L85 PathProgramCache]: Analyzing trace with hash -345584511, now seen corresponding path program 1 times [2022-11-14 19:04:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:37,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193858457] [2022-11-14 19:04:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:37,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:37,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193858457] [2022-11-14 19:04:37,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193858457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:37,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:37,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833807005] [2022-11-14 19:04:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:37,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:04:37,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:04:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:04:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:37,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:37,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:37,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-14 19:04:37,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1434890977, now seen corresponding path program 1 times [2022-11-14 19:04:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:37,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895660240] [2022-11-14 19:04:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:38,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895660240] [2022-11-14 19:04:38,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895660240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:38,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:38,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859021096] [2022-11-14 19:04:38,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:38,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-14 19:04:38,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:38,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-14 19:04:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-14 19:04:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:38,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-14 19:04:38,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash -474269386, now seen corresponding path program 1 times [2022-11-14 19:04:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:38,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742874706] [2022-11-14 19:04:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-14 19:04:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:38,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742874706] [2022-11-14 19:04:38,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742874706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:38,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:38,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280794327] [2022-11-14 19:04:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:38,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:04:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:38,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:04:38,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:04:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:38,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-14 19:04:38,141 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1817448275, now seen corresponding path program 1 times [2022-11-14 19:04:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:38,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602076290] [2022-11-14 19:04:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:38,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602076290] [2022-11-14 19:04:38,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602076290] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:04:38,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898614864] [2022-11-14 19:04:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:04:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:38,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:04:38,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-14 19:04:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:38,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-14 19:04:38,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:04:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:38,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:04:38,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898614864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:38,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:04:38,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-14 19:04:38,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295523711] [2022-11-14 19:04:38,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:38,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-14 19:04:38,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:38,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-14 19:04:38,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-14 19:04:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:38,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.6) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:38,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:38,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-14 19:04:39,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-14 19:04:39,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1320206827, now seen corresponding path program 1 times [2022-11-14 19:04:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:39,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394421939] [2022-11-14 19:04:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-14 19:04:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:39,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394421939] [2022-11-14 19:04:39,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394421939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:39,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:39,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057187185] [2022-11-14 19:04:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:39,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-14 19:04:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-14 19:04:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-14 19:04:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:39,169 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:39,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:39,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:39,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:39,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:39,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:39,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-14 19:04:39,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1741732359, now seen corresponding path program 1 times [2022-11-14 19:04:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:39,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599808213] [2022-11-14 19:04:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:41,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:41,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599808213] [2022-11-14 19:04:41,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599808213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:41,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:41,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-14 19:04:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820727988] [2022-11-14 19:04:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:41,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-14 19:04:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-14 19:04:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-11-14 19:04:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:41,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:41,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 27 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:41,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:42,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-14 19:04:42,492 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash -744459785, now seen corresponding path program 1 times [2022-11-14 19:04:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:42,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288440338] [2022-11-14 19:04:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288440338] [2022-11-14 19:04:43,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288440338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:43,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:43,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-14 19:04:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968302647] [2022-11-14 19:04:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-14 19:04:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-14 19:04:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-11-14 19:04:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:43,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:43,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.8076923076923075) internal successors, (151), 27 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:43,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:43,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:43,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:43,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:43,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:43,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-14 19:04:45,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1603416018, now seen corresponding path program 1 times [2022-11-14 19:04:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126263614] [2022-11-14 19:04:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:46,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:46,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126263614] [2022-11-14 19:04:46,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126263614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:46,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:46,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-14 19:04:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721225420] [2022-11-14 19:04:46,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:46,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-14 19:04:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:46,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-14 19:04:46,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-11-14 19:04:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:46,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:46,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 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) [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:46,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:46,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:46,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:04:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:04:47,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-14 19:04:47,358 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:04:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash 323105794, now seen corresponding path program 1 times [2022-11-14 19:04:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:47,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019723994] [2022-11-14 19:04:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019723994] [2022-11-14 19:04:50,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019723994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:04:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078578599] [2022-11-14 19:04:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:04:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:50,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:04:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-14 19:04:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:50,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-14 19:04:50,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:04:50,683 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-14 19:04:50,683 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 [2022-11-14 19:04:50,724 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:04:50,725 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 11 treesize of output 11 [2022-11-14 19:04:50,897 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 [2022-11-14 19:04:50,955 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 [2022-11-14 19:04:51,454 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 31 treesize of output 29 [2022-11-14 19:04:51,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:51,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:51,854 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:04:51,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-14 19:04:51,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:51,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:51,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-14 19:04:52,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2022-11-14 19:04:52,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:52,424 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 25 [2022-11-14 19:04:52,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:52,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:53,012 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:04:53,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:04:53,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:53,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:53,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-14 19:04:53,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-14 19:04:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:53,433 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 [2022-11-14 19:04:53,575 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 [2022-11-14 19:04:53,880 INFO L321 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-11-14 19:04:53,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-14 19:04:53,927 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-14 19:04:53,927 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-11-14 19:04:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:53,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:04:54,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_749 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2022-11-14 19:04:57,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_747 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse2 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_739 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2))))))) is different from false [2022-11-14 19:04:57,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_747 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse2 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_739) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2))))))) is different from false [2022-11-14 19:04:57,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_747 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse2 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_739)))))) is different from false [2022-11-14 19:04:57,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_747 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_737) .cse4 v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse2 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_739)))))) is different from false [2022-11-14 19:04:57,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_747 Int) (v_ArrVal_735 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse3 (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_735)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_737) .cse4 v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse2 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_739) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2)))))))) is different from false [2022-11-14 19:04:57,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_747 Int) (v_ArrVal_735 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse3 (store .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_735))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_737) .cse4 v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse2 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_739)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 .cse4)))))) is different from false [2022-11-14 19:04:57,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_747 Int) (v_ArrVal_735 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_735)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_737) .cse1 v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (= 800 (select (select (store (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_744) .cse4 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse3 .cse4))) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_739))))))) is different from false [2022-11-14 19:05:14,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_747 Int) (v_ArrVal_735 Int) (v_ArrVal_744 Int) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_743 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_734))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_735)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_737) .cse1 v_ArrVal_739)) |c_~#stored_elements~0.base| v_ArrVal_741))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (not (= 800 (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_743) .cse4 v_ArrVal_744) .cse1 v_ArrVal_747)) |c_~#stored_elements~0.base| v_ArrVal_748) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_749) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_739)))))))) is different from false [2022-11-14 19:05:16,087 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-14 19:05:16,088 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 1110 treesize of output 978 [2022-11-14 19:05:16,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:16,146 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 1432 treesize of output 1394 [2022-11-14 19:05:16,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 525 treesize of output 513 [2022-11-14 19:05:16,193 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 462 treesize of output 422 [2022-11-14 19:05:16,212 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 422 treesize of output 402 [2022-11-14 19:05:16,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 479 treesize of output 463 [2022-11-14 19:05:16,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2022-11-14 19:05:16,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:16,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 191 [2022-11-14 19:05:17,656 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-14 19:05:17,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 80 [2022-11-14 19:05:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:17,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078578599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:17,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:17,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36, 37] total 103 [2022-11-14 19:05:17,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894669673] [2022-11-14 19:05:17,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:17,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-11-14 19:05:17,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:17,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-11-14 19:05:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=8003, Unknown=70, NotChecked=1728, Total=10506 [2022-11-14 19:05:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:17,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:17,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 6.009708737864078) internal successors, (619), 103 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:05:17,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:05:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-14 19:05:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:05:24,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-14 19:05:24,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:24,228 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-11-14 19:05:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 581632185, now seen corresponding path program 1 times [2022-11-14 19:05:24,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:24,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583272046] [2022-11-14 19:05:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:30,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:30,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583272046] [2022-11-14 19:05:30,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583272046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:30,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831650128] [2022-11-14 19:05:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:30,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:05:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-14 19:05:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:30,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-14 19:05:30,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:30,491 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-14 19:05:30,492 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 [2022-11-14 19:05:30,507 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:05:30,507 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 11 treesize of output 11 [2022-11-14 19:05:31,511 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 32 treesize of output 16 [2022-11-14 19:05:31,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:31,636 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 17 treesize of output 19 [2022-11-14 19:05:32,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:32,137 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:05:32,137 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 32 treesize of output 28 [2022-11-14 19:05:32,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:32,292 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 24 treesize of output 23 [2022-11-14 19:05:32,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2022-11-14 19:05:33,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:33,105 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 36 treesize of output 34 [2022-11-14 19:05:33,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-14 19:05:33,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:33,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:33,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2022-11-14 19:05:34,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:05:34,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:34,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:34,600 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-14 19:05:34,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 42 [2022-11-14 19:05:34,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:05:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:34,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:40,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647)))) is different from false [2022-11-14 19:05:40,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_878) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_873 1))))) is different from false [2022-11-14 19:05:40,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_873 1))))) is different from false [2022-11-14 19:05:40,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647)))) is different from false [2022-11-14 19:05:40,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_866) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (not (<= v_ArrVal_866 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647)))) (= 800 .cse5)))) is different from false [2022-11-14 19:05:41,029 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_875 Int)) (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_866) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< 2147483647 v_ArrVal_866) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647)))) (= 800 .cse5)))) is different from false [2022-11-14 19:05:41,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse4 (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_865)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (let ((.cse1 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_866) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (or (= 800 .cse0) (< (select (store (store (store .cse1 .cse2 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse1 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse2) 2147483647) (< 2147483647 v_ArrVal_866) (< (select .cse1 .cse2) (+ v_ArrVal_873 1))))))) is different from false [2022-11-14 19:05:41,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse6 .cse5) 4)) v_ArrVal_865)))) (let ((.cse2 (select .cse4 .cse5))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_866) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< 2147483647 v_ArrVal_866) (= .cse2 800) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647))))))) is different from false [2022-11-14 19:05:41,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse6 .cse5))) v_ArrVal_865)))) (let ((.cse2 (select .cse4 .cse5))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_866) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (< 2147483647 v_ArrVal_866) (= 800 .cse2))))))) is different from false [2022-11-14 19:05:41,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_865)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse2))) (let ((.cse0 (select (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_866) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (= 800 .cse3) (< 2147483647 v_ArrVal_866) (< (select .cse0 .cse1) (+ v_ArrVal_873 1)))))))) is different from false [2022-11-14 19:05:41,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_863))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_865)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse6 .cse2))) (let ((.cse0 (select (let ((.cse4 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_866) .cse2 (+ 1 .cse3))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (< 2147483647 v_ArrVal_866) (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (= 800 .cse3))))))) is different from false [2022-11-14 19:05:41,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_863))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_865)))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse6 .cse3))) (let ((.cse1 (select (let ((.cse4 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_866) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|))) (or (= .cse0 800) (< (select (store (store (store .cse1 .cse2 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse3))) v_ArrVal_878) .cse2) 2147483647) (< 2147483647 v_ArrVal_866) (< (select .cse1 .cse2) (+ v_ArrVal_873 1)))))))) is different from false [2022-11-14 19:05:41,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_863))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_865)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse6 .cse2))) (let ((.cse0 (select (let ((.cse4 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_866) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (< 2147483647 v_ArrVal_866) (= 800 .cse3) (< (select .cse0 .cse1) (+ v_ArrVal_873 1)))))))) is different from false [2022-11-14 19:05:42,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_863))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_865)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse6 .cse2))) (let ((.cse0 (select (let ((.cse4 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_866) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (< 2147483647 v_ArrVal_866) (= 800 .cse3))))))) is different from false [2022-11-14 19:05:42,059 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_873 Int) (v_ArrVal_872 Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_878 Int) (v_ArrVal_866 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_875 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_863))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_865)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse6 .cse2))) (let ((.cse0 (select (let ((.cse4 (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_866) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_870))) (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_872))) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_873 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_873) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_875) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_878) .cse1) 2147483647) (< 2147483647 v_ArrVal_866) (= 800 .cse3))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2022-11-14 19:05:42,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:42,081 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 2 case distinctions, treesize of input 1083 treesize of output 513 [2022-11-14 19:05:42,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:42,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13957 treesize of output 13303 [2022-11-14 19:05:42,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13487 treesize of output 13059 [2022-11-14 19:05:42,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14571 treesize of output 13755 [2022-11-14 19:05:42,324 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 Received shutdown request... [2022-11-14 19:17:45,517 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-11-14 19:17:45,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-14 19:17:45,533 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:17:45,533 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 [2022-11-14 19:17:45,550 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 [2022-11-14 19:17:45,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-14 19:17:45,718 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. [2022-11-14 19:17:45,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-11-14 19:17:45,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-11-14 19:17:45,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-11-14 19:17:45,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-11-14 19:17:45,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-11-14 19:17:45,719 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-11-14 19:17:45,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-11-14 19:17:45,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-11-14 19:17:45,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-11-14 19:17:45,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-11-14 19:17:45,720 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-11-14 19:17:45,723 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-14 19:17:45,724 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/3) [2022-11-14 19:17:45,725 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-14 19:17:45,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-14 19:17:45,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:17:45 BasicIcfg [2022-11-14 19:17:45,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-14 19:17:45,727 INFO L158 Benchmark]: Toolchain (without parser) took 813885.12ms. Allocated memory was 208.7MB in the beginning and 1.1GB in the end (delta: 900.7MB). Free memory was 146.1MB in the beginning and 773.8MB in the end (delta: -627.7MB). Peak memory consumption was 674.2MB. Max. memory is 8.0GB. [2022-11-14 19:17:45,727 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 208.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-14 19:17:45,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.57ms. Allocated memory was 208.7MB in the beginning and 303.0MB in the end (delta: 94.4MB). Free memory was 145.9MB in the beginning and 251.0MB in the end (delta: -105.1MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-11-14 19:17:45,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.05ms. Allocated memory is still 303.0MB. Free memory was 251.0MB in the beginning and 247.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:45,728 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 303.0MB. Free memory was 247.9MB in the beginning and 245.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:45,728 INFO L158 Benchmark]: RCFGBuilder took 499.08ms. Allocated memory is still 303.0MB. Free memory was 245.8MB in the beginning and 221.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:45,728 INFO L158 Benchmark]: TraceAbstraction took 812684.39ms. Allocated memory was 303.0MB in the beginning and 1.1GB in the end (delta: 806.4MB). Free memory was 220.6MB in the beginning and 773.8MB in the end (delta: -553.2MB). Peak memory consumption was 654.0MB. Max. memory is 8.0GB. [2022-11-14 19:17:45,731 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.31ms. Allocated memory is still 208.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 593.57ms. Allocated memory was 208.7MB in the beginning and 303.0MB in the end (delta: 94.4MB). Free memory was 145.9MB in the beginning and 251.0MB in the end (delta: -105.1MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.05ms. Allocated memory is still 303.0MB. Free memory was 251.0MB in the beginning and 247.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 303.0MB. Free memory was 247.9MB in the beginning and 245.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 499.08ms. Allocated memory is still 303.0MB. Free memory was 245.8MB in the beginning and 221.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 812684.39ms. Allocated memory was 303.0MB in the beginning and 1.1GB in the end (delta: 806.4MB). Free memory was 220.6MB in the beginning and 773.8MB in the end (delta: -553.2MB). Peak memory consumption was 654.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20656, independent: 20223, independent conditional: 2755, independent unconditional: 17468, dependent: 433, dependent conditional: 364, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20297, independent: 20223, independent conditional: 2755, independent unconditional: 17468, dependent: 74, dependent conditional: 5, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20297, independent: 20223, independent conditional: 2755, independent unconditional: 17468, dependent: 74, dependent conditional: 5, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20384, independent: 20223, independent conditional: 12, independent unconditional: 20211, dependent: 161, dependent conditional: 75, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20384, independent: 20223, independent conditional: 12, independent unconditional: 20211, dependent: 161, dependent conditional: 4, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20384, independent: 20223, independent conditional: 12, independent unconditional: 20211, dependent: 161, dependent conditional: 4, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15426, independent: 15355, independent conditional: 1, independent unconditional: 15354, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15426, independent: 15345, independent conditional: 0, independent unconditional: 15345, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 81, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 47, independent conditional: 1, independent unconditional: 46, dependent: 100, dependent conditional: 3, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 20384, independent: 4868, independent conditional: 11, independent unconditional: 4857, dependent: 90, dependent conditional: 2, dependent unconditional: 88, unknown: 15426, unknown conditional: 3, unknown unconditional: 15423] , Statistics on independence cache: Total cache size (in pairs): 15426, Positive cache size: 15355, Positive conditional cache size: 1, Positive unconditional cache size: 15354, Negative cache size: 71, Negative conditional cache size: 2, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 12, Independence queries for same thread: 359 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 385, Number of trivial persistent sets: 255, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17537, independent: 17468, independent conditional: 0, independent unconditional: 17468, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20656, independent: 20223, independent conditional: 2755, independent unconditional: 17468, dependent: 433, dependent conditional: 364, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20297, independent: 20223, independent conditional: 2755, independent unconditional: 17468, dependent: 74, dependent conditional: 5, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20297, independent: 20223, independent conditional: 2755, independent unconditional: 17468, dependent: 74, dependent conditional: 5, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20384, independent: 20223, independent conditional: 12, independent unconditional: 20211, dependent: 161, dependent conditional: 75, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20384, independent: 20223, independent conditional: 12, independent unconditional: 20211, dependent: 161, dependent conditional: 4, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20384, independent: 20223, independent conditional: 12, independent unconditional: 20211, dependent: 161, dependent conditional: 4, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15426, independent: 15355, independent conditional: 1, independent unconditional: 15354, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15426, independent: 15345, independent conditional: 0, independent unconditional: 15345, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 81, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 71, dependent conditional: 2, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 47, independent conditional: 1, independent unconditional: 46, dependent: 100, dependent conditional: 3, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 20384, independent: 4868, independent conditional: 11, independent unconditional: 4857, dependent: 90, dependent conditional: 2, dependent unconditional: 88, unknown: 15426, unknown conditional: 3, unknown unconditional: 15423] , Statistics on independence cache: Total cache size (in pairs): 15426, Positive cache size: 15355, Positive conditional cache size: 1, Positive unconditional cache size: 15354, Negative cache size: 71, Negative conditional cache size: 2, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 12, Independence queries for same thread: 359 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 246 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations on subformula. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 496 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 812.5s, OverallIterations: 18, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 280, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 49.3s InterpolantComputationTime, 3090 NumberOfCodeBlocks, 3090 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3309 ConstructedInterpolants, 149 QuantifiedInterpolants, 58824 SizeOfPredicates, 43 NumberOfNonLiveVariables, 937 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 140/151 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