/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 -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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 12:17:01,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 12:17:01,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 12:17:01,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 12:17:01,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 12:17:01,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 12:17:01,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 12:17:01,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 12:17:01,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 12:17:01,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 12:17:01,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 12:17:01,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 12:17:01,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 12:17:01,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 12:17:01,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 12:17:01,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 12:17:01,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 12:17:01,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 12:17:01,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 12:17:01,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 12:17:01,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 12:17:01,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 12:17:01,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 12:17:01,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 12:17:01,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 12:17:01,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 12:17:01,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 12:17:01,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 12:17:01,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 12:17:01,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 12:17:01,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 12:17:01,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 12:17:01,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 12:17:01,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 12:17:01,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 12:17:01,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 12:17:01,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 12:17:01,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 12:17:01,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 12:17:01,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 12:17:01,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 12:17:01,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-09-16 12:17:01,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 12:17:01,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 12:17:01,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 12:17:01,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 12:17:01,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 12:17:01,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 12:17:01,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 12:17:01,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 12:17:01,656 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 12:17:01,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 12:17:01,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 12:17:01,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 12:17:01,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 12:17:01,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 12:17:01,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 12:17:01,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 12:17:01,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 12:17:01,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 12:17:01,659 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 12:17:01,660 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-16 12:17:01,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 12:17:01,660 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-09-16 12:17:01,660 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-09-16 12:17:01,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 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-09-16 12:17:01,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 12:17:01,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 12:17:01,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 12:17:01,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 12:17:01,906 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 12:17:01,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2022-09-16 12:17:01,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eca01ad/00eeed7da90741a381ac955d6e2503fe/FLAGcda600ab4 [2022-09-16 12:17:02,491 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 12:17:02,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2022-09-16 12:17:02,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eca01ad/00eeed7da90741a381ac955d6e2503fe/FLAGcda600ab4 [2022-09-16 12:17:02,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eca01ad/00eeed7da90741a381ac955d6e2503fe [2022-09-16 12:17:02,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 12:17:02,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 12:17:02,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 12:17:02,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 12:17:02,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 12:17:02,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 12:17:02" (1/1) ... [2022-09-16 12:17:02,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30085e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:02, skipping insertion in model container [2022-09-16 12:17:02,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 12:17:02" (1/1) ... [2022-09-16 12:17:03,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 12:17:03,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 12:17:03,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2022-09-16 12:17:03,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2022-09-16 12:17:03,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2022-09-16 12:17:03,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 12:17:03,482 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 12:17:03,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2022-09-16 12:17:03,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2022-09-16 12:17:03,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2022-09-16 12:17:03,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 12:17:03,573 INFO L208 MainTranslator]: Completed translation [2022-09-16 12:17:03,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03 WrapperNode [2022-09-16 12:17:03,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 12:17:03,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 12:17:03,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 12:17:03,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 12:17:03,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,633 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2022-09-16 12:17:03,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 12:17:03,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 12:17:03,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 12:17:03,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 12:17:03,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 12:17:03,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 12:17:03,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 12:17:03,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 12:17:03,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (1/1) ... [2022-09-16 12:17:03,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 12:17:03,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:17:03,719 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-09-16 12:17:03,721 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-09-16 12:17:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 12:17:03,754 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 12:17:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 12:17:03,754 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 12:17:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 12:17:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 12:17:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 12:17:03,757 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 12:17:03,911 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 12:17:03,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 12:17:04,385 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 12:17:04,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 12:17:04,395 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 12:17:04,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 12:17:04 BoogieIcfgContainer [2022-09-16 12:17:04,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 12:17:04,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 12:17:04,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 12:17:04,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 12:17:04,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 12:17:02" (1/3) ... [2022-09-16 12:17:04,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e152a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 12:17:04, skipping insertion in model container [2022-09-16 12:17:04,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 12:17:03" (2/3) ... [2022-09-16 12:17:04,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e152a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 12:17:04, skipping insertion in model container [2022-09-16 12:17:04,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 12:17:04" (3/3) ... [2022-09-16 12:17:04,405 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-09-16 12:17:04,412 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 12:17:04,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 12:17:04,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-09-16 12:17:04,419 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 12:17:04,505 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 12:17:04,549 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 12:17:04,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-16 12:17:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:17:04,559 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-09-16 12:17:04,577 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-09-16 12:17:04,594 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-16 12:17:04,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-09-16 12:17:04,615 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;@4f4644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 12:17:04,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-09-16 12:17:04,803 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-09-16 12:17:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1744336020, now seen corresponding path program 1 times [2022-09-16 12:17:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:04,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105685305] [2022-09-16 12:17:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105685305] [2022-09-16 12:17:12,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105685305] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:12,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:12,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 12:17:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166782784] [2022-09-16 12:17:12,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:12,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 12:17:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 12:17:12,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 12:17:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:12,865 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:12,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 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-09-16 12:17:12,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:16,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 12:17:16,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1610912531, now seen corresponding path program 1 times [2022-09-16 12:17:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:16,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400720511] [2022-09-16 12:17:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:16,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400720511] [2022-09-16 12:17:16,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400720511] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:16,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 12:17:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603669084] [2022-09-16 12:17:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:16,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:17:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:17:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 12:17:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:16,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:16,942 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-09-16 12:17:16,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:16,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:16,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 12:17:16,997 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-09-16 12:17:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 723281376, now seen corresponding path program 1 times [2022-09-16 12:17:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:16,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193582042] [2022-09-16 12:17:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193582042] [2022-09-16 12:17:17,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193582042] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:17,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:17,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 12:17:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091463513] [2022-09-16 12:17:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:17,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 12:17:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 12:17:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-09-16 12:17:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:17,380 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:17,380 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-09-16 12:17:17,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:17,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:17,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 12:17:17,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 12:17:17,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -429721795, now seen corresponding path program 1 times [2022-09-16 12:17:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:17,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71985130] [2022-09-16 12:17:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71985130] [2022-09-16 12:17:19,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71985130] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:19,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:19,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 12:17:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411017968] [2022-09-16 12:17:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:19,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 12:17:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 12:17:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-09-16 12:17:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:19,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:19,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.470588235294118) internal successors, (93), 18 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-09-16 12:17:19,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:19,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:19,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-09-16 12:17:19,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:20,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 12:17:20,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1802980663, now seen corresponding path program 1 times [2022-09-16 12:17:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:20,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203125973] [2022-09-16 12:17:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:21,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203125973] [2022-09-16 12:17:21,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203125973] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:21,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:21,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-09-16 12:17:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543554488] [2022-09-16 12:17:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:21,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-09-16 12:17:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-09-16 12:17:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-09-16 12:17:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:21,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:21,478 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-09-16 12:17:21,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:21,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:21,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:21,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:21,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-09-16 12:17:23,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 12:17:23,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash -57824887, now seen corresponding path program 1 times [2022-09-16 12:17:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:23,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134982862] [2022-09-16 12:17:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:23,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134982862] [2022-09-16 12:17:23,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134982862] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:23,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:23,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-09-16 12:17:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115230376] [2022-09-16 12:17:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:23,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 12:17:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 12:17:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-09-16 12:17:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:23,844 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:23,844 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-09-16 12:17:23,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:23,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:23,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:23,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:23,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-09-16 12:17:23,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 12:17:25,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 12:17:25,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2015843190, now seen corresponding path program 1 times [2022-09-16 12:17:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887367365] [2022-09-16 12:17:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:25,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887367365] [2022-09-16 12:17:25,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887367365] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:25,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:25,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 12:17:25,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582888885] [2022-09-16 12:17:25,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:25,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 12:17:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 12:17:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 12:17:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:25,278 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-09-16 12:17:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-09-16 12:17:25,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 12:17:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 12:17:25,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1324173979, now seen corresponding path program 1 times [2022-09-16 12:17:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:25,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399035935] [2022-09-16 12:17:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:25,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399035935] [2022-09-16 12:17:25,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399035935] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:25,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:25,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:17:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872473073] [2022-09-16 12:17:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:25,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:17:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:17:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 12:17:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:25,412 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-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:25,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 12:17:25,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash -405804637, now seen corresponding path program 1 times [2022-09-16 12:17:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:25,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631409816] [2022-09-16 12:17:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:25,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631409816] [2022-09-16 12:17:25,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631409816] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:25,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:25,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:17:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548393286] [2022-09-16 12:17:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:25,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 12:17:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 12:17:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 12:17:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:25,605 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-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:25,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 12:17:25,624 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2042911622, now seen corresponding path program 1 times [2022-09-16 12:17:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:25,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631238353] [2022-09-16 12:17:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 12:17:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631238353] [2022-09-16 12:17:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631238353] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:25,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:25,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:17:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513005349] [2022-09-16 12:17:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:25,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 12:17:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 12:17:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 12:17:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:25,700 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-09-16 12:17:25,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:25,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:25,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:25,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 12:17:25,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:25,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1094249960, now seen corresponding path program 1 times [2022-09-16 12:17:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:25,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82105275] [2022-09-16 12:17:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:25,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:25,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82105275] [2022-09-16 12:17:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82105275] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:17:25,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028372782] [2022-09-16 12:17:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:25,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:17:25,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:17:25,798 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-09-16 12:17:25,801 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-09-16 12:17:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:25,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 12:17:25,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:17:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:26,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 12:17:26,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028372782] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:26,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 12:17:26,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 12:17:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789647463] [2022-09-16 12:17:26,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 12:17:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:26,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 12:17:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 12:17:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:26,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:26,120 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-09-16 12:17:26,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:26,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:26,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:26,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:26,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:26,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-16 12:17:26,874 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,SelfDestructingSolverStorable10 [2022-09-16 12:17:26,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1814340167, now seen corresponding path program 1 times [2022-09-16 12:17:26,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:26,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082938434] [2022-09-16 12:17:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 12:17:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082938434] [2022-09-16 12:17:26,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082938434] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:26,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:26,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 12:17:26,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670217304] [2022-09-16 12:17:26,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 12:17:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 12:17:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 12:17:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:26,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:26,950 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-09-16 12:17:26,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:26,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:26,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:26,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:27,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-16 12:17:27,019 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-09-16 12:17:27,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1103981716, now seen corresponding path program 1 times [2022-09-16 12:17:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:27,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201194799] [2022-09-16 12:17:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:27,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:27,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201194799] [2022-09-16 12:17:27,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201194799] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:27,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:27,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-09-16 12:17:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793040178] [2022-09-16 12:17:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:27,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 12:17:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 12:17:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-09-16 12:17:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:27,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:27,827 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-09-16 12:17:27,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:27,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:27,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:27,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:29,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-16 12:17:29,396 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1831608018, now seen corresponding path program 1 times [2022-09-16 12:17:29,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145885318] [2022-09-16 12:17:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145885318] [2022-09-16 12:17:30,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145885318] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:30,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:30,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-09-16 12:17:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121491129] [2022-09-16 12:17:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:30,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 12:17:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:30,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 12:17:30,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-09-16 12:17:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:30,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:30,092 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-09-16 12:17:30,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:30,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:30,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:31,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-16 12:17:31,499 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash 945274546, now seen corresponding path program 1 times [2022-09-16 12:17:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:31,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028695357] [2022-09-16 12:17:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:31,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028695357] [2022-09-16 12:17:31,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028695357] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 12:17:31,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 12:17:31,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-16 12:17:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722225166] [2022-09-16 12:17:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 12:17:31,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-09-16 12:17:31,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 12:17:31,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-09-16 12:17:31,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-09-16 12:17:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:31,956 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 12:17:31,956 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-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:31,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:31,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 12:17:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 12:17:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 12:17:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 12:17:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 12:17:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 12:17:33,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-16 12:17:33,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2022-09-16 12:17:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 12:17:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1948536619, now seen corresponding path program 1 times [2022-09-16 12:17:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 12:17:33,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059426297] [2022-09-16 12:17:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 12:17:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 12:17:35,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059426297] [2022-09-16 12:17:35,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059426297] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 12:17:35,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000706179] [2022-09-16 12:17:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 12:17:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:17:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 12:17:35,544 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-09-16 12:17:35,569 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-09-16 12:17:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 12:17:35,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 85 conjunts are in the unsatisfiable core [2022-09-16 12:17:35,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 12:17:36,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:36,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:17:36,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:37,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 12:17:37,227 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 12:17:37,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:37,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:17:37,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:37,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:38,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:17:38,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:38,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:17:38,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:17:38,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-09-16 12:17:38,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 12:17:38,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 12:17:38,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:38,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:39,353 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 12:17:39,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 44 [2022-09-16 12:17:39,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 15 [2022-09-16 12:17:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 12:17:39,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 12:17:52,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 Int)) (let ((.cse0 (select (store |c_#memory_int| |ULTIMATE.start_main_~#id2~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719)) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1))))) is different from false [2022-09-16 12:17:52,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647)))) is different from false [2022-09-16 12:17:53,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647)))) is different from false [2022-09-16 12:17:53,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1))))) is different from false [2022-09-16 12:17:53,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1))))) is different from false [2022-09-16 12:17:53,136 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 12:17:53,152 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 12:17:53,202 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_714) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_714 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647)))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-09-16 12:17:53,245 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_722 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_714) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse2 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_714) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647))))) is different from false [2022-09-16 12:17:53,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 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_712)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse4 .cse5))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_714) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (= .cse2 20) (< 2147483647 v_ArrVal_714) (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647)))))) is different from false [2022-09-16 12:17:53,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_712)))) (let ((.cse2 (select .cse4 .cse5))) (let ((.cse0 (select (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_714) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_725) .cse1) 2147483647) (= .cse2 20) (< 2147483647 v_ArrVal_714) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)))))))) is different from false [2022-09-16 12:17:53,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_712)))) (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 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_714) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse3 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< 2147483647 v_ArrVal_714) (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647) (= .cse2 20))))))) is different from false [2022-09-16 12:17:53,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_712)))) (let ((.cse1 (+ 88 |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_714) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* 4 (select .cse0 .cse2)) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< 2147483647 v_ArrVal_714) (= 20 .cse3))))))) is different from false [2022-09-16 12:17:54,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_711))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_712)))) (let ((.cse1 (+ 88 |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_714) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)) (< 2147483647 v_ArrVal_714) (= .cse3 20))))))) is different from false [2022-09-16 12:17:54,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_711))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_712)))) (let ((.cse2 (+ 88 |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_714) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|))) (or (= .cse0 20) (< 2147483647 v_ArrVal_714) (< (select .cse1 .cse2) (+ v_ArrVal_722 1)) (< (select (store (store (store .cse1 .cse2 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse1 .cse3) 4)) v_ArrVal_725) .cse2) 2147483647))))))) is different from false [2022-09-16 12:17:54,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_711))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_712)))) (let ((.cse2 (+ 88 |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_714) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|))) (or (= .cse0 20) (< (select .cse1 .cse2) (+ v_ArrVal_722 1)) (< 2147483647 v_ArrVal_714) (< (select (store (store (store .cse1 .cse2 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_725) .cse2) 2147483647))))))) is different from false [2022-09-16 12:17:54,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_711))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_712)))) (let ((.cse1 (+ 88 |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_714) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_725) .cse1) 2147483647) (= 20 .cse3) (< 2147483647 v_ArrVal_714) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)))))))) is different from false [2022-09-16 12:17:54,678 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_725 Int) (|ULTIMATE.start_main_~#id2~0#1.base| Int) (v_ArrVal_724 Int) (v_ArrVal_712 Int) (v_ArrVal_722 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_711))) (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_712)))) (let ((.cse1 (+ 88 |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_714) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_718))) (store .cse4 |ULTIMATE.start_main_~#id2~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~#id2~0#1.base|) |c_ULTIMATE.start_main_~#id2~0#1.offset| v_ArrVal_719))) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_722) (+ |c_~#queue~0.offset| 80) v_ArrVal_724) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_725) .cse1) 2147483647) (= 20 .cse3) (< 2147483647 v_ArrVal_714) (< (select .cse0 .cse1) (+ v_ArrVal_722 1)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-09-16 12:17:54,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:17:54,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:17:54,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 12:17:54,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70405 treesize of output 67063 [2022-09-16 12:17:54,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76203 treesize of output 71595 [2022-09-16 12:17:55,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73295 treesize of output 71427 [2022-09-16 12:17:55,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-16 12:30:36,586 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-16 12:30:36,588 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-09-16 12:30:36,601 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-09-16 12:30:36,605 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-09-16 12:30:36,605 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 12:30:36,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-16 12:30:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 12:30:36,789 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. [2022-09-16 12:30:36,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-09-16 12:30:36,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-09-16 12:30:36,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-09-16 12:30:36,795 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 12:30:36,797 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/3) [2022-09-16 12:30:36,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 12:30:36,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 12:30:36,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 12:30:36 BasicIcfg [2022-09-16 12:30:36,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 12:30:36,802 INFO L158 Benchmark]: Toolchain (without parser) took 813813.10ms. Allocated memory was 264.2MB in the beginning and 685.8MB in the end (delta: 421.5MB). Free memory was 235.2MB in the beginning and 246.6MB in the end (delta: -11.4MB). Peak memory consumption was 451.6MB. Max. memory is 8.0GB. [2022-09-16 12:30:36,802 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 12:30:36,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.72ms. Allocated memory is still 264.2MB. Free memory was 234.7MB in the beginning and 213.4MB in the end (delta: 21.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-09-16 12:30:36,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.32ms. Allocated memory is still 264.2MB. Free memory was 213.4MB in the beginning and 210.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 12:30:36,803 INFO L158 Benchmark]: Boogie Preprocessor took 38.55ms. Allocated memory is still 264.2MB. Free memory was 210.2MB in the beginning and 208.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 12:30:36,803 INFO L158 Benchmark]: RCFGBuilder took 723.56ms. Allocated memory is still 264.2MB. Free memory was 208.1MB in the beginning and 183.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-09-16 12:30:36,803 INFO L158 Benchmark]: TraceAbstraction took 812401.99ms. Allocated memory was 264.2MB in the beginning and 685.8MB in the end (delta: 421.5MB). Free memory was 183.0MB in the beginning and 246.6MB in the end (delta: -63.6MB). Peak memory consumption was 400.4MB. Max. memory is 8.0GB. [2022-09-16 12:30:36,804 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.14ms. Allocated memory is still 189.8MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 584.72ms. Allocated memory is still 264.2MB. Free memory was 234.7MB in the beginning and 213.4MB in the end (delta: 21.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.32ms. Allocated memory is still 264.2MB. Free memory was 213.4MB in the beginning and 210.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.55ms. Allocated memory is still 264.2MB. Free memory was 210.2MB in the beginning and 208.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 723.56ms. Allocated memory is still 264.2MB. Free memory was 208.1MB in the beginning and 183.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 812401.99ms. Allocated memory was 264.2MB in the beginning and 685.8MB in the end (delta: 421.5MB). Free memory was 183.0MB in the beginning and 246.6MB in the end (delta: -63.6MB). Peak memory consumption was 400.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19529, positive: 19174, positive conditional: 2327, positive unconditional: 16847, negative: 355, negative conditional: 289, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19244, positive: 19174, positive conditional: 2327, positive unconditional: 16847, negative: 70, negative conditional: 4, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19244, positive: 19174, positive conditional: 2327, positive unconditional: 16847, negative: 70, negative conditional: 4, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19299, positive: 19174, positive conditional: 8, positive unconditional: 19166, negative: 125, negative conditional: 47, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19299, positive: 19174, positive conditional: 8, positive unconditional: 19166, negative: 125, negative conditional: 3, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19299, positive: 19174, positive conditional: 8, positive unconditional: 19166, negative: 125, negative conditional: 3, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14802, positive: 14734, positive conditional: 1, positive unconditional: 14733, negative: 68, negative conditional: 2, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14802, positive: 14724, positive conditional: 0, positive unconditional: 14724, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 10, positive conditional: 1, positive unconditional: 9, negative: 68, negative conditional: 2, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 55, positive conditional: 2, positive unconditional: 54, negative: 109, negative conditional: 4, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19299, positive: 4440, positive conditional: 7, positive unconditional: 4433, negative: 57, negative conditional: 1, negative unconditional: 56, unknown: 14802, unknown conditional: 3, unknown unconditional: 14799] , Statistics on independence cache: Total cache size (in pairs): 14802, Positive cache size: 14734, Positive conditional cache size: 1, Positive unconditional cache size: 14733, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 44, Maximal queried relation: 11, Independence queries for same thread: 285 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 372, Number of trivial persistent sets: 242, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16913, positive: 16847, positive conditional: 0, positive unconditional: 16847, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19529, positive: 19174, positive conditional: 2327, positive unconditional: 16847, negative: 355, negative conditional: 289, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19244, positive: 19174, positive conditional: 2327, positive unconditional: 16847, negative: 70, negative conditional: 4, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19244, positive: 19174, positive conditional: 2327, positive unconditional: 16847, negative: 70, negative conditional: 4, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19299, positive: 19174, positive conditional: 8, positive unconditional: 19166, negative: 125, negative conditional: 47, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19299, positive: 19174, positive conditional: 8, positive unconditional: 19166, negative: 125, negative conditional: 3, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19299, positive: 19174, positive conditional: 8, positive unconditional: 19166, negative: 125, negative conditional: 3, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14802, positive: 14734, positive conditional: 1, positive unconditional: 14733, negative: 68, negative conditional: 2, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14802, positive: 14724, positive conditional: 0, positive unconditional: 14724, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 10, positive conditional: 1, positive unconditional: 9, negative: 68, negative conditional: 2, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 55, positive conditional: 2, positive unconditional: 54, negative: 109, negative conditional: 4, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19299, positive: 4440, positive conditional: 7, positive unconditional: 4433, negative: 57, negative conditional: 1, negative unconditional: 56, unknown: 14802, unknown conditional: 3, unknown unconditional: 14799] , Statistics on independence cache: Total cache size (in pairs): 14802, Positive cache size: 14734, Positive conditional cache size: 1, Positive unconditional cache size: 14733, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 44, Maximal queried relation: 11, Independence queries for same thread: 285 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 240 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 10ms.. - 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.2s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.5s, 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: 227, 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.4s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 2527 NumberOfCodeBlocks, 2527 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2511 ConstructedInterpolants, 0 QuantifiedInterpolants, 33778 SizeOfPredicates, 3 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 86/94 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