/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.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/weaver/chl-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 10:47:33,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 10:47:33,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 10:47:33,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 10:47:33,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 10:47:33,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 10:47:33,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 10:47:33,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 10:47:33,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 10:47:33,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 10:47:33,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 10:47:33,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 10:47:33,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 10:47:33,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 10:47:33,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 10:47:33,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 10:47:33,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 10:47:33,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 10:47:33,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 10:47:33,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 10:47:33,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 10:47:33,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 10:47:33,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 10:47:33,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 10:47:33,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 10:47:33,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 10:47:33,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 10:47:33,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 10:47:33,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 10:47:33,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 10:47:33,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 10:47:33,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 10:47:33,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 10:47:33,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 10:47:33,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 10:47:33,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 10:47:33,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 10:47:33,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 10:47:33,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 10:47:33,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 10:47:33,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 10:47:33,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-09-16 10:47:33,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 10:47:33,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 10:47:33,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 10:47:33,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 10:47:33,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 10:47:33,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 10:47:33,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 10:47:33,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 10:47:33,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 10:47:33,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 10:47:33,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 10:47:33,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 10:47:33,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 10:47:33,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 10:47:33,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 10:47:33,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 10:47:33,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 10:47:33,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 10:47:33,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 10:47:33,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:47:33,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 10:47:33,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 10:47:33,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 10:47:33,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 10:47:33,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 10:47:33,555 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 10:47:33,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 10:47:33,555 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 10:47:33,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 10:47:33,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 10:47:33,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 10:47:33,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 10:47:33,812 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 10:47:33,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2022-09-16 10:47:33,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d65d586f/ea370029076f4d898690bae9e3670e7c/FLAGaffc80cb7 [2022-09-16 10:47:34,260 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 10:47:34,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2022-09-16 10:47:34,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d65d586f/ea370029076f4d898690bae9e3670e7c/FLAGaffc80cb7 [2022-09-16 10:47:34,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d65d586f/ea370029076f4d898690bae9e3670e7c [2022-09-16 10:47:34,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 10:47:34,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 10:47:34,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 10:47:34,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 10:47:34,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 10:47:34,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a67824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34, skipping insertion in model container [2022-09-16 10:47:34,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 10:47:34,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 10:47:34,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c[2482,2495] [2022-09-16 10:47:34,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:47:34,562 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 10:47:34,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c[2482,2495] [2022-09-16 10:47:34,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:47:34,598 INFO L208 MainTranslator]: Completed translation [2022-09-16 10:47:34,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34 WrapperNode [2022-09-16 10:47:34,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 10:47:34,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 10:47:34,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 10:47:34,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 10:47:34,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,644 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 238 [2022-09-16 10:47:34,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 10:47:34,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 10:47:34,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 10:47:34,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 10:47:34,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 10:47:34,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 10:47:34,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 10:47:34,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 10:47:34,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (1/1) ... [2022-09-16 10:47:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:47:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:47:34,705 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 10:47:34,719 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 10:47:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 10:47:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 10:47:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 10:47:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 10:47:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 10:47:34,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 10:47:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 10:47:34,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 10:47:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 10:47:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 10:47:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 10:47:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 10:47:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 10:47:34,743 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 10:47:34,822 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 10:47:34,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 10:47:35,226 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 10:47:35,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 10:47:35,239 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-16 10:47:35,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:47:35 BoogieIcfgContainer [2022-09-16 10:47:35,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 10:47:35,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 10:47:35,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 10:47:35,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 10:47:35,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 10:47:34" (1/3) ... [2022-09-16 10:47:35,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677dd16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:47:35, skipping insertion in model container [2022-09-16 10:47:35,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:47:34" (2/3) ... [2022-09-16 10:47:35,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677dd16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:47:35, skipping insertion in model container [2022-09-16 10:47:35,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:47:35" (3/3) ... [2022-09-16 10:47:35,255 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2022-09-16 10:47:35,262 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 10:47:35,273 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 10:47:35,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-09-16 10:47:35,274 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 10:47:35,430 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 10:47:35,479 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 307 places, 325 transitions, 666 flow [2022-09-16 10:47:36,175 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22161 states, 22037 states have (on average 2.891092253936561) internal successors, (63711), 22160 states have internal predecessors, (63711), 0 states have call successors, (0), 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 10:47:36,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 10:47:36,196 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d7f344d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 10:47:36,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-09-16 10:47:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 22161 states, 22037 states have (on average 2.891092253936561) internal successors, (63711), 22160 states have internal predecessors, (63711), 0 states have call successors, (0), 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 10:47:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-09-16 10:47:36,327 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:36,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:36,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2019046624, now seen corresponding path program 1 times [2022-09-16 10:47:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408922937] [2022-09-16 10:47:36,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:36,601 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 10:47:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408922937] [2022-09-16 10:47:36,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408922937] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:36,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:47:36,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:47:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896342563] [2022-09-16 10:47:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:47:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:47:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:47:36,669 INFO L87 Difference]: Start difference. First operand has 22161 states, 22037 states have (on average 2.891092253936561) internal successors, (63711), 22160 states have internal predecessors, (63711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 10:47:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:37,607 INFO L93 Difference]: Finished difference Result 44250 states and 123914 transitions. [2022-09-16 10:47:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:47:37,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-09-16 10:47:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:37,960 INFO L225 Difference]: With dead ends: 44250 [2022-09-16 10:47:37,960 INFO L226 Difference]: Without dead ends: 43850 [2022-09-16 10:47:37,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:47:37,965 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 199 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 769 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:47:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43850 states. [2022-09-16 10:47:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43850 to 21973. [2022-09-16 10:47:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21973 states, 21809 states have (on average 2.8175982392590213) internal successors, (61449), 21972 states have internal predecessors, (61449), 0 states have call successors, (0), 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 10:47:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21973 states to 21973 states and 61449 transitions. [2022-09-16 10:47:39,406 INFO L78 Accepts]: Start accepts. Automaton has 21973 states and 61449 transitions. Word has length 53 [2022-09-16 10:47:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:39,408 INFO L495 AbstractCegarLoop]: Abstraction has 21973 states and 61449 transitions. [2022-09-16 10:47:39,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 10:47:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21973 states and 61449 transitions. [2022-09-16 10:47:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-09-16 10:47:39,413 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:39,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:39,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 10:47:39,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2071201129, now seen corresponding path program 1 times [2022-09-16 10:47:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755663933] [2022-09-16 10:47:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755663933] [2022-09-16 10:47:39,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755663933] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:47:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045315901] [2022-09-16 10:47:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:47:39,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:47:39,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-16 10:47:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:39,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:47:39,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:47:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:39,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:47:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:39,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045315901] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:47:39,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:47:39,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 10:47:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047395458] [2022-09-16 10:47:39,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:47:39,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:47:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:47:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:47:39,879 INFO L87 Difference]: Start difference. First operand 21973 states and 61449 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 10:47:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:41,039 INFO L93 Difference]: Finished difference Result 109527 states and 306897 transitions. [2022-09-16 10:47:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 10:47:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-09-16 10:47:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:41,807 INFO L225 Difference]: With dead ends: 109527 [2022-09-16 10:47:41,807 INFO L226 Difference]: Without dead ends: 109527 [2022-09-16 10:47:41,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2022-09-16 10:47:41,809 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1210 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:41,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 2176 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:47:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109527 states. [2022-09-16 10:47:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109527 to 22025. [2022-09-16 10:47:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 21861 states have (on average 2.8137322171904304) internal successors, (61511), 22024 states have internal predecessors, (61511), 0 states have call successors, (0), 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 10:47:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 61511 transitions. [2022-09-16 10:47:43,381 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 61511 transitions. Word has length 62 [2022-09-16 10:47:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:43,381 INFO L495 AbstractCegarLoop]: Abstraction has 22025 states and 61511 transitions. [2022-09-16 10:47:43,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 10:47:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 61511 transitions. [2022-09-16 10:47:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-09-16 10:47:43,382 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:43,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:43,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-09-16 10:47:43,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:43,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:43,601 INFO L85 PathProgramCache]: Analyzing trace with hash -217273840, now seen corresponding path program 1 times [2022-09-16 10:47:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:43,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981372596] [2022-09-16 10:47:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981372596] [2022-09-16 10:47:43,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981372596] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:47:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289236426] [2022-09-16 10:47:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:43,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:47:43,704 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 10:47:43,706 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 10:47:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:43,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:47:43,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:47:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:43,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:47:43,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289236426] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:43,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:47:43,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:47:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150901285] [2022-09-16 10:47:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:43,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:47:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:47:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:47:43,846 INFO L87 Difference]: Start difference. First operand 22025 states and 61511 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 10:47:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:44,137 INFO L93 Difference]: Finished difference Result 43896 states and 122850 transitions. [2022-09-16 10:47:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:47:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-09-16 10:47:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:44,582 INFO L225 Difference]: With dead ends: 43896 [2022-09-16 10:47:44,582 INFO L226 Difference]: Without dead ends: 43896 [2022-09-16 10:47:44,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:47:44,586 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 403 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:44,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1175 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:47:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43896 states. [2022-09-16 10:47:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43896 to 22023. [2022-09-16 10:47:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22023 states, 21861 states have (on average 2.813457755820868) internal successors, (61505), 22022 states have internal predecessors, (61505), 0 states have call successors, (0), 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 10:47:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22023 states to 22023 states and 61505 transitions. [2022-09-16 10:47:45,305 INFO L78 Accepts]: Start accepts. Automaton has 22023 states and 61505 transitions. Word has length 63 [2022-09-16 10:47:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:45,306 INFO L495 AbstractCegarLoop]: Abstraction has 22023 states and 61505 transitions. [2022-09-16 10:47:45,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 10:47:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 22023 states and 61505 transitions. [2022-09-16 10:47:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 10:47:45,308 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:45,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:45,324 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 10:47:45,510 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,SelfDestructingSolverStorable2 [2022-09-16 10:47:45,510 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 136033972, now seen corresponding path program 1 times [2022-09-16 10:47:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:45,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142784890] [2022-09-16 10:47:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:45,741 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 10:47:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:45,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142784890] [2022-09-16 10:47:45,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142784890] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:45,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:47:45,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 10:47:45,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851752845] [2022-09-16 10:47:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:45,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-16 10:47:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-16 10:47:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:47:45,753 INFO L87 Difference]: Start difference. First operand 22023 states and 61505 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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 10:47:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:46,521 INFO L93 Difference]: Finished difference Result 43359 states and 121248 transitions. [2022-09-16 10:47:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-16 10:47:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-09-16 10:47:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:46,648 INFO L225 Difference]: With dead ends: 43359 [2022-09-16 10:47:46,649 INFO L226 Difference]: Without dead ends: 43359 [2022-09-16 10:47:46,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:47:46,650 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 1786 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:46,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 2259 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:47:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43359 states. [2022-09-16 10:47:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43359 to 23957. [2022-09-16 10:47:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23957 states, 23795 states have (on average 2.8049169993696155) internal successors, (66743), 23956 states have internal predecessors, (66743), 0 states have call successors, (0), 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 10:47:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23957 states to 23957 states and 66743 transitions. [2022-09-16 10:47:47,685 INFO L78 Accepts]: Start accepts. Automaton has 23957 states and 66743 transitions. Word has length 86 [2022-09-16 10:47:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:47,686 INFO L495 AbstractCegarLoop]: Abstraction has 23957 states and 66743 transitions. [2022-09-16 10:47:47,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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 10:47:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23957 states and 66743 transitions. [2022-09-16 10:47:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-09-16 10:47:47,692 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:47,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:47,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 10:47:47,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -77913376, now seen corresponding path program 1 times [2022-09-16 10:47:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:47,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082563148] [2022-09-16 10:47:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:47,840 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 10:47:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:47,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082563148] [2022-09-16 10:47:47,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082563148] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:47,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:47:47,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:47:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376426239] [2022-09-16 10:47:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:47,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-16 10:47:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-16 10:47:47,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:47:47,844 INFO L87 Difference]: Start difference. First operand 23957 states and 66743 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 10:47:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:48,259 INFO L93 Difference]: Finished difference Result 47381 states and 132100 transitions. [2022-09-16 10:47:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-16 10:47:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-09-16 10:47:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:48,548 INFO L225 Difference]: With dead ends: 47381 [2022-09-16 10:47:48,548 INFO L226 Difference]: Without dead ends: 47381 [2022-09-16 10:47:48,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-09-16 10:47:48,550 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 1675 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:48,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 884 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:47:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47381 states. [2022-09-16 10:47:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47381 to 24067. [2022-09-16 10:47:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24067 states, 23906 states have (on average 2.7914749435288213) internal successors, (66733), 24066 states have internal predecessors, (66733), 0 states have call successors, (0), 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 10:47:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24067 states to 24067 states and 66733 transitions. [2022-09-16 10:47:49,334 INFO L78 Accepts]: Start accepts. Automaton has 24067 states and 66733 transitions. Word has length 87 [2022-09-16 10:47:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:49,335 INFO L495 AbstractCegarLoop]: Abstraction has 24067 states and 66733 transitions. [2022-09-16 10:47:49,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 10:47:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24067 states and 66733 transitions. [2022-09-16 10:47:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 10:47:49,336 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:49,336 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:49,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 10:47:49,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash -641400544, now seen corresponding path program 2 times [2022-09-16 10:47:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:49,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121009248] [2022-09-16 10:47:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121009248] [2022-09-16 10:47:49,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121009248] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:47:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246901247] [2022-09-16 10:47:49,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:47:49,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:47:49,433 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 10:47:49,435 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 10:47:49,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 10:47:49,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:47:49,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-16 10:47:49,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:47:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 10:47:49,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:47:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 10:47:49,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246901247] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:47:49,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:47:49,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-09-16 10:47:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237255831] [2022-09-16 10:47:49,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:47:49,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 10:47:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:49,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 10:47:49,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 10:47:49,784 INFO L87 Difference]: Start difference. First operand 24067 states and 66733 transitions. Second operand has 18 states, 17 states have (on average 7.705882352941177) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 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 10:47:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:51,851 INFO L93 Difference]: Finished difference Result 166108 states and 463248 transitions. [2022-09-16 10:47:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-09-16 10:47:51,852 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.705882352941177) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-09-16 10:47:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:52,726 INFO L225 Difference]: With dead ends: 166108 [2022-09-16 10:47:52,726 INFO L226 Difference]: Without dead ends: 166108 [2022-09-16 10:47:52,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=991, Invalid=3041, Unknown=0, NotChecked=0, Total=4032 [2022-09-16 10:47:52,729 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 4480 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4480 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:52,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4480 Valid, 2761 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:47:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166108 states. [2022-09-16 10:47:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166108 to 24070. [2022-09-16 10:47:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24070 states, 23910 states have (on average 2.7911752404851526) internal successors, (66737), 24069 states have internal predecessors, (66737), 0 states have call successors, (0), 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 10:47:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24070 states to 24070 states and 66737 transitions. [2022-09-16 10:47:54,477 INFO L78 Accepts]: Start accepts. Automaton has 24070 states and 66737 transitions. Word has length 89 [2022-09-16 10:47:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:54,477 INFO L495 AbstractCegarLoop]: Abstraction has 24070 states and 66737 transitions. [2022-09-16 10:47:54,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.705882352941177) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 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 10:47:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 24070 states and 66737 transitions. [2022-09-16 10:47:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-09-16 10:47:54,478 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:54,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:54,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 10:47:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:54,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 129225358, now seen corresponding path program 1 times [2022-09-16 10:47:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:54,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222086219] [2022-09-16 10:47:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:54,866 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 10:47:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:54,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222086219] [2022-09-16 10:47:54,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222086219] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:54,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:47:54,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-16 10:47:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417143159] [2022-09-16 10:47:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:54,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:47:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:47:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:47:54,868 INFO L87 Difference]: Start difference. First operand 24070 states and 66737 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 10:47:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:55,566 INFO L93 Difference]: Finished difference Result 47085 states and 130989 transitions. [2022-09-16 10:47:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 10:47:55,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-09-16 10:47:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:55,694 INFO L225 Difference]: With dead ends: 47085 [2022-09-16 10:47:55,694 INFO L226 Difference]: Without dead ends: 47085 [2022-09-16 10:47:55,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2022-09-16 10:47:55,695 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 2340 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:55,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2340 Valid, 1513 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:47:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47085 states. [2022-09-16 10:47:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47085 to 25998. [2022-09-16 10:47:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25998 states, 25839 states have (on average 2.7665544332211) internal successors, (71485), 25997 states have internal predecessors, (71485), 0 states have call successors, (0), 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 10:47:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25998 states to 25998 states and 71485 transitions. [2022-09-16 10:47:56,564 INFO L78 Accepts]: Start accepts. Automaton has 25998 states and 71485 transitions. Word has length 92 [2022-09-16 10:47:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:56,564 INFO L495 AbstractCegarLoop]: Abstraction has 25998 states and 71485 transitions. [2022-09-16 10:47:56,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 10:47:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 25998 states and 71485 transitions. [2022-09-16 10:47:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 10:47:56,566 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:56,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:56,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 10:47:56,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1715872949, now seen corresponding path program 1 times [2022-09-16 10:47:56,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:56,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383106329] [2022-09-16 10:47:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:56,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:56,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383106329] [2022-09-16 10:47:56,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383106329] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:47:56,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009625022] [2022-09-16 10:47:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:47:56,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:47:56,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 10:47:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:57,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 10:47:57,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:47:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:47:57,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:47:57,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009625022] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:57,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:47:57,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2022-09-16 10:47:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323966802] [2022-09-16 10:47:57,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:57,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-16 10:47:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-16 10:47:57,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:47:57,340 INFO L87 Difference]: Start difference. First operand 25998 states and 71485 transitions. Second operand has 9 states, 8 states have (on average 11.875) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 10:47:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:57,647 INFO L93 Difference]: Finished difference Result 25409 states and 69834 transitions. [2022-09-16 10:47:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-16 10:47:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.875) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-09-16 10:47:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:57,707 INFO L225 Difference]: With dead ends: 25409 [2022-09-16 10:47:57,707 INFO L226 Difference]: Without dead ends: 25409 [2022-09-16 10:47:57,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-09-16 10:47:57,708 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 976 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:57,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 727 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:47:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25409 states. [2022-09-16 10:47:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25409 to 22433. [2022-09-16 10:47:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22433 states, 22297 states have (on average 2.783289231735211) internal successors, (62059), 22432 states have internal predecessors, (62059), 0 states have call successors, (0), 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 10:47:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22433 states to 22433 states and 62059 transitions. [2022-09-16 10:47:58,227 INFO L78 Accepts]: Start accepts. Automaton has 22433 states and 62059 transitions. Word has length 95 [2022-09-16 10:47:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:58,228 INFO L495 AbstractCegarLoop]: Abstraction has 22433 states and 62059 transitions. [2022-09-16 10:47:58,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.875) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 10:47:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 22433 states and 62059 transitions. [2022-09-16 10:47:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 10:47:58,228 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:58,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:58,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 10:47:58,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:58,429 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 27620158, now seen corresponding path program 1 times [2022-09-16 10:47:58,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:58,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227186108] [2022-09-16 10:47:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:58,485 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 10:47:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227186108] [2022-09-16 10:47:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227186108] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:47:58,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:47:58,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:47:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056584308] [2022-09-16 10:47:58,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:47:58,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:47:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:47:58,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:47:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:47:58,486 INFO L87 Difference]: Start difference. First operand 22433 states and 62059 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 10:47:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:47:58,683 INFO L93 Difference]: Finished difference Result 42535 states and 118236 transitions. [2022-09-16 10:47:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:47:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-09-16 10:47:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:47:58,952 INFO L225 Difference]: With dead ends: 42535 [2022-09-16 10:47:58,952 INFO L226 Difference]: Without dead ends: 42535 [2022-09-16 10:47:58,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:47:58,954 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 322 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:47:58,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1092 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:47:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42535 states. [2022-09-16 10:47:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42535 to 25241. [2022-09-16 10:47:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25241 states, 25105 states have (on average 2.8034256124278034) internal successors, (70380), 25240 states have internal predecessors, (70380), 0 states have call successors, (0), 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 10:47:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25241 states to 25241 states and 70380 transitions. [2022-09-16 10:47:59,643 INFO L78 Accepts]: Start accepts. Automaton has 25241 states and 70380 transitions. Word has length 96 [2022-09-16 10:47:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:47:59,644 INFO L495 AbstractCegarLoop]: Abstraction has 25241 states and 70380 transitions. [2022-09-16 10:47:59,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 10:47:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 25241 states and 70380 transitions. [2022-09-16 10:47:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 10:47:59,645 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:47:59,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:47:59,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 10:47:59,646 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:47:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:47:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1278009817, now seen corresponding path program 1 times [2022-09-16 10:47:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:47:59,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392474241] [2022-09-16 10:47:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:47:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:47:59,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:47:59,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392474241] [2022-09-16 10:47:59,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392474241] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:47:59,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631275078] [2022-09-16 10:47:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:47:59,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:47:59,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:47:59,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:47:59,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 10:47:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:47:59,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 10:47:59,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:00,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:48:00,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631275078] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:00,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:48:00,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2022-09-16 10:48:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619634620] [2022-09-16 10:48:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:00,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-16 10:48:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-16 10:48:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-09-16 10:48:00,278 INFO L87 Difference]: Start difference. First operand 25241 states and 70380 transitions. Second operand has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 10:48:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:00,689 INFO L93 Difference]: Finished difference Result 24616 states and 68916 transitions. [2022-09-16 10:48:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 10:48:00,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-09-16 10:48:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:00,763 INFO L225 Difference]: With dead ends: 24616 [2022-09-16 10:48:00,764 INFO L226 Difference]: Without dead ends: 24616 [2022-09-16 10:48:00,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2022-09-16 10:48:00,765 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 699 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:00,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 943 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:48:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24616 states. [2022-09-16 10:48:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24616 to 23467. [2022-09-16 10:48:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23467 states, 23354 states have (on average 2.8291085038965487) internal successors, (66071), 23466 states have internal predecessors, (66071), 0 states have call successors, (0), 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 10:48:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23467 states to 23467 states and 66071 transitions. [2022-09-16 10:48:01,362 INFO L78 Accepts]: Start accepts. Automaton has 23467 states and 66071 transitions. Word has length 96 [2022-09-16 10:48:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:01,362 INFO L495 AbstractCegarLoop]: Abstraction has 23467 states and 66071 transitions. [2022-09-16 10:48:01,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 10:48:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 23467 states and 66071 transitions. [2022-09-16 10:48:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-09-16 10:48:01,365 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:01,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:01,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 10:48:01,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-09-16 10:48:01,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2070988648, now seen corresponding path program 1 times [2022-09-16 10:48:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:01,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345314896] [2022-09-16 10:48:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:01,634 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 10:48:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:01,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345314896] [2022-09-16 10:48:01,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345314896] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:01,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:01,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:48:01,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481064299] [2022-09-16 10:48:01,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:01,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:48:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:01,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:48:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:01,636 INFO L87 Difference]: Start difference. First operand 23467 states and 66071 transitions. Second operand has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 10:48:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:02,142 INFO L93 Difference]: Finished difference Result 44334 states and 125478 transitions. [2022-09-16 10:48:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:48:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-09-16 10:48:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:02,273 INFO L225 Difference]: With dead ends: 44334 [2022-09-16 10:48:02,273 INFO L226 Difference]: Without dead ends: 44334 [2022-09-16 10:48:02,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:48:02,274 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 306 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:02,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1071 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:48:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44334 states. [2022-09-16 10:48:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44334 to 26410. [2022-09-16 10:48:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26410 states, 26297 states have (on average 2.8491082632999962) internal successors, (74923), 26409 states have internal predecessors, (74923), 0 states have call successors, (0), 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 10:48:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26410 states to 26410 states and 74923 transitions. [2022-09-16 10:48:02,982 INFO L78 Accepts]: Start accepts. Automaton has 26410 states and 74923 transitions. Word has length 102 [2022-09-16 10:48:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:02,983 INFO L495 AbstractCegarLoop]: Abstraction has 26410 states and 74923 transitions. [2022-09-16 10:48:02,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 10:48:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26410 states and 74923 transitions. [2022-09-16 10:48:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-09-16 10:48:02,986 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:02,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:02,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 10:48:02,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2068493101, now seen corresponding path program 1 times [2022-09-16 10:48:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:02,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108574105] [2022-09-16 10:48:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:03,041 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 10:48:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:03,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108574105] [2022-09-16 10:48:03,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108574105] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:03,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:03,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:48:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667633410] [2022-09-16 10:48:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:03,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 10:48:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 10:48:03,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 10:48:03,042 INFO L87 Difference]: Start difference. First operand 26410 states and 74923 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:48:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:03,287 INFO L93 Difference]: Finished difference Result 29202 states and 82053 transitions. [2022-09-16 10:48:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-16 10:48:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-09-16 10:48:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:03,348 INFO L225 Difference]: With dead ends: 29202 [2022-09-16 10:48:03,348 INFO L226 Difference]: Without dead ends: 28942 [2022-09-16 10:48:03,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:48:03,349 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 280 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:03,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1669 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:48:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28942 states. [2022-09-16 10:48:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28942 to 27896. [2022-09-16 10:48:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27896 states, 27783 states have (on average 2.8394341863729617) internal successors, (78888), 27895 states have internal predecessors, (78888), 0 states have call successors, (0), 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 10:48:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27896 states to 27896 states and 78888 transitions. [2022-09-16 10:48:04,104 INFO L78 Accepts]: Start accepts. Automaton has 27896 states and 78888 transitions. Word has length 105 [2022-09-16 10:48:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:04,104 INFO L495 AbstractCegarLoop]: Abstraction has 27896 states and 78888 transitions. [2022-09-16 10:48:04,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:48:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 27896 states and 78888 transitions. [2022-09-16 10:48:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-09-16 10:48:04,108 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:04,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:04,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-16 10:48:04,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2123285769, now seen corresponding path program 1 times [2022-09-16 10:48:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768018620] [2022-09-16 10:48:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:04,360 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 10:48:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:04,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768018620] [2022-09-16 10:48:04,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768018620] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:04,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:04,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:48:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27198668] [2022-09-16 10:48:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:04,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 10:48:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 10:48:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 10:48:04,362 INFO L87 Difference]: Start difference. First operand 27896 states and 78888 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:48:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:04,566 INFO L93 Difference]: Finished difference Result 26737 states and 75540 transitions. [2022-09-16 10:48:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-16 10:48:04,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-09-16 10:48:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:04,626 INFO L225 Difference]: With dead ends: 26737 [2022-09-16 10:48:04,626 INFO L226 Difference]: Without dead ends: 26505 [2022-09-16 10:48:04,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:48:04,627 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 148 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:04,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1013 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:48:04,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26505 states. [2022-09-16 10:48:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26505 to 26497. [2022-09-16 10:48:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26497 states, 26384 states have (on average 2.843086719223772) internal successors, (75012), 26496 states have internal predecessors, (75012), 0 states have call successors, (0), 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 10:48:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26497 states to 26497 states and 75012 transitions. [2022-09-16 10:48:05,253 INFO L78 Accepts]: Start accepts. Automaton has 26497 states and 75012 transitions. Word has length 111 [2022-09-16 10:48:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:05,253 INFO L495 AbstractCegarLoop]: Abstraction has 26497 states and 75012 transitions. [2022-09-16 10:48:05,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:48:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26497 states and 75012 transitions. [2022-09-16 10:48:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-09-16 10:48:05,257 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:05,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:05,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-16 10:48:05,257 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash 82975452, now seen corresponding path program 1 times [2022-09-16 10:48:05,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:05,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322308161] [2022-09-16 10:48:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322308161] [2022-09-16 10:48:05,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322308161] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:05,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:05,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:48:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298212584] [2022-09-16 10:48:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:05,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 10:48:05,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 10:48:05,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 10:48:05,330 INFO L87 Difference]: Start difference. First operand 26497 states and 75012 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 10:48:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:05,568 INFO L93 Difference]: Finished difference Result 29194 states and 82039 transitions. [2022-09-16 10:48:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 10:48:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-09-16 10:48:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:05,642 INFO L225 Difference]: With dead ends: 29194 [2022-09-16 10:48:05,642 INFO L226 Difference]: Without dead ends: 28934 [2022-09-16 10:48:05,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:48:05,643 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 905 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:05,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1077 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:48:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28934 states. [2022-09-16 10:48:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28934 to 27896. [2022-09-16 10:48:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27896 states, 27783 states have (on average 2.8391822337400567) internal successors, (78881), 27895 states have internal predecessors, (78881), 0 states have call successors, (0), 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 10:48:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27896 states to 27896 states and 78881 transitions. [2022-09-16 10:48:06,353 INFO L78 Accepts]: Start accepts. Automaton has 27896 states and 78881 transitions. Word has length 114 [2022-09-16 10:48:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:06,353 INFO L495 AbstractCegarLoop]: Abstraction has 27896 states and 78881 transitions. [2022-09-16 10:48:06,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 10:48:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27896 states and 78881 transitions. [2022-09-16 10:48:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 10:48:06,358 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:06,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:06,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-16 10:48:06,359 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash 26290258, now seen corresponding path program 1 times [2022-09-16 10:48:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:06,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019819600] [2022-09-16 10:48:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:06,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019819600] [2022-09-16 10:48:06,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019819600] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:06,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:06,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:48:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32873047] [2022-09-16 10:48:06,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:06,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 10:48:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 10:48:06,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 10:48:06,421 INFO L87 Difference]: Start difference. First operand 27896 states and 78881 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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 10:48:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:06,984 INFO L93 Difference]: Finished difference Result 26729 states and 75526 transitions. [2022-09-16 10:48:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 10:48:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 10:48:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:07,047 INFO L225 Difference]: With dead ends: 26729 [2022-09-16 10:48:07,048 INFO L226 Difference]: Without dead ends: 26497 [2022-09-16 10:48:07,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:48:07,048 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 504 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:07,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1058 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:48:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26497 states. [2022-09-16 10:48:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26497 to 26497. [2022-09-16 10:48:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26497 states, 26384 states have (on average 2.8430488174651303) internal successors, (75011), 26496 states have internal predecessors, (75011), 0 states have call successors, (0), 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 10:48:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26497 states to 26497 states and 75011 transitions. [2022-09-16 10:48:07,755 INFO L78 Accepts]: Start accepts. Automaton has 26497 states and 75011 transitions. Word has length 120 [2022-09-16 10:48:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:07,755 INFO L495 AbstractCegarLoop]: Abstraction has 26497 states and 75011 transitions. [2022-09-16 10:48:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 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 10:48:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 26497 states and 75011 transitions. [2022-09-16 10:48:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-09-16 10:48:07,759 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:07,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:07,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-16 10:48:07,759 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash -714306653, now seen corresponding path program 1 times [2022-09-16 10:48:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:07,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228456112] [2022-09-16 10:48:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228456112] [2022-09-16 10:48:08,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228456112] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937792752] [2022-09-16 10:48:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:08,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:08,028 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 10:48:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:08,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2022-09-16 10:48:08,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:08,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:48:08,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:48:08,431 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 14 treesize of output 16 [2022-09-16 10:48:08,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:48:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:08,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:08,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_261) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:08,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:08,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:08,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:08,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:08,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-09-16 10:48:08,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:08,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2022-09-16 10:48:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-09-16 10:48:08,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937792752] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:08,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:08,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-09-16 10:48:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288397526] [2022-09-16 10:48:08,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:08,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-09-16 10:48:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-09-16 10:48:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1213, Unknown=4, NotChecked=292, Total=1640 [2022-09-16 10:48:09,001 INFO L87 Difference]: Start difference. First operand 26497 states and 75011 transitions. Second operand has 41 states, 40 states have (on average 6.575) internal successors, (263), 41 states have internal predecessors, (263), 0 states have call successors, (0), 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 10:48:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:11,690 INFO L93 Difference]: Finished difference Result 61537 states and 171723 transitions. [2022-09-16 10:48:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:48:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 6.575) internal successors, (263), 41 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-09-16 10:48:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:11,875 INFO L225 Difference]: With dead ends: 61537 [2022-09-16 10:48:11,875 INFO L226 Difference]: Without dead ends: 61537 [2022-09-16 10:48:11,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 220 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=579, Invalid=3215, Unknown=4, NotChecked=492, Total=4290 [2022-09-16 10:48:11,877 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 3685 mSDsluCounter, 9065 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3685 SdHoareTripleChecker+Valid, 9434 SdHoareTripleChecker+Invalid, 4259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2657 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:11,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3685 Valid, 9434 Invalid, 4259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1553 Invalid, 0 Unknown, 2657 Unchecked, 0.8s Time] [2022-09-16 10:48:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61537 states. [2022-09-16 10:48:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61537 to 29536. [2022-09-16 10:48:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29536 states, 29423 states have (on average 2.847670189987425) internal successors, (83787), 29535 states have internal predecessors, (83787), 0 states have call successors, (0), 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 10:48:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29536 states to 29536 states and 83787 transitions. [2022-09-16 10:48:13,062 INFO L78 Accepts]: Start accepts. Automaton has 29536 states and 83787 transitions. Word has length 123 [2022-09-16 10:48:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:13,062 INFO L495 AbstractCegarLoop]: Abstraction has 29536 states and 83787 transitions. [2022-09-16 10:48:13,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 6.575) internal successors, (263), 41 states have internal predecessors, (263), 0 states have call successors, (0), 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 10:48:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29536 states and 83787 transitions. [2022-09-16 10:48:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-09-16 10:48:13,083 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:13,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:13,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-16 10:48:13,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 10:48:13,285 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -668668937, now seen corresponding path program 1 times [2022-09-16 10:48:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:13,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766374297] [2022-09-16 10:48:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:48:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766374297] [2022-09-16 10:48:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766374297] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:13,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:13,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:48:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190746137] [2022-09-16 10:48:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:48:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:48:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:13,330 INFO L87 Difference]: Start difference. First operand 29536 states and 83787 transitions. Second operand has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 10:48:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:13,585 INFO L93 Difference]: Finished difference Result 39954 states and 112700 transitions. [2022-09-16 10:48:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:48:13,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-09-16 10:48:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:13,687 INFO L225 Difference]: With dead ends: 39954 [2022-09-16 10:48:13,687 INFO L226 Difference]: Without dead ends: 39954 [2022-09-16 10:48:13,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:13,688 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 249 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:13,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 771 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:48:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39954 states. [2022-09-16 10:48:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39954 to 32506. [2022-09-16 10:48:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32506 states, 32404 states have (on average 2.8608196518948277) internal successors, (92702), 32505 states have internal predecessors, (92702), 0 states have call successors, (0), 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 10:48:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32506 states to 32506 states and 92702 transitions. [2022-09-16 10:48:14,546 INFO L78 Accepts]: Start accepts. Automaton has 32506 states and 92702 transitions. Word has length 124 [2022-09-16 10:48:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:14,546 INFO L495 AbstractCegarLoop]: Abstraction has 32506 states and 92702 transitions. [2022-09-16 10:48:14,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 10:48:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32506 states and 92702 transitions. [2022-09-16 10:48:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-09-16 10:48:14,551 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:14,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:14,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-16 10:48:14,552 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash -201057529, now seen corresponding path program 1 times [2022-09-16 10:48:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:14,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059104690] [2022-09-16 10:48:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:14,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:14,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059104690] [2022-09-16 10:48:14,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059104690] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:14,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226421359] [2022-09-16 10:48:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:14,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:14,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:14,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-16 10:48:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:14,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 10:48:14,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:14,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:15,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226421359] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:15,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:15,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-09-16 10:48:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528613185] [2022-09-16 10:48:15,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:15,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-09-16 10:48:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:15,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-09-16 10:48:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:48:15,256 INFO L87 Difference]: Start difference. First operand 32506 states and 92702 transitions. Second operand has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 0 states have call successors, (0), 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 10:48:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:17,675 INFO L93 Difference]: Finished difference Result 118411 states and 334766 transitions. [2022-09-16 10:48:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-09-16 10:48:17,676 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-09-16 10:48:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:18,090 INFO L225 Difference]: With dead ends: 118411 [2022-09-16 10:48:18,090 INFO L226 Difference]: Without dead ends: 117163 [2022-09-16 10:48:18,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=886, Invalid=4226, Unknown=0, NotChecked=0, Total=5112 [2022-09-16 10:48:18,091 INFO L413 NwaCegarLoop]: 541 mSDtfsCounter, 6361 mSDsluCounter, 9651 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6361 SdHoareTripleChecker+Valid, 10042 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:18,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6361 Valid, 10042 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-09-16 10:48:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117163 states. [2022-09-16 10:48:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117163 to 37474. [2022-09-16 10:48:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37474 states, 37372 states have (on average 2.861233008669592) internal successors, (106930), 37473 states have internal predecessors, (106930), 0 states have call successors, (0), 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 10:48:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37474 states to 37474 states and 106930 transitions. [2022-09-16 10:48:19,816 INFO L78 Accepts]: Start accepts. Automaton has 37474 states and 106930 transitions. Word has length 125 [2022-09-16 10:48:19,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:19,816 INFO L495 AbstractCegarLoop]: Abstraction has 37474 states and 106930 transitions. [2022-09-16 10:48:19,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 0 states have call successors, (0), 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 10:48:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 37474 states and 106930 transitions. [2022-09-16 10:48:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-09-16 10:48:19,821 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:19,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:19,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-16 10:48:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:20,043 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -336105010, now seen corresponding path program 1 times [2022-09-16 10:48:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888718256] [2022-09-16 10:48:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:20,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888718256] [2022-09-16 10:48:20,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888718256] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:20,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791791614] [2022-09-16 10:48:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:20,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:20,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-16 10:48:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:20,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 31 conjunts are in the unsatisfiable core [2022-09-16 10:48:20,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:20,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:48:20,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:48:20,964 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 14 treesize of output 16 [2022-09-16 10:48:21,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:48:21,077 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 14 treesize of output 16 [2022-09-16 10:48:21,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:48:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:21,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:21,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) c_~a2~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a2~0.offset)) 9223372039002259456)) is different from false [2022-09-16 10:48:21,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:21,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_338 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:21,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_338 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:21,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_338 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:21,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_338 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:21,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:21,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-09-16 10:48:21,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:21,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2022-09-16 10:48:21,403 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 53 treesize of output 49 [2022-09-16 10:48:21,407 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 102 treesize of output 94 [2022-09-16 10:48:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-09-16 10:48:22,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791791614] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:22,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:22,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 45 [2022-09-16 10:48:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835411130] [2022-09-16 10:48:22,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-09-16 10:48:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-09-16 10:48:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1437, Unknown=6, NotChecked=486, Total=2070 [2022-09-16 10:48:22,009 INFO L87 Difference]: Start difference. First operand 37474 states and 106930 transitions. Second operand has 46 states, 45 states have (on average 6.177777777777778) internal successors, (278), 46 states have internal predecessors, (278), 0 states have call successors, (0), 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 10:48:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:24,755 INFO L93 Difference]: Finished difference Result 79577 states and 223369 transitions. [2022-09-16 10:48:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 10:48:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 6.177777777777778) internal successors, (278), 46 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-09-16 10:48:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:24,995 INFO L225 Difference]: With dead ends: 79577 [2022-09-16 10:48:24,996 INFO L226 Difference]: Without dead ends: 79577 [2022-09-16 10:48:24,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 226 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=515, Invalid=2925, Unknown=6, NotChecked=714, Total=4160 [2022-09-16 10:48:24,997 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 4804 mSDsluCounter, 9387 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4804 SdHoareTripleChecker+Valid, 9791 SdHoareTripleChecker+Invalid, 6298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4660 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:24,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4804 Valid, 9791 Invalid, 6298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1577 Invalid, 0 Unknown, 4660 Unchecked, 0.8s Time] [2022-09-16 10:48:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79577 states. [2022-09-16 10:48:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79577 to 41374. [2022-09-16 10:48:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41374 states, 41272 states have (on average 2.8695483620856757) internal successors, (118432), 41373 states have internal predecessors, (118432), 0 states have call successors, (0), 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 10:48:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41374 states to 41374 states and 118432 transitions. [2022-09-16 10:48:26,474 INFO L78 Accepts]: Start accepts. Automaton has 41374 states and 118432 transitions. Word has length 128 [2022-09-16 10:48:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:26,474 INFO L495 AbstractCegarLoop]: Abstraction has 41374 states and 118432 transitions. [2022-09-16 10:48:26,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 6.177777777777778) internal successors, (278), 46 states have internal predecessors, (278), 0 states have call successors, (0), 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 10:48:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 41374 states and 118432 transitions. [2022-09-16 10:48:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-09-16 10:48:26,480 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:26,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:26,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-16 10:48:26,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:26,695 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash -412112935, now seen corresponding path program 1 times [2022-09-16 10:48:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:26,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365284713] [2022-09-16 10:48:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:26,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:48:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:27,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365284713] [2022-09-16 10:48:27,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365284713] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:27,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995841778] [2022-09-16 10:48:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:27,174 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-16 10:48:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:27,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 48 conjunts are in the unsatisfiable core [2022-09-16 10:48:27,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:27,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:48:27,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 10:48:27,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 10:48:27,400 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:48:27,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 10:48:27,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:48:28,108 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-09-16 10:48:28,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-09-16 10:48:28,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 10:48:28,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 10:48:28,373 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 14 treesize of output 16 [2022-09-16 10:48:28,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:48:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:48:28,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:28,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:28,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:28,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:28,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_379) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:29,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:29,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-09-16 10:48:29,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:29,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 240 [2022-09-16 10:48:29,162 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 226 treesize of output 210 [2022-09-16 10:48:29,167 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 210 treesize of output 202 [2022-09-16 10:48:29,173 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 202 treesize of output 198 [2022-09-16 10:48:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:48:29,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995841778] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:29,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:29,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 52 [2022-09-16 10:48:29,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739086308] [2022-09-16 10:48:29,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:29,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-09-16 10:48:29,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:29,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-09-16 10:48:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2125, Unknown=11, NotChecked=388, Total=2756 [2022-09-16 10:48:29,901 INFO L87 Difference]: Start difference. First operand 41374 states and 118432 transitions. Second operand has 53 states, 52 states have (on average 5.923076923076923) internal successors, (308), 53 states have internal predecessors, (308), 0 states have call successors, (0), 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 10:48:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:33,059 INFO L93 Difference]: Finished difference Result 127467 states and 360501 transitions. [2022-09-16 10:48:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-09-16 10:48:33,059 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 5.923076923076923) internal successors, (308), 53 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-09-16 10:48:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:33,504 INFO L225 Difference]: With dead ends: 127467 [2022-09-16 10:48:33,505 INFO L226 Difference]: Without dead ends: 127467 [2022-09-16 10:48:33,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=916, Invalid=5729, Unknown=13, NotChecked=652, Total=7310 [2022-09-16 10:48:33,506 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 2119 mSDsluCounter, 14237 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 14594 SdHoareTripleChecker+Invalid, 6318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4743 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:33,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 14594 Invalid, 6318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1537 Invalid, 0 Unknown, 4743 Unchecked, 0.7s Time] [2022-09-16 10:48:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127467 states. [2022-09-16 10:48:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127467 to 48556. [2022-09-16 10:48:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48556 states, 48454 states have (on average 2.870433813513848) internal successors, (139084), 48555 states have internal predecessors, (139084), 0 states have call successors, (0), 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 10:48:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48556 states to 48556 states and 139084 transitions. [2022-09-16 10:48:35,304 INFO L78 Accepts]: Start accepts. Automaton has 48556 states and 139084 transitions. Word has length 129 [2022-09-16 10:48:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:35,304 INFO L495 AbstractCegarLoop]: Abstraction has 48556 states and 139084 transitions. [2022-09-16 10:48:35,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 5.923076923076923) internal successors, (308), 53 states have internal predecessors, (308), 0 states have call successors, (0), 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 10:48:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 48556 states and 139084 transitions. [2022-09-16 10:48:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-09-16 10:48:35,312 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:35,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:35,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-09-16 10:48:35,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:35,513 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 109401809, now seen corresponding path program 1 times [2022-09-16 10:48:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976314472] [2022-09-16 10:48:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:48:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:35,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976314472] [2022-09-16 10:48:35,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976314472] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:35,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:35,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:48:35,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479820544] [2022-09-16 10:48:35,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:35,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:48:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:35,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:48:35,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:35,546 INFO L87 Difference]: Start difference. First operand 48556 states and 139084 transitions. Second operand has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 10:48:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:36,168 INFO L93 Difference]: Finished difference Result 64288 states and 183522 transitions. [2022-09-16 10:48:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:48:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-09-16 10:48:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:36,409 INFO L225 Difference]: With dead ends: 64288 [2022-09-16 10:48:36,410 INFO L226 Difference]: Without dead ends: 64288 [2022-09-16 10:48:36,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:36,413 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 235 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:36,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 755 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:48:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64288 states. [2022-09-16 10:48:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64288 to 53155. [2022-09-16 10:48:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53155 states, 53063 states have (on average 2.8848350074439817) internal successors, (153078), 53154 states have internal predecessors, (153078), 0 states have call successors, (0), 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 10:48:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53155 states to 53155 states and 153078 transitions. [2022-09-16 10:48:38,008 INFO L78 Accepts]: Start accepts. Automaton has 53155 states and 153078 transitions. Word has length 130 [2022-09-16 10:48:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:38,008 INFO L495 AbstractCegarLoop]: Abstraction has 53155 states and 153078 transitions. [2022-09-16 10:48:38,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 10:48:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 53155 states and 153078 transitions. [2022-09-16 10:48:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-09-16 10:48:38,018 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:38,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:38,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-16 10:48:38,019 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1850668099, now seen corresponding path program 1 times [2022-09-16 10:48:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:38,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991621718] [2022-09-16 10:48:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:38,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:38,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991621718] [2022-09-16 10:48:38,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991621718] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076866918] [2022-09-16 10:48:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:38,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:38,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:38,120 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:38,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-16 10:48:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:38,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 10:48:38,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:38,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:38,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076866918] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:38,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:38,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-09-16 10:48:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367377088] [2022-09-16 10:48:38,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:38,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-09-16 10:48:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:38,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-09-16 10:48:38,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:48:38,645 INFO L87 Difference]: Start difference. First operand 53155 states and 153078 transitions. Second operand has 28 states, 28 states have (on average 9.785714285714286) internal successors, (274), 28 states have internal predecessors, (274), 0 states have call successors, (0), 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 10:48:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:40,527 INFO L93 Difference]: Finished difference Result 110964 states and 314580 transitions. [2022-09-16 10:48:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-09-16 10:48:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.785714285714286) internal successors, (274), 28 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-09-16 10:48:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:40,870 INFO L225 Difference]: With dead ends: 110964 [2022-09-16 10:48:40,870 INFO L226 Difference]: Without dead ends: 108876 [2022-09-16 10:48:40,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=826, Invalid=4430, Unknown=0, NotChecked=0, Total=5256 [2022-09-16 10:48:40,871 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 7800 mSDsluCounter, 8053 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7800 SdHoareTripleChecker+Valid, 8463 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:40,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7800 Valid, 8463 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:48:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108876 states. [2022-09-16 10:48:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108876 to 55507. [2022-09-16 10:48:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55507 states, 55415 states have (on average 2.871334476224849) internal successors, (159115), 55506 states have internal predecessors, (159115), 0 states have call successors, (0), 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 10:48:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55507 states to 55507 states and 159115 transitions. [2022-09-16 10:48:42,952 INFO L78 Accepts]: Start accepts. Automaton has 55507 states and 159115 transitions. Word has length 131 [2022-09-16 10:48:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:42,954 INFO L495 AbstractCegarLoop]: Abstraction has 55507 states and 159115 transitions. [2022-09-16 10:48:42,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.785714285714286) internal successors, (274), 28 states have internal predecessors, (274), 0 states have call successors, (0), 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 10:48:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 55507 states and 159115 transitions. [2022-09-16 10:48:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:48:42,964 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:42,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:42,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-09-16 10:48:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-09-16 10:48:43,179 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1232589662, now seen corresponding path program 1 times [2022-09-16 10:48:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:43,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198501691] [2022-09-16 10:48:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:48:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:43,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198501691] [2022-09-16 10:48:43,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198501691] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:48:43,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:48:43,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:48:43,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593053837] [2022-09-16 10:48:43,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:48:43,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:48:43,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:43,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:48:43,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:43,213 INFO L87 Difference]: Start difference. First operand 55507 states and 159115 transitions. Second operand has 4 states, 3 states have (on average 44.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 10:48:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:43,728 INFO L93 Difference]: Finished difference Result 67357 states and 190449 transitions. [2022-09-16 10:48:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:48:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-09-16 10:48:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:43,911 INFO L225 Difference]: With dead ends: 67357 [2022-09-16 10:48:43,911 INFO L226 Difference]: Without dead ends: 67357 [2022-09-16 10:48:43,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:48:43,912 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 211 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:43,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 972 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:48:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67357 states. [2022-09-16 10:48:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67357 to 55507. [2022-09-16 10:48:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55507 states, 55415 states have (on average 2.861842461427411) internal successors, (158589), 55506 states have internal predecessors, (158589), 0 states have call successors, (0), 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 10:48:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55507 states to 55507 states and 158589 transitions. [2022-09-16 10:48:45,507 INFO L78 Accepts]: Start accepts. Automaton has 55507 states and 158589 transitions. Word has length 132 [2022-09-16 10:48:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:45,508 INFO L495 AbstractCegarLoop]: Abstraction has 55507 states and 158589 transitions. [2022-09-16 10:48:45,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 10:48:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55507 states and 158589 transitions. [2022-09-16 10:48:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-09-16 10:48:45,518 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:45,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:45,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-16 10:48:45,519 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash -188282180, now seen corresponding path program 2 times [2022-09-16 10:48:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:45,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621885572] [2022-09-16 10:48:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:45,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:45,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621885572] [2022-09-16 10:48:45,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621885572] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:45,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768134513] [2022-09-16 10:48:45,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:48:45,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:45,811 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:45,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-09-16 10:48:45,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:48:45,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:48:45,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-16 10:48:45,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:46,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 10:48:46,144 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 10:48:46,145 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:48:46,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:48:46,255 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 14 treesize of output 16 [2022-09-16 10:48:46,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:48:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:46,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:46,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:48:46,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:46,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:46,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:46,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (v_ArrVal_478 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_476)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:48:46,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| Int)) (or (forall ((v_ArrVal_476 Int) (v_ArrVal_478 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_476)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51|)))) is different from false [2022-09-16 10:48:46,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| Int) (v_ArrVal_478 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_476)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 10:48:46,837 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 10:48:46,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-09-16 10:48:46,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:46,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2022-09-16 10:48:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-09-16 10:48:47,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768134513] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:47,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:47,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2022-09-16 10:48:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450071844] [2022-09-16 10:48:47,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:47,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:48:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:48:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1583, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 10:48:47,047 INFO L87 Difference]: Start difference. First operand 55507 states and 158589 transitions. Second operand has 49 states, 48 states have (on average 6.0625) internal successors, (291), 49 states have internal predecessors, (291), 0 states have call successors, (0), 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 10:48:47,910 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1| 2147483647) (forall ((v_ArrVal_476 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| Int) (v_ArrVal_478 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_476)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)) is different from false [2022-09-16 10:48:48,205 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_476 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| Int) (v_ArrVal_478 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_476)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)) is different from false [2022-09-16 10:48:50,215 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse0 0) 2147483647) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| Int)) (or (forall ((v_ArrVal_476 Int) (v_ArrVal_478 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_476)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_51|)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647))) is different from false [2022-09-16 10:48:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:52,816 INFO L93 Difference]: Finished difference Result 110949 states and 313654 transitions. [2022-09-16 10:48:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-09-16 10:48:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.0625) internal successors, (291), 49 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-09-16 10:48:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:53,171 INFO L225 Difference]: With dead ends: 110949 [2022-09-16 10:48:53,171 INFO L226 Difference]: Without dead ends: 110949 [2022-09-16 10:48:53,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=713, Invalid=4719, Unknown=10, NotChecked=1530, Total=6972 [2022-09-16 10:48:53,173 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 2810 mSDsluCounter, 11142 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2810 SdHoareTripleChecker+Valid, 11472 SdHoareTripleChecker+Invalid, 8051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5811 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:53,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2810 Valid, 11472 Invalid, 8051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2180 Invalid, 0 Unknown, 5811 Unchecked, 0.9s Time] [2022-09-16 10:48:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110949 states. [2022-09-16 10:48:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110949 to 56467. [2022-09-16 10:48:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56467 states, 56375 states have (on average 2.8640354767184037) internal successors, (161460), 56466 states have internal predecessors, (161460), 0 states have call successors, (0), 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 10:48:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56467 states to 56467 states and 161460 transitions. [2022-09-16 10:48:55,262 INFO L78 Accepts]: Start accepts. Automaton has 56467 states and 161460 transitions. Word has length 132 [2022-09-16 10:48:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:48:55,263 INFO L495 AbstractCegarLoop]: Abstraction has 56467 states and 161460 transitions. [2022-09-16 10:48:55,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.0625) internal successors, (291), 49 states have internal predecessors, (291), 0 states have call successors, (0), 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 10:48:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 56467 states and 161460 transitions. [2022-09-16 10:48:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-09-16 10:48:55,274 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:48:55,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:48:55,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-09-16 10:48:55,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-09-16 10:48:55,499 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:48:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:48:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -444425299, now seen corresponding path program 1 times [2022-09-16 10:48:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:48:55,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442618591] [2022-09-16 10:48:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:48:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:48:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442618591] [2022-09-16 10:48:55,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442618591] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:48:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907516112] [2022-09-16 10:48:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:48:55,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:48:55,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:48:55,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:48:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-09-16 10:48:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:48:55,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 29 conjunts are in the unsatisfiable core [2022-09-16 10:48:55,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:48:55,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:48:56,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:48:56,091 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 16 treesize of output 18 [2022-09-16 10:48:56,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:48:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:48:56,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:48:56,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_509) c_~a2~0.base) c_~a2~0.offset) 4294967296))) is different from false [2022-09-16 10:48:56,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 4294967296))) is different from false [2022-09-16 10:48:56,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-09-16 10:48:56,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-09-16 10:48:56,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:56,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-16 10:48:56,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:48:56,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2022-09-16 10:48:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-09-16 10:48:56,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907516112] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:48:56,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:48:56,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-09-16 10:48:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161827139] [2022-09-16 10:48:56,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:48:56,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-09-16 10:48:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:48:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-09-16 10:48:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1213, Unknown=4, NotChecked=292, Total=1640 [2022-09-16 10:48:56,493 INFO L87 Difference]: Start difference. First operand 56467 states and 161460 transitions. Second operand has 41 states, 40 states have (on average 7.1) internal successors, (284), 41 states have internal predecessors, (284), 0 states have call successors, (0), 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 10:48:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:48:58,657 INFO L93 Difference]: Finished difference Result 90843 states and 257557 transitions. [2022-09-16 10:48:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 10:48:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.1) internal successors, (284), 41 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-09-16 10:48:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:48:58,937 INFO L225 Difference]: With dead ends: 90843 [2022-09-16 10:48:58,937 INFO L226 Difference]: Without dead ends: 90843 [2022-09-16 10:48:58,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=3024, Unknown=4, NotChecked=476, Total=4032 [2022-09-16 10:48:58,939 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 2718 mSDsluCounter, 9297 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 9642 SdHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2587 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:48:58,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2718 Valid, 9642 Invalid, 4081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1451 Invalid, 0 Unknown, 2587 Unchecked, 0.6s Time] [2022-09-16 10:48:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90843 states. [2022-09-16 10:49:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90843 to 64271. [2022-09-16 10:49:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64271 states, 64179 states have (on average 2.8760497982206017) internal successors, (184582), 64270 states have internal predecessors, (184582), 0 states have call successors, (0), 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 10:49:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64271 states to 64271 states and 184582 transitions. [2022-09-16 10:49:00,733 INFO L78 Accepts]: Start accepts. Automaton has 64271 states and 184582 transitions. Word has length 133 [2022-09-16 10:49:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:00,733 INFO L495 AbstractCegarLoop]: Abstraction has 64271 states and 184582 transitions. [2022-09-16 10:49:00,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.1) internal successors, (284), 41 states have internal predecessors, (284), 0 states have call successors, (0), 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 10:49:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 64271 states and 184582 transitions. [2022-09-16 10:49:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-09-16 10:49:00,745 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:00,745 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:00,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-09-16 10:49:00,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-09-16 10:49:00,946 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1123962220, now seen corresponding path program 1 times [2022-09-16 10:49:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:00,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811714383] [2022-09-16 10:49:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:49:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811714383] [2022-09-16 10:49:01,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811714383] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:49:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096618861] [2022-09-16 10:49:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:49:01,078 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:49:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-09-16 10:49:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:01,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 10:49:01,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:49:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:49:01,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:49:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:49:01,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096618861] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:49:01,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:49:01,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2022-09-16 10:49:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788411126] [2022-09-16 10:49:01,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:49:01,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-09-16 10:49:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:01,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-09-16 10:49:01,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2022-09-16 10:49:01,739 INFO L87 Difference]: Start difference. First operand 64271 states and 184582 transitions. Second operand has 32 states, 31 states have (on average 6.580645161290323) internal successors, (204), 32 states have internal predecessors, (204), 0 states have call successors, (0), 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 10:49:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:07,446 INFO L93 Difference]: Finished difference Result 625339 states and 1792241 transitions. [2022-09-16 10:49:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 10:49:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 6.580645161290323) internal successors, (204), 32 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-09-16 10:49:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:49:10,821 INFO L225 Difference]: With dead ends: 625339 [2022-09-16 10:49:10,822 INFO L226 Difference]: Without dead ends: 625339 [2022-09-16 10:49:10,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1084, Invalid=2338, Unknown=0, NotChecked=0, Total=3422 [2022-09-16 10:49:10,823 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 6638 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6638 SdHoareTripleChecker+Valid, 3316 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:49:10,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6638 Valid, 3316 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:49:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625339 states. [2022-09-16 10:49:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625339 to 64487. [2022-09-16 10:49:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64487 states, 64395 states have (on average 2.8700054352045967) internal successors, (184814), 64486 states have internal predecessors, (184814), 0 states have call successors, (0), 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 10:49:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64487 states to 64487 states and 184814 transitions. [2022-09-16 10:49:18,440 INFO L78 Accepts]: Start accepts. Automaton has 64487 states and 184814 transitions. Word has length 134 [2022-09-16 10:49:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:18,440 INFO L495 AbstractCegarLoop]: Abstraction has 64487 states and 184814 transitions. [2022-09-16 10:49:18,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 6.580645161290323) internal successors, (204), 32 states have internal predecessors, (204), 0 states have call successors, (0), 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 10:49:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 64487 states and 184814 transitions. [2022-09-16 10:49:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-09-16 10:49:18,456 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:18,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:18,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-09-16 10:49:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-09-16 10:49:18,681 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1015594768, now seen corresponding path program 1 times [2022-09-16 10:49:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:18,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249291009] [2022-09-16 10:49:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:49:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249291009] [2022-09-16 10:49:18,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249291009] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:49:18,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:49:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 10:49:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685546386] [2022-09-16 10:49:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:49:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-16 10:49:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-16 10:49:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:49:18,728 INFO L87 Difference]: Start difference. First operand 64487 states and 184814 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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 10:49:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:19,622 INFO L93 Difference]: Finished difference Result 79409 states and 225301 transitions. [2022-09-16 10:49:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 10:49:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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) Word has length 135 [2022-09-16 10:49:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:49:19,837 INFO L225 Difference]: With dead ends: 79409 [2022-09-16 10:49:19,837 INFO L226 Difference]: Without dead ends: 79409 [2022-09-16 10:49:19,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-09-16 10:49:19,838 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 326 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:49:19,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1434 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:49:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79409 states. [2022-09-16 10:49:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79409 to 63435. [2022-09-16 10:49:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63435 states, 63353 states have (on average 2.8704560162896784) internal successors, (181852), 63434 states have internal predecessors, (181852), 0 states have call successors, (0), 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 10:49:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63435 states to 63435 states and 181852 transitions. [2022-09-16 10:49:21,477 INFO L78 Accepts]: Start accepts. Automaton has 63435 states and 181852 transitions. Word has length 135 [2022-09-16 10:49:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:21,477 INFO L495 AbstractCegarLoop]: Abstraction has 63435 states and 181852 transitions. [2022-09-16 10:49:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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 10:49:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 63435 states and 181852 transitions. [2022-09-16 10:49:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-09-16 10:49:21,493 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:21,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-09-16 10:49:21,494 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 922581589, now seen corresponding path program 2 times [2022-09-16 10:49:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:21,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540547774] [2022-09-16 10:49:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:49:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:21,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540547774] [2022-09-16 10:49:21,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540547774] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:49:21,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257369083] [2022-09-16 10:49:21,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:49:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:49:21,858 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:49:21,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-09-16 10:49:21,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:49:21,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:49:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 10:49:21,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:49:22,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 10:49:22,316 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 10:49:22,316 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 10:49:22,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:22,489 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 14 treesize of output 16 [2022-09-16 10:49:22,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:22,583 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 14 treesize of output 16 [2022-09-16 10:49:22,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:49:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:49:22,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:49:22,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~a2~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a2~0.offset)) 9223372039002259456)) is different from false [2022-09-16 10:49:22,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:22,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) c_~a2~0.base) c_~a2~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:22,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:49:22,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:49:22,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:49:22,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 10:49:22,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71|)) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) is different from false [2022-09-16 10:49:22,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_608 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-09-16 10:49:22,887 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 10:49:22,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-09-16 10:49:23,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:23,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2022-09-16 10:49:23,130 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 53 treesize of output 49 [2022-09-16 10:49:23,134 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 102 treesize of output 94 [2022-09-16 10:49:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-09-16 10:49:23,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257369083] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:49:23,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:49:23,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2022-09-16 10:49:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796943603] [2022-09-16 10:49:23,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:49:23,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 10:49:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 10:49:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1833, Unknown=9, NotChecked=846, Total=2862 [2022-09-16 10:49:23,483 INFO L87 Difference]: Start difference. First operand 63435 states and 181852 transitions. Second operand has 54 states, 53 states have (on average 5.754716981132075) internal successors, (305), 54 states have internal predecessors, (305), 0 states have call successors, (0), 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 10:49:24,472 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_608 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1| 2147483647) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0))) is different from false [2022-09-16 10:49:24,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_608 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0))) is different from false [2022-09-16 10:49:26,797 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71|)) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_608 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_71| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_606)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 10:49:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:29,279 INFO L93 Difference]: Finished difference Result 104031 states and 293932 transitions. [2022-09-16 10:49:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 10:49:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 5.754716981132075) internal successors, (305), 54 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-09-16 10:49:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:49:29,638 INFO L225 Difference]: With dead ends: 104031 [2022-09-16 10:49:29,638 INFO L226 Difference]: Without dead ends: 104031 [2022-09-16 10:49:29,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=644, Invalid=4222, Unknown=12, NotChecked=1764, Total=6642 [2022-09-16 10:49:29,639 INFO L413 NwaCegarLoop]: 522 mSDtfsCounter, 3623 mSDsluCounter, 9773 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3623 SdHoareTripleChecker+Valid, 10158 SdHoareTripleChecker+Invalid, 9011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6858 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:49:29,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3623 Valid, 10158 Invalid, 9011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2079 Invalid, 0 Unknown, 6858 Unchecked, 0.9s Time] [2022-09-16 10:49:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104031 states. [2022-09-16 10:49:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104031 to 60377. [2022-09-16 10:49:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60377 states, 60295 states have (on average 2.8644000331702464) internal successors, (172709), 60376 states have internal predecessors, (172709), 0 states have call successors, (0), 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 10:49:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60377 states to 60377 states and 172709 transitions. [2022-09-16 10:49:31,779 INFO L78 Accepts]: Start accepts. Automaton has 60377 states and 172709 transitions. Word has length 137 [2022-09-16 10:49:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:31,780 INFO L495 AbstractCegarLoop]: Abstraction has 60377 states and 172709 transitions. [2022-09-16 10:49:31,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 5.754716981132075) internal successors, (305), 54 states have internal predecessors, (305), 0 states have call successors, (0), 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 10:49:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60377 states and 172709 transitions. [2022-09-16 10:49:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-09-16 10:49:31,792 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:31,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:31,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-09-16 10:49:31,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:31,993 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1385170968, now seen corresponding path program 1 times [2022-09-16 10:49:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191202126] [2022-09-16 10:49:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:49:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:32,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191202126] [2022-09-16 10:49:32,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191202126] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:49:32,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013886185] [2022-09-16 10:49:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:32,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:49:32,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:49:32,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-09-16 10:49:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:32,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-09-16 10:49:32,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:49:32,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:49:32,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:32,875 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 16 treesize of output 18 [2022-09-16 10:49:32,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:32,975 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 16 treesize of output 18 [2022-09-16 10:49:33,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:49:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:49:33,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:49:33,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645) c_~a2~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a2~0.offset)) 4294967296))) is different from false [2022-09-16 10:49:33,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645) c_~a2~0.base) c_~a2~0.offset) 4294967296))) is different from false [2022-09-16 10:49:33,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645) c_~a2~0.base) c_~a2~0.offset)))) is different from false [2022-09-16 10:49:33,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 4294967296))) is different from false [2022-09-16 10:49:33,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-09-16 10:49:33,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-09-16 10:49:33,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:33,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 10:49:33,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:33,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2022-09-16 10:49:33,221 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 56 treesize of output 52 [2022-09-16 10:49:33,225 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 26 treesize of output 24 [2022-09-16 10:49:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-09-16 10:49:33,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013886185] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:49:33,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:49:33,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 45 [2022-09-16 10:49:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281835706] [2022-09-16 10:49:33,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:49:33,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-09-16 10:49:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-09-16 10:49:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1437, Unknown=6, NotChecked=486, Total=2070 [2022-09-16 10:49:33,541 INFO L87 Difference]: Start difference. First operand 60377 states and 172709 transitions. Second operand has 46 states, 45 states have (on average 6.644444444444445) internal successors, (299), 46 states have internal predecessors, (299), 0 states have call successors, (0), 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 10:49:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:36,187 INFO L93 Difference]: Finished difference Result 95075 states and 268834 transitions. [2022-09-16 10:49:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 10:49:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 6.644444444444445) internal successors, (299), 46 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-09-16 10:49:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:49:36,640 INFO L225 Difference]: With dead ends: 95075 [2022-09-16 10:49:36,640 INFO L226 Difference]: Without dead ends: 95075 [2022-09-16 10:49:36,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 246 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=515, Invalid=2925, Unknown=6, NotChecked=714, Total=4160 [2022-09-16 10:49:36,641 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 4603 mSDsluCounter, 9265 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4603 SdHoareTripleChecker+Valid, 9664 SdHoareTripleChecker+Invalid, 5575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4004 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:49:36,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4603 Valid, 9664 Invalid, 5575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1509 Invalid, 0 Unknown, 4004 Unchecked, 0.7s Time] [2022-09-16 10:49:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95075 states. [2022-09-16 10:49:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95075 to 62529. [2022-09-16 10:49:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62529 states, 62447 states have (on average 2.8640607234935227) internal successors, (178852), 62528 states have internal predecessors, (178852), 0 states have call successors, (0), 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 10:49:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62529 states to 62529 states and 178852 transitions. [2022-09-16 10:49:38,447 INFO L78 Accepts]: Start accepts. Automaton has 62529 states and 178852 transitions. Word has length 138 [2022-09-16 10:49:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:38,447 INFO L495 AbstractCegarLoop]: Abstraction has 62529 states and 178852 transitions. [2022-09-16 10:49:38,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 6.644444444444445) internal successors, (299), 46 states have internal predecessors, (299), 0 states have call successors, (0), 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 10:49:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 62529 states and 178852 transitions. [2022-09-16 10:49:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-09-16 10:49:38,460 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:38,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:38,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-09-16 10:49:38,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-09-16 10:49:38,661 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 997583928, now seen corresponding path program 1 times [2022-09-16 10:49:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:38,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984813685] [2022-09-16 10:49:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:49:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984813685] [2022-09-16 10:49:38,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984813685] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:49:38,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:49:38,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:49:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195669955] [2022-09-16 10:49:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:49:38,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:49:38,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:49:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:49:38,695 INFO L87 Difference]: Start difference. First operand 62529 states and 178852 transitions. Second operand has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 10:49:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:39,070 INFO L93 Difference]: Finished difference Result 75678 states and 214217 transitions. [2022-09-16 10:49:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:49:39,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-09-16 10:49:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:49:39,604 INFO L225 Difference]: With dead ends: 75678 [2022-09-16 10:49:39,604 INFO L226 Difference]: Without dead ends: 75678 [2022-09-16 10:49:39,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:49:39,605 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 200 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:49:39,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 955 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:49:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75678 states. [2022-09-16 10:49:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75678 to 62529. [2022-09-16 10:49:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62529 states, 62447 states have (on average 2.8545326436818423) internal successors, (178257), 62528 states have internal predecessors, (178257), 0 states have call successors, (0), 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 10:49:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62529 states to 62529 states and 178257 transitions. [2022-09-16 10:49:41,295 INFO L78 Accepts]: Start accepts. Automaton has 62529 states and 178257 transitions. Word has length 138 [2022-09-16 10:49:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:41,295 INFO L495 AbstractCegarLoop]: Abstraction has 62529 states and 178257 transitions. [2022-09-16 10:49:41,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 10:49:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 62529 states and 178257 transitions. [2022-09-16 10:49:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-09-16 10:49:41,329 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:41,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:41,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-09-16 10:49:41,329 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -47534030, now seen corresponding path program 2 times [2022-09-16 10:49:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:41,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962146923] [2022-09-16 10:49:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 10:49:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962146923] [2022-09-16 10:49:41,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962146923] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:49:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646345475] [2022-09-16 10:49:41,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:49:41,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:49:41,786 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:49:41,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-09-16 10:49:41,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:49:41,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:49:41,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 10:49:41,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:49:41,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:49:42,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:49:42,374 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:49:42,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:49:42,459 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 14 treesize of output 16 [2022-09-16 10:49:42,544 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 14 treesize of output 16 [2022-09-16 10:49:42,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:42,666 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 14 treesize of output 16 [2022-09-16 10:49:42,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:42,713 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 14 treesize of output 16 [2022-09-16 10:49:42,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:49:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 10:49:42,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:49:42,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:42,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:42,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:43,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_702) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:43,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:43,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-09-16 10:49:43,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:43,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 122 [2022-09-16 10:49:43,378 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 108 treesize of output 100 [2022-09-16 10:49:43,382 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 100 treesize of output 96 [2022-09-16 10:49:43,388 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 48 treesize of output 46 [2022-09-16 10:49:43,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:43,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-16 10:49:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-09-16 10:49:43,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646345475] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:49:43,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:49:43,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 54 [2022-09-16 10:49:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462606613] [2022-09-16 10:49:43,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:49:43,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-16 10:49:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-16 10:49:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2349, Unknown=11, NotChecked=404, Total=2970 [2022-09-16 10:49:43,981 INFO L87 Difference]: Start difference. First operand 62529 states and 178257 transitions. Second operand has 55 states, 54 states have (on average 6.2592592592592595) internal successors, (338), 55 states have internal predecessors, (338), 0 states have call successors, (0), 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 10:49:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:46,424 INFO L93 Difference]: Finished difference Result 115014 states and 323701 transitions. [2022-09-16 10:49:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:49:46,425 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 6.2592592592592595) internal successors, (338), 55 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-09-16 10:49:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:49:46,786 INFO L225 Difference]: With dead ends: 115014 [2022-09-16 10:49:46,786 INFO L226 Difference]: Without dead ends: 115014 [2022-09-16 10:49:46,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 244 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=661, Invalid=4894, Unknown=11, NotChecked=596, Total=6162 [2022-09-16 10:49:46,787 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 2827 mSDsluCounter, 9723 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 10141 SdHoareTripleChecker+Invalid, 5294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4290 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 10:49:46,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2827 Valid, 10141 Invalid, 5294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 979 Invalid, 0 Unknown, 4290 Unchecked, 0.4s Time] [2022-09-16 10:49:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115014 states. [2022-09-16 10:49:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115014 to 63745. [2022-09-16 10:49:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63745 states, 63663 states have (on average 2.8563686913906037) internal successors, (181845), 63744 states have internal predecessors, (181845), 0 states have call successors, (0), 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 10:49:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63745 states to 63745 states and 181845 transitions. [2022-09-16 10:49:48,633 INFO L78 Accepts]: Start accepts. Automaton has 63745 states and 181845 transitions. Word has length 138 [2022-09-16 10:49:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:49:48,633 INFO L495 AbstractCegarLoop]: Abstraction has 63745 states and 181845 transitions. [2022-09-16 10:49:48,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 6.2592592592592595) internal successors, (338), 55 states have internal predecessors, (338), 0 states have call successors, (0), 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 10:49:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 63745 states and 181845 transitions. [2022-09-16 10:49:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-09-16 10:49:48,646 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:49:48,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:49:48,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-09-16 10:49:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:48,853 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:49:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:49:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash -145413406, now seen corresponding path program 3 times [2022-09-16 10:49:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:49:48,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650282845] [2022-09-16 10:49:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:49:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:49:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:49:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:49:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:49:49,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650282845] [2022-09-16 10:49:49,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650282845] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:49:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594574964] [2022-09-16 10:49:49,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 10:49:49,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:49:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:49:49,753 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:49:49,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-09-16 10:49:49,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-09-16 10:49:49,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:49:49,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-09-16 10:49:49,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:49:49,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:49:50,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 10:49:50,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:50,297 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 23 treesize of output 22 [2022-09-16 10:49:50,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:49:50,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:49:50,713 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 14 treesize of output 16 [2022-09-16 10:49:50,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:50,828 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 14 treesize of output 16 [2022-09-16 10:49:50,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:49:50,883 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 14 treesize of output 16 [2022-09-16 10:49:50,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:49:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:49:50,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:49:51,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_748) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:51,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_748) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:51,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_748) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:51,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_748) c_~a1~0.base) c_~a1~0.offset) 9223372039002259456)) is different from false [2022-09-16 10:49:51,864 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 10:49:51,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2022-09-16 10:49:51,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:51,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 240 [2022-09-16 10:49:51,876 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 113 treesize of output 109 [2022-09-16 10:49:51,885 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 222 treesize of output 206 [2022-09-16 10:49:51,891 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 206 treesize of output 198 [2022-09-16 10:49:52,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:49:52,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-16 10:49:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:49:52,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594574964] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:49:52,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:49:52,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 66 [2022-09-16 10:49:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533738485] [2022-09-16 10:49:52,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:49:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-09-16 10:49:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:49:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-09-16 10:49:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3618, Unknown=29, NotChecked=500, Total=4422 [2022-09-16 10:49:52,358 INFO L87 Difference]: Start difference. First operand 63745 states and 181845 transitions. Second operand has 67 states, 66 states have (on average 5.393939393939394) internal successors, (356), 67 states have internal predecessors, (356), 0 states have call successors, (0), 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 10:49:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:49:59,359 INFO L93 Difference]: Finished difference Result 192177 states and 541121 transitions. [2022-09-16 10:49:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-09-16 10:49:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 5.393939393939394) internal successors, (356), 67 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-09-16 10:49:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:00,058 INFO L225 Difference]: With dead ends: 192177 [2022-09-16 10:50:00,058 INFO L226 Difference]: Without dead ends: 192177 [2022-09-16 10:50:00,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 238 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4713 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1888, Invalid=15128, Unknown=30, NotChecked=1044, Total=18090 [2022-09-16 10:50:00,060 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 6379 mSDsluCounter, 26148 mSDsCounter, 0 mSdLazyCounter, 4122 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6379 SdHoareTripleChecker+Valid, 26673 SdHoareTripleChecker+Invalid, 10220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5986 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:00,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6379 Valid, 26673 Invalid, 10220 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 4122 Invalid, 0 Unknown, 5986 Unchecked, 1.8s Time] [2022-09-16 10:50:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192177 states. [2022-09-16 10:50:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192177 to 64591. [2022-09-16 10:50:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64591 states, 64509 states have (on average 2.8596939961865786) internal successors, (184476), 64590 states have internal predecessors, (184476), 0 states have call successors, (0), 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 10:50:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64591 states to 64591 states and 184476 transitions. [2022-09-16 10:50:02,920 INFO L78 Accepts]: Start accepts. Automaton has 64591 states and 184476 transitions. Word has length 138 [2022-09-16 10:50:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:02,920 INFO L495 AbstractCegarLoop]: Abstraction has 64591 states and 184476 transitions. [2022-09-16 10:50:02,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 5.393939393939394) internal successors, (356), 67 states have internal predecessors, (356), 0 states have call successors, (0), 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 10:50:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 64591 states and 184476 transitions. [2022-09-16 10:50:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-09-16 10:50:02,934 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:02,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:02,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-09-16 10:50:03,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:03,147 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 860331619, now seen corresponding path program 1 times [2022-09-16 10:50:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:03,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834099195] [2022-09-16 10:50:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:50:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834099195] [2022-09-16 10:50:03,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834099195] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:50:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017498751] [2022-09-16 10:50:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:50:03,542 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:50:03,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-09-16 10:50:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:03,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 47 conjunts are in the unsatisfiable core [2022-09-16 10:50:03,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:50:03,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:50:04,027 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 10:50:04,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 10:50:04,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:50:04,513 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 10:50:04,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:50:04,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:50:04,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:50:04,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:50:04,755 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 16 treesize of output 18 [2022-09-16 10:50:04,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:50:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:50:04,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:50:04,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:50:04,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:50:05,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:50:05,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_787) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:50:05,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:05,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-09-16 10:50:05,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:05,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 272 [2022-09-16 10:50:05,361 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 258 treesize of output 242 [2022-09-16 10:50:05,365 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 242 treesize of output 238 [2022-09-16 10:50:05,369 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 238 treesize of output 230 [2022-09-16 10:50:06,066 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-09-16 10:50:06,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-09-16 10:50:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:50:06,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017498751] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:50:06,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:50:06,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2022-09-16 10:50:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456409291] [2022-09-16 10:50:06,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:50:06,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-09-16 10:50:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-09-16 10:50:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2058, Unknown=11, NotChecked=380, Total=2652 [2022-09-16 10:50:06,108 INFO L87 Difference]: Start difference. First operand 64591 states and 184476 transitions. Second operand has 52 states, 51 states have (on average 6.254901960784314) internal successors, (319), 52 states have internal predecessors, (319), 0 states have call successors, (0), 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 10:50:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:08,362 INFO L93 Difference]: Finished difference Result 101138 states and 286346 transitions. [2022-09-16 10:50:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 10:50:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 6.254901960784314) internal successors, (319), 52 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-09-16 10:50:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:08,664 INFO L225 Difference]: With dead ends: 101138 [2022-09-16 10:50:08,665 INFO L226 Difference]: Without dead ends: 101138 [2022-09-16 10:50:08,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 247 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=628, Invalid=4488, Unknown=12, NotChecked=572, Total=5700 [2022-09-16 10:50:08,666 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 1749 mSDsluCounter, 13949 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 14273 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2654 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:08,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 14273 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1369 Invalid, 0 Unknown, 2654 Unchecked, 0.6s Time] [2022-09-16 10:50:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101138 states. [2022-09-16 10:50:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101138 to 74573. [2022-09-16 10:50:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74573 states, 74491 states have (on average 2.863339195339034) internal successors, (213293), 74572 states have internal predecessors, (213293), 0 states have call successors, (0), 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 10:50:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74573 states to 74573 states and 213293 transitions. [2022-09-16 10:50:10,498 INFO L78 Accepts]: Start accepts. Automaton has 74573 states and 213293 transitions. Word has length 139 [2022-09-16 10:50:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:10,498 INFO L495 AbstractCegarLoop]: Abstraction has 74573 states and 213293 transitions. [2022-09-16 10:50:10,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 6.254901960784314) internal successors, (319), 52 states have internal predecessors, (319), 0 states have call successors, (0), 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 10:50:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 74573 states and 213293 transitions. [2022-09-16 10:50:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-09-16 10:50:10,514 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:10,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:10,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-09-16 10:50:10,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:10,727 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1677679378, now seen corresponding path program 1 times [2022-09-16 10:50:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:10,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572217946] [2022-09-16 10:50:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:50:11,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:11,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572217946] [2022-09-16 10:50:11,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572217946] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:50:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378804952] [2022-09-16 10:50:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:11,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:11,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:50:11,421 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:50:11,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-09-16 10:50:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:11,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 10:50:11,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:50:11,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:50:11,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:50:11,900 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:50:11,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:50:11,975 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 14 treesize of output 16 [2022-09-16 10:50:12,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:50:12,054 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 14 treesize of output 16 [2022-09-16 10:50:12,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:50:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:50:12,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:50:12,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_820) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:50:12,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_820) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:50:12,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_820) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:50:12,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:12,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-09-16 10:50:12,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:12,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2022-09-16 10:50:12,584 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 48 treesize of output 44 [2022-09-16 10:50:12,590 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 22 treesize of output 20 [2022-09-16 10:50:12,798 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 10 treesize of output 8 [2022-09-16 10:50:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:50:12,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378804952] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:50:12,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:50:12,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 49 [2022-09-16 10:50:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708640826] [2022-09-16 10:50:12,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:50:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 10:50:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 10:50:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1974, Unknown=10, NotChecked=276, Total=2450 [2022-09-16 10:50:12,845 INFO L87 Difference]: Start difference. First operand 74573 states and 213293 transitions. Second operand has 50 states, 49 states have (on average 6.204081632653061) internal successors, (304), 50 states have internal predecessors, (304), 0 states have call successors, (0), 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 10:50:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:16,068 INFO L93 Difference]: Finished difference Result 119612 states and 337164 transitions. [2022-09-16 10:50:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-16 10:50:16,068 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 6.204081632653061) internal successors, (304), 50 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-09-16 10:50:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:16,445 INFO L225 Difference]: With dead ends: 119612 [2022-09-16 10:50:16,446 INFO L226 Difference]: Without dead ends: 119612 [2022-09-16 10:50:16,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 246 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=958, Invalid=7970, Unknown=14, NotChecked=564, Total=9506 [2022-09-16 10:50:16,446 INFO L413 NwaCegarLoop]: 1057 mSDtfsCounter, 2486 mSDsluCounter, 25501 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2486 SdHoareTripleChecker+Valid, 26173 SdHoareTripleChecker+Invalid, 6189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3659 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:16,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2486 Valid, 26173 Invalid, 6189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2472 Invalid, 0 Unknown, 3659 Unchecked, 0.9s Time] [2022-09-16 10:50:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119612 states. [2022-09-16 10:50:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119612 to 86507. [2022-09-16 10:50:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86507 states, 86425 states have (on average 2.869297078391669) internal successors, (247979), 86506 states have internal predecessors, (247979), 0 states have call successors, (0), 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 10:50:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86507 states to 86507 states and 247979 transitions. [2022-09-16 10:50:18,935 INFO L78 Accepts]: Start accepts. Automaton has 86507 states and 247979 transitions. Word has length 139 [2022-09-16 10:50:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:18,935 INFO L495 AbstractCegarLoop]: Abstraction has 86507 states and 247979 transitions. [2022-09-16 10:50:18,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 6.204081632653061) internal successors, (304), 50 states have internal predecessors, (304), 0 states have call successors, (0), 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 10:50:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 86507 states and 247979 transitions. [2022-09-16 10:50:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-09-16 10:50:18,956 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:18,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:18,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-09-16 10:50:19,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:19,157 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash 468454021, now seen corresponding path program 1 times [2022-09-16 10:50:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:19,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269533793] [2022-09-16 10:50:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:50:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269533793] [2022-09-16 10:50:19,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269533793] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:50:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230803377] [2022-09-16 10:50:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:19,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:50:19,548 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:50:19,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-09-16 10:50:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:19,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 10:50:19,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:50:19,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:50:19,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:50:20,043 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:50:20,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:50:20,121 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 16 treesize of output 18 [2022-09-16 10:50:20,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:50:20,198 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 16 treesize of output 18 [2022-09-16 10:50:20,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:50:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:50:20,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:50:20,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_853) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:50:20,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_853) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:50:20,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_852) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_853) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:50:21,104 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:21,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 10:50:21,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:21,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-09-16 10:50:21,113 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 122 treesize of output 118 [2022-09-16 10:50:21,116 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 118 treesize of output 110 [2022-09-16 10:50:21,322 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 10 treesize of output 8 [2022-09-16 10:50:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:50:21,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230803377] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:50:21,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:50:21,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 49 [2022-09-16 10:50:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440753823] [2022-09-16 10:50:21,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:50:21,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 10:50:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 10:50:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1974, Unknown=10, NotChecked=276, Total=2450 [2022-09-16 10:50:21,372 INFO L87 Difference]: Start difference. First operand 86507 states and 247979 transitions. Second operand has 50 states, 49 states have (on average 6.428571428571429) internal successors, (315), 50 states have internal predecessors, (315), 0 states have call successors, (0), 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 10:50:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:23,853 INFO L93 Difference]: Finished difference Result 121731 states and 343781 transitions. [2022-09-16 10:50:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 10:50:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 6.428571428571429) internal successors, (315), 50 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-09-16 10:50:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:24,268 INFO L225 Difference]: With dead ends: 121731 [2022-09-16 10:50:24,268 INFO L226 Difference]: Without dead ends: 120975 [2022-09-16 10:50:24,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 248 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=881, Invalid=6603, Unknown=10, NotChecked=516, Total=8010 [2022-09-16 10:50:24,269 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 2692 mSDsluCounter, 14087 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 14537 SdHoareTripleChecker+Invalid, 4600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3273 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:24,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 14537 Invalid, 4600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1272 Invalid, 0 Unknown, 3273 Unchecked, 0.5s Time] [2022-09-16 10:50:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120975 states. [2022-09-16 10:50:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120975 to 99736. [2022-09-16 10:50:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99736 states, 99654 states have (on average 2.880265719389086) internal successors, (287030), 99735 states have internal predecessors, (287030), 0 states have call successors, (0), 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 10:50:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99736 states to 99736 states and 287030 transitions. [2022-09-16 10:50:27,506 INFO L78 Accepts]: Start accepts. Automaton has 99736 states and 287030 transitions. Word has length 140 [2022-09-16 10:50:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:27,507 INFO L495 AbstractCegarLoop]: Abstraction has 99736 states and 287030 transitions. [2022-09-16 10:50:27,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 6.428571428571429) internal successors, (315), 50 states have internal predecessors, (315), 0 states have call successors, (0), 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 10:50:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 99736 states and 287030 transitions. [2022-09-16 10:50:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-09-16 10:50:27,530 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:27,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:27,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-09-16 10:50:27,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-09-16 10:50:27,732 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1274644442, now seen corresponding path program 1 times [2022-09-16 10:50:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:27,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362107756] [2022-09-16 10:50:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:50:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362107756] [2022-09-16 10:50:27,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362107756] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:50:27,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:50:27,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:50:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337716730] [2022-09-16 10:50:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:50:27,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:50:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:50:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:50:27,768 INFO L87 Difference]: Start difference. First operand 99736 states and 287030 transitions. Second operand has 4 states, 3 states have (on average 47.0) internal successors, (141), 4 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 10:50:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:28,847 INFO L93 Difference]: Finished difference Result 118214 states and 338435 transitions. [2022-09-16 10:50:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:50:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 47.0) internal successors, (141), 4 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) Word has length 141 [2022-09-16 10:50:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:29,267 INFO L225 Difference]: With dead ends: 118214 [2022-09-16 10:50:29,267 INFO L226 Difference]: Without dead ends: 118091 [2022-09-16 10:50:29,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:50:29,267 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 193 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:29,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 971 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:50:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118091 states. [2022-09-16 10:50:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118091 to 98706. [2022-09-16 10:50:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98706 states, 98627 states have (on average 2.8798807628742638) internal successors, (284034), 98705 states have internal predecessors, (284034), 0 states have call successors, (0), 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 10:50:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98706 states to 98706 states and 284034 transitions. [2022-09-16 10:50:32,045 INFO L78 Accepts]: Start accepts. Automaton has 98706 states and 284034 transitions. Word has length 141 [2022-09-16 10:50:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:32,045 INFO L495 AbstractCegarLoop]: Abstraction has 98706 states and 284034 transitions. [2022-09-16 10:50:32,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 47.0) internal successors, (141), 4 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 10:50:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 98706 states and 284034 transitions. [2022-09-16 10:50:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-09-16 10:50:32,071 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:32,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:32,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-09-16 10:50:32,072 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1014277079, now seen corresponding path program 1 times [2022-09-16 10:50:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:32,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435559066] [2022-09-16 10:50:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:50:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:32,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435559066] [2022-09-16 10:50:32,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435559066] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:50:32,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:50:32,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 10:50:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198575580] [2022-09-16 10:50:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:50:32,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:50:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:50:32,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-09-16 10:50:32,123 INFO L87 Difference]: Start difference. First operand 98706 states and 284034 transitions. Second operand has 6 states, 5 states have (on average 28.4) internal successors, (142), 6 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 10:50:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:33,165 INFO L93 Difference]: Finished difference Result 109082 states and 312267 transitions. [2022-09-16 10:50:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:50:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.4) internal successors, (142), 6 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) Word has length 142 [2022-09-16 10:50:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:33,535 INFO L225 Difference]: With dead ends: 109082 [2022-09-16 10:50:33,536 INFO L226 Difference]: Without dead ends: 107322 [2022-09-16 10:50:33,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:50:33,536 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 414 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:33,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1785 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:50:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107322 states. [2022-09-16 10:50:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107322 to 100381. [2022-09-16 10:50:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100381 states, 100302 states have (on average 2.878397240334191) internal successors, (288709), 100380 states have internal predecessors, (288709), 0 states have call successors, (0), 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 10:50:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100381 states to 100381 states and 288709 transitions. [2022-09-16 10:50:36,272 INFO L78 Accepts]: Start accepts. Automaton has 100381 states and 288709 transitions. Word has length 142 [2022-09-16 10:50:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:36,272 INFO L495 AbstractCegarLoop]: Abstraction has 100381 states and 288709 transitions. [2022-09-16 10:50:36,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.4) internal successors, (142), 6 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 10:50:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 100381 states and 288709 transitions. [2022-09-16 10:50:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-09-16 10:50:36,298 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:36,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:36,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-09-16 10:50:36,298 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:36,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:36,299 INFO L85 PathProgramCache]: Analyzing trace with hash 459263878, now seen corresponding path program 2 times [2022-09-16 10:50:36,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:36,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833572189] [2022-09-16 10:50:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:50:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:36,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833572189] [2022-09-16 10:50:36,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833572189] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:50:36,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854497284] [2022-09-16 10:50:36,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:50:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:50:36,592 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:50:36,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-09-16 10:50:36,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:50:36,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:50:36,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-16 10:50:36,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:50:36,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 10:50:36,931 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 10:50:36,932 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 10:50:37,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:50:37,429 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 16 treesize of output 18 [2022-09-16 10:50:37,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:50:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:50:37,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:50:37,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) c_~a2~0.base) c_~a2~0.offset) 4294967296))) is different from false [2022-09-16 10:50:37,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 4294967296))) is different from false [2022-09-16 10:50:37,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296))) is different from false [2022-09-16 10:50:37,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-09-16 10:50:37,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 Int)) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_919)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-09-16 10:50:37,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| Int)) (or (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 Int)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_919)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116|)))) is different from false [2022-09-16 10:50:37,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_919)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)))) is different from false [2022-09-16 10:50:37,702 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 10:50:37,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-09-16 10:50:37,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:50:37,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2022-09-16 10:50:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-09-16 10:50:37,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854497284] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:50:37,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:50:37,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2022-09-16 10:50:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793716470] [2022-09-16 10:50:37,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:50:37,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:50:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:37,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:50:37,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1579, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 10:50:37,870 INFO L87 Difference]: Start difference. First operand 100381 states and 288709 transitions. Second operand has 49 states, 48 states have (on average 6.479166666666667) internal successors, (311), 49 states have internal predecessors, (311), 0 states have call successors, (0), 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 10:50:38,737 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1| 2147483648)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_919)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)) is different from false [2022-09-16 10:50:39,036 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_919)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)) is different from false [2022-09-16 10:50:41,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| Int)) (or (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_919 Int)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_919)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_920) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_116|)))))) is different from false [2022-09-16 10:50:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:43,580 INFO L93 Difference]: Finished difference Result 173811 states and 497190 transitions. [2022-09-16 10:50:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-09-16 10:50:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.479166666666667) internal successors, (311), 49 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-09-16 10:50:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:44,516 INFO L225 Difference]: With dead ends: 173811 [2022-09-16 10:50:44,516 INFO L226 Difference]: Without dead ends: 173635 [2022-09-16 10:50:44,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 253 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=717, Invalid=4715, Unknown=10, NotChecked=1530, Total=6972 [2022-09-16 10:50:44,517 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 2739 mSDsluCounter, 11593 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2739 SdHoareTripleChecker+Valid, 11909 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5601 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:44,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2739 Valid, 11909 Invalid, 7791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2131 Invalid, 0 Unknown, 5601 Unchecked, 0.8s Time] [2022-09-16 10:50:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173635 states. [2022-09-16 10:50:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173635 to 109751. [2022-09-16 10:50:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109751 states, 109672 states have (on average 2.886242614340944) internal successors, (316540), 109750 states have internal predecessors, (316540), 0 states have call successors, (0), 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 10:50:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109751 states to 109751 states and 316540 transitions. [2022-09-16 10:50:48,157 INFO L78 Accepts]: Start accepts. Automaton has 109751 states and 316540 transitions. Word has length 142 [2022-09-16 10:50:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:48,157 INFO L495 AbstractCegarLoop]: Abstraction has 109751 states and 316540 transitions. [2022-09-16 10:50:48,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.479166666666667) internal successors, (311), 49 states have internal predecessors, (311), 0 states have call successors, (0), 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 10:50:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 109751 states and 316540 transitions. [2022-09-16 10:50:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-09-16 10:50:48,184 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:48,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:48,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-09-16 10:50:48,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-09-16 10:50:48,385 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash -650787305, now seen corresponding path program 1 times [2022-09-16 10:50:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:48,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354545344] [2022-09-16 10:50:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:48,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:50:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:48,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354545344] [2022-09-16 10:50:48,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354545344] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:50:48,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:50:48,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 10:50:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886015232] [2022-09-16 10:50:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:50:48,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:50:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:50:48,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-09-16 10:50:48,436 INFO L87 Difference]: Start difference. First operand 109751 states and 316540 transitions. Second operand has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 10:50:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:49,878 INFO L93 Difference]: Finished difference Result 121266 states and 348194 transitions. [2022-09-16 10:50:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:50:49,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-09-16 10:50:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:50,319 INFO L225 Difference]: With dead ends: 121266 [2022-09-16 10:50:50,319 INFO L226 Difference]: Without dead ends: 118626 [2022-09-16 10:50:50,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:50:50,320 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 439 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:50,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1796 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:50:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118626 states. [2022-09-16 10:50:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118626 to 109897. [2022-09-16 10:50:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109897 states, 109818 states have (on average 2.8942158844633847) internal successors, (317837), 109896 states have internal predecessors, (317837), 0 states have call successors, (0), 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 10:50:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109897 states to 109897 states and 317837 transitions. [2022-09-16 10:50:53,261 INFO L78 Accepts]: Start accepts. Automaton has 109897 states and 317837 transitions. Word has length 143 [2022-09-16 10:50:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:50:53,261 INFO L495 AbstractCegarLoop]: Abstraction has 109897 states and 317837 transitions. [2022-09-16 10:50:53,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 10:50:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 109897 states and 317837 transitions. [2022-09-16 10:50:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-09-16 10:50:53,289 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:50:53,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:50:53,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-09-16 10:50:53,290 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:50:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:50:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1479225975, now seen corresponding path program 2 times [2022-09-16 10:50:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:50:53,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157417327] [2022-09-16 10:50:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:50:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:50:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:50:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-09-16 10:50:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:50:53,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157417327] [2022-09-16 10:50:53,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157417327] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:50:53,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606923116] [2022-09-16 10:50:53,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:50:53,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:50:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:50:53,332 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:50:53,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-09-16 10:50:53,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 10:50:53,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:50:53,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:50:53,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:50:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-09-16 10:50:53,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:50:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-09-16 10:50:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606923116] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:50:54,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:50:54,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-09-16 10:50:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732903317] [2022-09-16 10:50:54,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:50:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 10:50:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:50:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 10:50:54,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-16 10:50:54,101 INFO L87 Difference]: Start difference. First operand 109897 states and 317837 transitions. Second operand has 10 states, 9 states have (on average 25.555555555555557) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 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 10:50:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:50:55,515 INFO L93 Difference]: Finished difference Result 182298 states and 524473 transitions. [2022-09-16 10:50:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 10:50:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 25.555555555555557) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-09-16 10:50:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:50:56,848 INFO L225 Difference]: With dead ends: 182298 [2022-09-16 10:50:56,848 INFO L226 Difference]: Without dead ends: 182298 [2022-09-16 10:50:56,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 278 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-09-16 10:50:56,849 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 1519 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:50:56,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 2573 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:50:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182298 states. [2022-09-16 10:50:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182298 to 109445. [2022-09-16 10:50:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109445 states, 109376 states have (on average 2.8943003949678174) internal successors, (316567), 109444 states have internal predecessors, (316567), 0 states have call successors, (0), 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 10:51:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109445 states to 109445 states and 316567 transitions. [2022-09-16 10:51:00,667 INFO L78 Accepts]: Start accepts. Automaton has 109445 states and 316567 transitions. Word has length 143 [2022-09-16 10:51:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:00,668 INFO L495 AbstractCegarLoop]: Abstraction has 109445 states and 316567 transitions. [2022-09-16 10:51:00,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 25.555555555555557) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 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 10:51:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 109445 states and 316567 transitions. [2022-09-16 10:51:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-09-16 10:51:00,697 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:00,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:00,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:00,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-09-16 10:51:00,898 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1350994749, now seen corresponding path program 1 times [2022-09-16 10:51:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:00,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747156781] [2022-09-16 10:51:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:51:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747156781] [2022-09-16 10:51:01,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747156781] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209033642] [2022-09-16 10:51:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:01,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:01,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:01,386 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:01,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-09-16 10:51:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:01,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 50 conjunts are in the unsatisfiable core [2022-09-16 10:51:01,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:01,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:51:01,537 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 10:51:01,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 10:51:01,624 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:51:01,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 10:51:01,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:51:02,197 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-09-16 10:51:02,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-09-16 10:51:02,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 10:51:02,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 10:51:02,768 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 18 treesize of output 20 [2022-09-16 10:51:02,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:51:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:51:02,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:51:02,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1010) c_~a1~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a1~0.offset)) 2147483648)) is different from false [2022-09-16 10:51:02,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1010) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:03,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1010) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:03,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1010) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:03,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1008) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1010) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:03,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:03,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-09-16 10:51:03,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:03,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 122 [2022-09-16 10:51:03,304 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 108 treesize of output 100 [2022-09-16 10:51:03,308 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 50 treesize of output 48 [2022-09-16 10:51:03,311 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 98 treesize of output 94 [2022-09-16 10:51:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:51:03,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209033642] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:51:03,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:51:03,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 54 [2022-09-16 10:51:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522126278] [2022-09-16 10:51:03,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:51:03,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-16 10:51:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-16 10:51:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2234, Unknown=12, NotChecked=500, Total=2970 [2022-09-16 10:51:03,800 INFO L87 Difference]: Start difference. First operand 109445 states and 316567 transitions. Second operand has 55 states, 54 states have (on average 6.0) internal successors, (324), 55 states have internal predecessors, (324), 0 states have call successors, (0), 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 10:51:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:51:07,221 INFO L93 Difference]: Finished difference Result 151607 states and 431910 transitions. [2022-09-16 10:51:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-09-16 10:51:07,222 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 6.0) internal successors, (324), 55 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-09-16 10:51:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:51:07,700 INFO L225 Difference]: With dead ends: 151607 [2022-09-16 10:51:07,701 INFO L226 Difference]: Without dead ends: 149847 [2022-09-16 10:51:07,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 260 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2927 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1082, Invalid=9013, Unknown=25, NotChecked=1010, Total=11130 [2022-09-16 10:51:07,701 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 3249 mSDsluCounter, 18218 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 18568 SdHoareTripleChecker+Invalid, 9379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7683 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:51:07,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3249 Valid, 18568 Invalid, 9379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1636 Invalid, 0 Unknown, 7683 Unchecked, 0.7s Time] [2022-09-16 10:51:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149847 states. [2022-09-16 10:51:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149847 to 117781. [2022-09-16 10:51:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117781 states, 117712 states have (on average 2.8960938561913823) internal successors, (340905), 117780 states have internal predecessors, (340905), 0 states have call successors, (0), 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 10:51:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117781 states to 117781 states and 340905 transitions. [2022-09-16 10:51:11,243 INFO L78 Accepts]: Start accepts. Automaton has 117781 states and 340905 transitions. Word has length 144 [2022-09-16 10:51:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:11,243 INFO L495 AbstractCegarLoop]: Abstraction has 117781 states and 340905 transitions. [2022-09-16 10:51:11,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 6.0) internal successors, (324), 55 states have internal predecessors, (324), 0 states have call successors, (0), 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 10:51:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 117781 states and 340905 transitions. [2022-09-16 10:51:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-09-16 10:51:11,276 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:11,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:11,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:11,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:11,477 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1760303349, now seen corresponding path program 2 times [2022-09-16 10:51:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:11,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94633057] [2022-09-16 10:51:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:51:12,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:12,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94633057] [2022-09-16 10:51:12,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94633057] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:12,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046424067] [2022-09-16 10:51:12,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:51:12,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:12,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:12,424 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-09-16 10:51:12,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:51:12,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:51:12,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 45 conjunts are in the unsatisfiable core [2022-09-16 10:51:12,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:12,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:51:12,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:51:13,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:51:13,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:51:13,256 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 14 treesize of output 16 [2022-09-16 10:51:13,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:51:13,357 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 14 treesize of output 16 [2022-09-16 10:51:13,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:51:13,457 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 14 treesize of output 16 [2022-09-16 10:51:13,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:51:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:51:13,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:51:13,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1048) c_~a1~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a1~0.offset)) 2147483648)) is different from false [2022-09-16 10:51:13,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1048) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:13,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1048) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:13,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1048) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:13,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1046) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1048) c_~a1~0.base) c_~a1~0.offset) 2147483648)) is different from false [2022-09-16 10:51:14,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:14,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-09-16 10:51:14,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:14,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 240 [2022-09-16 10:51:14,031 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 226 treesize of output 210 [2022-09-16 10:51:14,038 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 109 treesize of output 101 [2022-09-16 10:51:14,042 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 202 treesize of output 198 [2022-09-16 10:51:14,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:14,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-16 10:51:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:51:14,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046424067] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:51:14,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:51:14,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 55 [2022-09-16 10:51:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032107015] [2022-09-16 10:51:14,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:51:14,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-16 10:51:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-16 10:51:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2349, Unknown=12, NotChecked=510, Total=3080 [2022-09-16 10:51:14,651 INFO L87 Difference]: Start difference. First operand 117781 states and 340905 transitions. Second operand has 56 states, 55 states have (on average 6.3090909090909095) internal successors, (347), 56 states have internal predecessors, (347), 0 states have call successors, (0), 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 10:51:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:51:17,243 INFO L93 Difference]: Finished difference Result 144593 states and 412788 transitions. [2022-09-16 10:51:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 10:51:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 6.3090909090909095) internal successors, (347), 56 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-09-16 10:51:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:51:17,699 INFO L225 Difference]: With dead ends: 144593 [2022-09-16 10:51:17,699 INFO L226 Difference]: Without dead ends: 142833 [2022-09-16 10:51:17,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 252 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=738, Invalid=5745, Unknown=17, NotChecked=810, Total=7310 [2022-09-16 10:51:17,700 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 2238 mSDsluCounter, 15096 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 15545 SdHoareTripleChecker+Invalid, 5983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4401 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:51:17,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2238 Valid, 15545 Invalid, 5983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1537 Invalid, 0 Unknown, 4401 Unchecked, 0.6s Time] [2022-09-16 10:51:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142833 states. [2022-09-16 10:51:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142833 to 111156. [2022-09-16 10:51:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111156 states, 111087 states have (on average 2.8866203966260677) internal successors, (320666), 111155 states have internal predecessors, (320666), 0 states have call successors, (0), 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 10:51:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111156 states to 111156 states and 320666 transitions. [2022-09-16 10:51:21,188 INFO L78 Accepts]: Start accepts. Automaton has 111156 states and 320666 transitions. Word has length 144 [2022-09-16 10:51:21,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:21,188 INFO L495 AbstractCegarLoop]: Abstraction has 111156 states and 320666 transitions. [2022-09-16 10:51:21,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 6.3090909090909095) internal successors, (347), 56 states have internal predecessors, (347), 0 states have call successors, (0), 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 10:51:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111156 states and 320666 transitions. [2022-09-16 10:51:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-09-16 10:51:21,221 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:21,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:21,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:21,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:21,422 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1388634221, now seen corresponding path program 1 times [2022-09-16 10:51:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:21,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883340409] [2022-09-16 10:51:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-09-16 10:51:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:21,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883340409] [2022-09-16 10:51:21,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883340409] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596428043] [2022-09-16 10:51:21,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:21,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:21,473 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:21,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-09-16 10:51:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:21,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:51:21,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-09-16 10:51:21,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:51:21,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596428043] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:51:21,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:51:21,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:51:21,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402413425] [2022-09-16 10:51:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:51:21,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:51:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:21,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:51:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:51:21,655 INFO L87 Difference]: Start difference. First operand 111156 states and 320666 transitions. Second operand has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 10:51:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:51:22,844 INFO L93 Difference]: Finished difference Result 140993 states and 405476 transitions. [2022-09-16 10:51:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:51:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-09-16 10:51:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:51:23,369 INFO L225 Difference]: With dead ends: 140993 [2022-09-16 10:51:23,369 INFO L226 Difference]: Without dead ends: 140993 [2022-09-16 10:51:23,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:51:23,370 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 535 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:51:23,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2225 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 10:51:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140993 states. [2022-09-16 10:51:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140993 to 108444. [2022-09-16 10:51:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108444 states, 108385 states have (on average 2.8882778982331505) internal successors, (313046), 108443 states have internal predecessors, (313046), 0 states have call successors, (0), 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 10:51:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108444 states to 108444 states and 313046 transitions. [2022-09-16 10:51:26,697 INFO L78 Accepts]: Start accepts. Automaton has 108444 states and 313046 transitions. Word has length 144 [2022-09-16 10:51:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:26,698 INFO L495 AbstractCegarLoop]: Abstraction has 108444 states and 313046 transitions. [2022-09-16 10:51:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 10:51:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 108444 states and 313046 transitions. [2022-09-16 10:51:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-09-16 10:51:26,729 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:26,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:26,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:26,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-09-16 10:51:26,931 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1068834886, now seen corresponding path program 1 times [2022-09-16 10:51:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:26,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147018357] [2022-09-16 10:51:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:51:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:27,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147018357] [2022-09-16 10:51:27,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147018357] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:27,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797319341] [2022-09-16 10:51:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:27,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:27,350 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:27,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-09-16 10:51:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:27,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-09-16 10:51:27,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:27,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:51:27,498 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 10:51:27,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 10:51:27,606 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:51:27,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 10:51:27,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:51:28,497 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-09-16 10:51:28,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-09-16 10:51:28,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:51:28,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:51:28,765 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 20 treesize of output 22 [2022-09-16 10:51:28,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:51:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:51:28,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:51:28,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1124) c_~a1~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a1~0.offset))))) is different from false [2022-09-16 10:51:29,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1124) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:51:29,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1124) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:51:29,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1124) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:51:29,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1123 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1124) c_~a1~0.base) c_~a1~0.offset)))) is different from false [2022-09-16 10:51:29,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:29,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-09-16 10:51:29,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:29,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 272 [2022-09-16 10:51:29,374 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 130 treesize of output 126 [2022-09-16 10:51:29,379 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 254 treesize of output 246 [2022-09-16 10:51:29,385 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 246 treesize of output 230 [2022-09-16 10:51:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 10:51:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797319341] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:51:29,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:51:29,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 54 [2022-09-16 10:51:29,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494441225] [2022-09-16 10:51:29,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:51:29,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-16 10:51:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-16 10:51:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2234, Unknown=12, NotChecked=500, Total=2970 [2022-09-16 10:51:29,988 INFO L87 Difference]: Start difference. First operand 108444 states and 313046 transitions. Second operand has 55 states, 54 states have (on average 6.203703703703703) internal successors, (335), 55 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:51:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:51:32,502 INFO L93 Difference]: Finished difference Result 123257 states and 350882 transitions. [2022-09-16 10:51:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 10:51:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 6.203703703703703) internal successors, (335), 55 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-09-16 10:51:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:51:32,882 INFO L225 Difference]: With dead ends: 123257 [2022-09-16 10:51:32,882 INFO L226 Difference]: Without dead ends: 119649 [2022-09-16 10:51:32,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 259 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=797, Invalid=6016, Unknown=13, NotChecked=830, Total=7656 [2022-09-16 10:51:32,883 INFO L413 NwaCegarLoop]: 684 mSDtfsCounter, 2230 mSDsluCounter, 15329 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2230 SdHoareTripleChecker+Valid, 15751 SdHoareTripleChecker+Invalid, 6574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5039 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 10:51:32,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2230 Valid, 15751 Invalid, 6574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1490 Invalid, 0 Unknown, 5039 Unchecked, 0.6s Time] [2022-09-16 10:51:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119649 states. [2022-09-16 10:51:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119649 to 100289. [2022-09-16 10:51:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100289 states, 100230 states have (on average 2.8842362566097974) internal successors, (289087), 100288 states have internal predecessors, (289087), 0 states have call successors, (0), 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 10:51:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100289 states to 100289 states and 289087 transitions. [2022-09-16 10:51:35,779 INFO L78 Accepts]: Start accepts. Automaton has 100289 states and 289087 transitions. Word has length 145 [2022-09-16 10:51:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:35,780 INFO L495 AbstractCegarLoop]: Abstraction has 100289 states and 289087 transitions. [2022-09-16 10:51:35,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 6.203703703703703) internal successors, (335), 55 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:51:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 100289 states and 289087 transitions. [2022-09-16 10:51:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-09-16 10:51:35,809 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:35,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:35,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:36,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-09-16 10:51:36,020 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2134481736, now seen corresponding path program 1 times [2022-09-16 10:51:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:36,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800844389] [2022-09-16 10:51:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:51:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800844389] [2022-09-16 10:51:36,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800844389] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843709130] [2022-09-16 10:51:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:36,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:36,816 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:36,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-09-16 10:51:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:36,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 10:51:36,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:37,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:51:37,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:51:37,413 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 14 treesize of output 16 [2022-09-16 10:51:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:51:37,457 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 14 treesize of output 16 [2022-09-16 10:51:37,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:51:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:51:37,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:51:37,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) c_~a2~0.base) c_~a2~0.offset) 2147483648)) is different from false [2022-09-16 10:51:37,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) c_~a2~0.base) c_~a2~0.offset) 2147483648)) is different from false [2022-09-16 10:51:37,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 2147483648)) is different from false [2022-09-16 10:51:37,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 2147483648)) is different from false [2022-09-16 10:51:37,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) is different from false [2022-09-16 10:51:37,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:37,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-09-16 10:51:37,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:37,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2022-09-16 10:51:37,763 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 106 treesize of output 102 [2022-09-16 10:51:37,766 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 102 treesize of output 94 [2022-09-16 10:51:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-09-16 10:51:38,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843709130] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:51:38,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:51:38,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 45 [2022-09-16 10:51:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539776350] [2022-09-16 10:51:38,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:51:38,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-09-16 10:51:38,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:38,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-09-16 10:51:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1494, Unknown=5, NotChecked=410, Total=2070 [2022-09-16 10:51:38,108 INFO L87 Difference]: Start difference. First operand 100289 states and 289087 transitions. Second operand has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 0 states have call successors, (0), 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 10:51:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:51:40,646 INFO L93 Difference]: Finished difference Result 142739 states and 407126 transitions. [2022-09-16 10:51:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:51:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-09-16 10:51:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:51:41,450 INFO L225 Difference]: With dead ends: 142739 [2022-09-16 10:51:41,450 INFO L226 Difference]: Without dead ends: 142739 [2022-09-16 10:51:41,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 259 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=511, Invalid=3286, Unknown=5, NotChecked=620, Total=4422 [2022-09-16 10:51:41,451 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 2372 mSDsluCounter, 14360 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 14824 SdHoareTripleChecker+Invalid, 6502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4330 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:51:41,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 14824 Invalid, 6502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2132 Invalid, 0 Unknown, 4330 Unchecked, 0.8s Time] [2022-09-16 10:51:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142739 states. [2022-09-16 10:51:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142739 to 118557. [2022-09-16 10:51:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118557 states, 118498 states have (on average 2.887719623959898) internal successors, (342189), 118556 states have internal predecessors, (342189), 0 states have call successors, (0), 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 10:51:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118557 states to 118557 states and 342189 transitions. [2022-09-16 10:51:45,541 INFO L78 Accepts]: Start accepts. Automaton has 118557 states and 342189 transitions. Word has length 145 [2022-09-16 10:51:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:45,541 INFO L495 AbstractCegarLoop]: Abstraction has 118557 states and 342189 transitions. [2022-09-16 10:51:45,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 6.355555555555555) internal successors, (286), 46 states have internal predecessors, (286), 0 states have call successors, (0), 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 10:51:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 118557 states and 342189 transitions. [2022-09-16 10:51:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-09-16 10:51:45,588 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:45,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:45,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:45,816 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1744425311, now seen corresponding path program 1 times [2022-09-16 10:51:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:45,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204944935] [2022-09-16 10:51:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:51:46,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:46,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204944935] [2022-09-16 10:51:46,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204944935] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:46,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346803612] [2022-09-16 10:51:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:46,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:46,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:46,268 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:46,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-09-16 10:51:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 10:51:46,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:46,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:51:46,557 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 10:51:46,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-09-16 10:51:46,647 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 10:51:46,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 10:51:46,760 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-09-16 10:51:46,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:51:46,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:51:47,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:51:47,078 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 16 treesize of output 18 [2022-09-16 10:51:47,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:51:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:51:47,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:51:47,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1199) c_~a2~0.base) c_~a2~0.offset) 2147483648))) is different from false [2022-09-16 10:51:47,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1199) c_~a2~0.base) c_~a2~0.offset) 2147483648))) is different from false [2022-09-16 10:51:47,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 2147483648))) is different from false [2022-09-16 10:51:47,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1199) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 2147483648))) is different from false [2022-09-16 10:51:47,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1199) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648))) is different from false [2022-09-16 10:51:47,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:47,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 10:51:47,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:47,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-09-16 10:51:47,474 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 61 treesize of output 57 [2022-09-16 10:51:47,477 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 118 treesize of output 110 [2022-09-16 10:51:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-09-16 10:51:47,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346803612] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:51:47,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:51:47,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 44 [2022-09-16 10:51:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794847860] [2022-09-16 10:51:47,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:51:47,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-09-16 10:51:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-09-16 10:51:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1432, Unknown=5, NotChecked=400, Total=1980 [2022-09-16 10:51:47,805 INFO L87 Difference]: Start difference. First operand 118557 states and 342189 transitions. Second operand has 45 states, 44 states have (on average 8.25) internal successors, (363), 45 states have internal predecessors, (363), 0 states have call successors, (0), 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 10:51:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:51:50,637 INFO L93 Difference]: Finished difference Result 141651 states and 403242 transitions. [2022-09-16 10:51:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 10:51:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 8.25) internal successors, (363), 45 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-09-16 10:51:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:51:51,108 INFO L225 Difference]: With dead ends: 141651 [2022-09-16 10:51:51,109 INFO L226 Difference]: Without dead ends: 138960 [2022-09-16 10:51:51,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 265 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=541, Invalid=3380, Unknown=5, NotChecked=630, Total=4556 [2022-09-16 10:51:51,109 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 2361 mSDsluCounter, 12434 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 5065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3156 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:51:51,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 12920 Invalid, 5065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1870 Invalid, 0 Unknown, 3156 Unchecked, 0.8s Time] [2022-09-16 10:51:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138960 states. [2022-09-16 10:51:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138960 to 125106. [2022-09-16 10:51:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125106 states, 125047 states have (on average 2.8868745351747744) internal successors, (360995), 125105 states have internal predecessors, (360995), 0 states have call successors, (0), 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 10:51:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125106 states to 125106 states and 360995 transitions. [2022-09-16 10:51:55,077 INFO L78 Accepts]: Start accepts. Automaton has 125106 states and 360995 transitions. Word has length 146 [2022-09-16 10:51:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:51:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 125106 states and 360995 transitions. [2022-09-16 10:51:55,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 8.25) internal successors, (363), 45 states have internal predecessors, (363), 0 states have call successors, (0), 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 10:51:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 125106 states and 360995 transitions. [2022-09-16 10:51:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-09-16 10:51:55,111 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:51:55,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:51:55,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-09-16 10:51:55,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:55,312 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:51:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:51:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1203350561, now seen corresponding path program 2 times [2022-09-16 10:51:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:51:55,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440585425] [2022-09-16 10:51:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:51:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:51:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:51:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:51:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:51:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440585425] [2022-09-16 10:51:55,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440585425] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:51:55,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598039301] [2022-09-16 10:51:55,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:51:55,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:51:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:51:55,691 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:51:55,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-09-16 10:51:55,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:51:55,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:51:55,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 10:51:55,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:51:56,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 10:51:56,595 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 10:51:56,595 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 10:51:56,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:51:56,744 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 16 treesize of output 18 [2022-09-16 10:51:56,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:51:56,822 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 16 treesize of output 18 [2022-09-16 10:51:56,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:51:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-16 10:51:56,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:51:56,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) c_~a2~0.base) (+ (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) c_~a2~0.offset)) 4294967296))) is different from false [2022-09-16 10:51:57,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) c_~a2~0.base) c_~a2~0.offset) 4294967296))) is different from false [2022-09-16 10:51:57,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) c_~a2~0.base) c_~a2~0.offset) 4294967296))) is different from false [2022-09-16 10:51:57,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|)))) is different from false [2022-09-16 10:51:57,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967296))) is different from false [2022-09-16 10:51:57,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-09-16 10:51:57,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int)) (v_ArrVal_1238 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1238)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-09-16 10:51:57,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int)) (or (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int)) (v_ArrVal_1238 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1238)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161|)))) is different from false [2022-09-16 10:51:57,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int)) (v_ArrVal_1238 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1238)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)))) is different from false [2022-09-16 10:51:57,116 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 10:51:57,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-09-16 10:51:57,122 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:51:57,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2022-09-16 10:51:57,125 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 56 treesize of output 52 [2022-09-16 10:51:57,128 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 26 treesize of output 24 [2022-09-16 10:51:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2022-09-16 10:51:57,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598039301] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:51:57,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:51:57,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2022-09-16 10:51:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726313677] [2022-09-16 10:51:57,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:51:57,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 10:51:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:51:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 10:51:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1833, Unknown=9, NotChecked=846, Total=2862 [2022-09-16 10:51:57,449 INFO L87 Difference]: Start difference. First operand 125106 states and 360995 transitions. Second operand has 54 states, 53 states have (on average 6.150943396226415) internal successors, (326), 54 states have internal predecessors, (326), 0 states have call successors, (0), 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 10:51:58,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1| 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int)) (v_ArrVal_1238 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1238)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0))) is different from false [2022-09-16 10:51:58,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int) (v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int)) (v_ArrVal_1238 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1238)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0))) is different from false [2022-09-16 10:52:00,888 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 0) 2147483648)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| Int)) (or (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (Array Int Int)) (v_ArrVal_1238 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1238)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_161|)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 10:52:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:52:03,911 INFO L93 Difference]: Finished difference Result 166573 states and 475129 transitions. [2022-09-16 10:52:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 10:52:03,912 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 6.150943396226415) internal successors, (326), 54 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-09-16 10:52:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:52:04,452 INFO L225 Difference]: With dead ends: 166573 [2022-09-16 10:52:04,452 INFO L226 Difference]: Without dead ends: 166397 [2022-09-16 10:52:04,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 259 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=644, Invalid=4222, Unknown=12, NotChecked=1764, Total=6642 [2022-09-16 10:52:04,453 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 3836 mSDsluCounter, 9479 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3836 SdHoareTripleChecker+Valid, 9859 SdHoareTripleChecker+Invalid, 7995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5874 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:52:04,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3836 Valid, 9859 Invalid, 7995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2037 Invalid, 0 Unknown, 5874 Unchecked, 0.9s Time] [2022-09-16 10:52:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166397 states. [2022-09-16 10:52:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166397 to 113702. [2022-09-16 10:52:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113702 states, 113643 states have (on average 2.8838995802645124) internal successors, (327735), 113701 states have internal predecessors, (327735), 0 states have call successors, (0), 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 10:52:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113702 states to 113702 states and 327735 transitions. [2022-09-16 10:52:08,125 INFO L78 Accepts]: Start accepts. Automaton has 113702 states and 327735 transitions. Word has length 147 [2022-09-16 10:52:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:52:08,125 INFO L495 AbstractCegarLoop]: Abstraction has 113702 states and 327735 transitions. [2022-09-16 10:52:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 6.150943396226415) internal successors, (326), 54 states have internal predecessors, (326), 0 states have call successors, (0), 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 10:52:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 113702 states and 327735 transitions. [2022-09-16 10:52:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-09-16 10:52:08,159 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:52:08,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:52:08,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-09-16 10:52:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:52:08,360 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:52:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:52:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1128455811, now seen corresponding path program 1 times [2022-09-16 10:52:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:52:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014806708] [2022-09-16 10:52:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:52:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:52:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:52:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 10:52:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:52:08,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014806708] [2022-09-16 10:52:08,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014806708] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:52:08,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:52:08,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 10:52:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452225749] [2022-09-16 10:52:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:52:08,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:52:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:52:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:52:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-09-16 10:52:08,409 INFO L87 Difference]: Start difference. First operand 113702 states and 327735 transitions. Second operand has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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 10:52:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:52:09,498 INFO L93 Difference]: Finished difference Result 120906 states and 347293 transitions. [2022-09-16 10:52:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:52:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-09-16 10:52:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:52:09,909 INFO L225 Difference]: With dead ends: 120906 [2022-09-16 10:52:09,909 INFO L226 Difference]: Without dead ends: 114926 [2022-09-16 10:52:09,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:52:09,910 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 346 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:52:09,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 2137 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:52:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114926 states. [2022-09-16 10:52:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114926 to 107302. [2022-09-16 10:52:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107302 states, 107243 states have (on average 2.8837126898725325) internal successors, (309258), 107301 states have internal predecessors, (309258), 0 states have call successors, (0), 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 10:52:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107302 states to 107302 states and 309258 transitions. [2022-09-16 10:52:13,218 INFO L78 Accepts]: Start accepts. Automaton has 107302 states and 309258 transitions. Word has length 148 [2022-09-16 10:52:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:52:13,218 INFO L495 AbstractCegarLoop]: Abstraction has 107302 states and 309258 transitions. [2022-09-16 10:52:13,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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 10:52:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 107302 states and 309258 transitions. [2022-09-16 10:52:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-09-16 10:52:13,250 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:52:13,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:52:13,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-09-16 10:52:13,250 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:52:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:52:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2074424452, now seen corresponding path program 2 times [2022-09-16 10:52:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:52:13,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503239673] [2022-09-16 10:52:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:52:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:52:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:52:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 10:52:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:52:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503239673] [2022-09-16 10:52:13,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503239673] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:52:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721630851] [2022-09-16 10:52:13,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:52:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:52:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:52:13,674 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:52:13,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-09-16 10:52:13,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:52:13,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:52:13,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-16 10:52:13,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:52:13,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:52:14,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:52:14,371 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:52:14,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:52:14,459 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 16 treesize of output 18 [2022-09-16 10:52:14,525 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 16 treesize of output 18 [2022-09-16 10:52:14,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:52:14,630 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 16 treesize of output 18 [2022-09-16 10:52:14,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:52:14,677 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 16 treesize of output 18 [2022-09-16 10:52:14,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 10:52:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 10:52:14,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:52:14,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:52:14,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:52:14,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:52:14,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1300) c_~a1~0.base) c_~a1~0.offset) 4294967296))) is different from false [2022-09-16 10:52:15,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:15,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-09-16 10:52:15,436 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:15,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 554 treesize of output 540 [2022-09-16 10:52:15,443 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 263 treesize of output 247 [2022-09-16 10:52:15,448 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 510 treesize of output 502 [2022-09-16 10:52:15,452 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 502 treesize of output 470 [2022-09-16 10:52:16,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:16,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-16 10:52:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-09-16 10:52:16,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721630851] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:52:16,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:52:16,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 52 [2022-09-16 10:52:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059018927] [2022-09-16 10:52:16,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:52:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-09-16 10:52:16,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:52:16,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-09-16 10:52:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2144, Unknown=11, NotChecked=388, Total=2756 [2022-09-16 10:52:16,478 INFO L87 Difference]: Start difference. First operand 107302 states and 309258 transitions. Second operand has 53 states, 52 states have (on average 6.634615384615385) internal successors, (345), 53 states have internal predecessors, (345), 0 states have call successors, (0), 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 10:52:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:52:18,975 INFO L93 Difference]: Finished difference Result 145788 states and 416135 transitions. [2022-09-16 10:52:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 10:52:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 6.634615384615385) internal successors, (345), 53 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-09-16 10:52:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:52:19,448 INFO L225 Difference]: With dead ends: 145788 [2022-09-16 10:52:19,448 INFO L226 Difference]: Without dead ends: 145788 [2022-09-16 10:52:19,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 263 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=674, Invalid=4733, Unknown=11, NotChecked=588, Total=6006 [2022-09-16 10:52:19,449 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 2780 mSDsluCounter, 12855 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2780 SdHoareTripleChecker+Valid, 13221 SdHoareTripleChecker+Invalid, 4497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2934 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:52:19,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2780 Valid, 13221 Invalid, 4497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1539 Invalid, 0 Unknown, 2934 Unchecked, 0.7s Time] [2022-09-16 10:52:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145788 states. [2022-09-16 10:52:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145788 to 114339. [2022-09-16 10:52:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114339 states, 114280 states have (on average 2.885999299964998) internal successors, (329812), 114338 states have internal predecessors, (329812), 0 states have call successors, (0), 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 10:52:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114339 states to 114339 states and 329812 transitions. [2022-09-16 10:52:23,065 INFO L78 Accepts]: Start accepts. Automaton has 114339 states and 329812 transitions. Word has length 148 [2022-09-16 10:52:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:52:23,065 INFO L495 AbstractCegarLoop]: Abstraction has 114339 states and 329812 transitions. [2022-09-16 10:52:23,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 6.634615384615385) internal successors, (345), 53 states have internal predecessors, (345), 0 states have call successors, (0), 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 10:52:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 114339 states and 329812 transitions. [2022-09-16 10:52:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-09-16 10:52:23,096 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:52:23,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:52:23,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-09-16 10:52:23,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-09-16 10:52:23,297 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:52:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:52:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1257076693, now seen corresponding path program 2 times [2022-09-16 10:52:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:52:23,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334738081] [2022-09-16 10:52:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:52:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:52:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:52:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 10:52:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:52:23,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334738081] [2022-09-16 10:52:23,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334738081] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:52:23,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214998913] [2022-09-16 10:52:23,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:52:23,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:52:23,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:52:23,689 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:52:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-09-16 10:52:23,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:52:23,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:52:23,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 10:52:23,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:52:23,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:52:23,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 10:52:24,120 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:52:24,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:52:24,555 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 14 treesize of output 16 [2022-09-16 10:52:24,587 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 14 treesize of output 16 [2022-09-16 10:52:24,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:52:24,645 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 14 treesize of output 16 [2022-09-16 10:52:24,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 10:52:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-16 10:52:24,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:52:24,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1338) c_~a1~0.base) c_~a1~0.offset) 2147483647)) is different from false [2022-09-16 10:52:24,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1338) c_~a1~0.base) c_~a1~0.offset) 2147483647)) is different from false [2022-09-16 10:52:24,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1338) c_~a1~0.base) c_~a1~0.offset) 2147483647)) is different from false [2022-09-16 10:52:25,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:25,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-09-16 10:52:25,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:25,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2022-09-16 10:52:25,230 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 48 treesize of output 44 [2022-09-16 10:52:25,233 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 22 treesize of output 20 [2022-09-16 10:52:25,433 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 10 treesize of output 8 [2022-09-16 10:52:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-09-16 10:52:25,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214998913] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:52:25,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:52:25,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 50 [2022-09-16 10:52:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329279744] [2022-09-16 10:52:25,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:52:25,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-09-16 10:52:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:52:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-09-16 10:52:25,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2085, Unknown=10, NotChecked=282, Total=2550 [2022-09-16 10:52:25,482 INFO L87 Difference]: Start difference. First operand 114339 states and 329812 transitions. Second operand has 51 states, 50 states have (on average 6.7) internal successors, (335), 51 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:52:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:52:28,702 INFO L93 Difference]: Finished difference Result 145577 states and 412985 transitions. [2022-09-16 10:52:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 10:52:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 6.7) internal successors, (335), 51 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-09-16 10:52:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:52:29,134 INFO L225 Difference]: With dead ends: 145577 [2022-09-16 10:52:29,134 INFO L226 Difference]: Without dead ends: 143025 [2022-09-16 10:52:29,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 263 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=939, Invalid=6719, Unknown=10, NotChecked=522, Total=8190 [2022-09-16 10:52:29,135 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 3133 mSDsluCounter, 12982 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 13436 SdHoareTripleChecker+Invalid, 4202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2824 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:52:29,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 13436 Invalid, 4202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1311 Invalid, 0 Unknown, 2824 Unchecked, 0.5s Time] [2022-09-16 10:52:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143025 states. [2022-09-16 10:52:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143025 to 115338. [2022-09-16 10:52:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115338 states, 115279 states have (on average 2.8827453395674842) internal successors, (332320), 115337 states have internal predecessors, (332320), 0 states have call successors, (0), 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 10:52:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115338 states to 115338 states and 332320 transitions. [2022-09-16 10:52:32,674 INFO L78 Accepts]: Start accepts. Automaton has 115338 states and 332320 transitions. Word has length 148 [2022-09-16 10:52:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:52:32,674 INFO L495 AbstractCegarLoop]: Abstraction has 115338 states and 332320 transitions. [2022-09-16 10:52:32,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 6.7) internal successors, (335), 51 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:52:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 115338 states and 332320 transitions. [2022-09-16 10:52:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-09-16 10:52:32,714 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:52:32,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:52:32,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-09-16 10:52:32,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-09-16 10:52:32,936 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-09-16 10:52:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:52:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1401968084, now seen corresponding path program 3 times [2022-09-16 10:52:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:52:32,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756590539] [2022-09-16 10:52:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:52:32,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:52:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:52:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:52:33,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:52:33,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756590539] [2022-09-16 10:52:33,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756590539] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:52:33,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084261302] [2022-09-16 10:52:33,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 10:52:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:52:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:52:33,443 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:52:33,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-09-16 10:52:33,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-09-16 10:52:33,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:52:33,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 67 conjunts are in the unsatisfiable core [2022-09-16 10:52:33,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:52:33,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 10:52:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:52:34,076 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 25 treesize of output 24 [2022-09-16 10:52:34,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 10:52:34,456 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-16 10:52:34,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:52:34,746 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 20 treesize of output 22 [2022-09-16 10:52:34,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:52:34,828 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 20 treesize of output 22 [2022-09-16 10:52:35,116 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:52:35,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-09-16 10:52:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:52:35,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:52:36,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse1 (select (select .cse0 c_~a1~0.base) c_~a1~0.offset))) (or (= (select (select .cse0 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset|) .cse1) (<= 0 (+ 4294967295 .cse1)))))) is different from false [2022-09-16 10:52:36,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 c_~a1~0.base) c_~a1~0.offset))) (or (<= 0 (+ 4294967295 .cse0)) (= (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0) .cse0))))) is different from false [2022-09-16 10:52:36,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret15#1.base|) |c_ULTIMATE.start_main_#t~ret15#1.offset|))) (or (<= 0 (+ 4294967295 .cse0)) (= (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0) .cse0))))) is different from false [2022-09-16 10:52:36,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 0 (+ 4294967295 .cse0)) (= (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0) .cse0))))) is different from false [2022-09-16 10:52:36,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse0 (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0)) (<= 0 (+ .cse0 4294967295)))))) is different from false [2022-09-16 10:52:36,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1377)) |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 0 (+ .cse0 4294967295)) (= .cse0 (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0)))))) is different from false [2022-09-16 10:52:36,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_185| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post24#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_185|)) (forall ((|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_185| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1377)) |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 0 (+ .cse0 4294967295)) (= .cse0 (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0)))))))) is different from false [2022-09-16 10:52:36,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_185| Int) (|ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_185| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1377)) |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 0 (+ .cse0 4294967295)) (= .cse0 (select (select .cse1 |ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base|) 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_185| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)))))) is different from false [2022-09-16 10:52:36,508 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 10:52:36,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 72 [2022-09-16 10:52:36,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:36,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5511 treesize of output 5353 [2022-09-16 10:52:36,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:36,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5339 treesize of output 5139 [2022-09-16 10:52:36,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:36,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5131 treesize of output 4563 [2022-09-16 10:52:36,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:52:36,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4555 treesize of output 4275