/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/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 11:03:23,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 11:03:23,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 11:03:23,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 11:03:23,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 11:03:23,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 11:03:23,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 11:03:23,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 11:03:23,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 11:03:23,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 11:03:23,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 11:03:23,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 11:03:23,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 11:03:23,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 11:03:23,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 11:03:23,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 11:03:23,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 11:03:23,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 11:03:23,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 11:03:23,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 11:03:23,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 11:03:23,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 11:03:23,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 11:03:23,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 11:03:23,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 11:03:23,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 11:03:23,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 11:03:23,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 11:03:23,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 11:03:23,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 11:03:23,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 11:03:23,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 11:03:23,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 11:03:23,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 11:03:23,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 11:03:23,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 11:03:23,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 11:03:23,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 11:03:23,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 11:03:23,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 11:03:23,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 11:03:23,206 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 11:03:23,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 11:03:23,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 11:03:23,232 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 11:03:23,232 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 11:03:23,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 11:03:23,233 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 11:03:23,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 11:03:23,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 11:03:23,234 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 11:03:23,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 11:03:23,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 11:03:23,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 11:03:23,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 11:03:23,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 11:03:23,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 11:03:23,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 11:03:23,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 11:03:23,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 11:03:23,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:03:23,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 11:03:23,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 11:03:23,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 11:03:23,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 11:03:23,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 11:03:23,237 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 11:03:23,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 11:03:23,238 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 11:03:23,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 11:03:23,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 11:03:23,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 11:03:23,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 11:03:23,454 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 11:03:23,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-09-16 11:03:23,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4c1a29/2272cce163cd4a8e8f1b8ff8d2089f99/FLAG0907c4966 [2022-09-16 11:03:23,957 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 11:03:23,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-09-16 11:03:23,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4c1a29/2272cce163cd4a8e8f1b8ff8d2089f99/FLAG0907c4966 [2022-09-16 11:03:24,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4c1a29/2272cce163cd4a8e8f1b8ff8d2089f99 [2022-09-16 11:03:24,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 11:03:24,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 11:03:24,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 11:03:24,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 11:03:24,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 11:03:24,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbcee5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24, skipping insertion in model container [2022-09-16 11:03:24,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 11:03:24,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 11:03:24,591 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/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-09-16 11:03:24,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:03:24,610 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 11:03:24,646 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/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-09-16 11:03:24,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:03:24,661 INFO L208 MainTranslator]: Completed translation [2022-09-16 11:03:24,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24 WrapperNode [2022-09-16 11:03:24,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 11:03:24,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 11:03:24,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 11:03:24,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 11:03:24,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,716 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 241 [2022-09-16 11:03:24,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 11:03:24,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 11:03:24,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 11:03:24,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 11:03:24,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 11:03:24,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 11:03:24,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 11:03:24,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 11:03:24,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (1/1) ... [2022-09-16 11:03:24,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:03:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:24,778 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 11:03:24,812 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 11:03:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 11:03:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 11:03:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 11:03:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 11:03:24,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 11:03:24,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 11:03:24,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 11:03:24,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 11:03:24,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 11:03:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 11:03:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 11:03:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 11:03:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 11:03:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 11:03:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 11:03:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 11:03:24,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 11:03:24,838 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 11:03:24,919 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 11:03:24,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 11:03:25,272 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 11:03:25,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 11:03:25,634 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-16 11:03:25,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:03:25 BoogieIcfgContainer [2022-09-16 11:03:25,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 11:03:25,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 11:03:25,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 11:03:25,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 11:03:25,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 11:03:24" (1/3) ... [2022-09-16 11:03:25,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f87c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:03:25, skipping insertion in model container [2022-09-16 11:03:25,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:03:24" (2/3) ... [2022-09-16 11:03:25,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f87c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:03:25, skipping insertion in model container [2022-09-16 11:03:25,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:03:25" (3/3) ... [2022-09-16 11:03:25,646 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-09-16 11:03:25,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 11:03:25,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 11:03:25,658 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-09-16 11:03:25,658 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 11:03:25,766 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-16 11:03:25,803 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184 places, 186 transitions, 396 flow [2022-09-16 11:03:26,808 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 30788 states, 30058 states have (on average 3.895967795595183) internal successors, (117105), 30787 states have internal predecessors, (117105), 0 states have call successors, (0), 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 11:03:26,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 11:03:26,925 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;@47c84e22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 11:03:26,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-09-16 11:03:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 30788 states, 30058 states have (on average 3.895967795595183) internal successors, (117105), 30787 states have internal predecessors, (117105), 0 states have call successors, (0), 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 11:03:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-09-16 11:03:27,023 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:27,023 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 11:03:27,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:27,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1847314700, now seen corresponding path program 1 times [2022-09-16 11:03:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183264515] [2022-09-16 11:03:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:27,238 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 11:03:27,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:27,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183264515] [2022-09-16 11:03:27,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183264515] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:27,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:27,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:03:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881361524] [2022-09-16 11:03:27,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:27,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:03:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:03:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:03:27,348 INFO L87 Difference]: Start difference. First operand has 30788 states, 30058 states have (on average 3.895967795595183) internal successors, (117105), 30787 states have internal predecessors, (117105), 0 states have call successors, (0), 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 11:03:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:28,467 INFO L93 Difference]: Finished difference Result 44625 states and 162703 transitions. [2022-09-16 11:03:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:03:28,469 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 11:03:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:29,081 INFO L225 Difference]: With dead ends: 44625 [2022-09-16 11:03:29,081 INFO L226 Difference]: Without dead ends: 44621 [2022-09-16 11:03:29,083 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 11:03:29,086 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 94 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:29,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 362 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44621 states. [2022-09-16 11:03:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44621 to 22342. [2022-09-16 11:03:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22342 states, 21998 states have (on average 3.6995181380125466) internal successors, (81382), 22341 states have internal predecessors, (81382), 0 states have call successors, (0), 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 11:03:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22342 states to 22342 states and 81382 transitions. [2022-09-16 11:03:30,604 INFO L78 Accepts]: Start accepts. Automaton has 22342 states and 81382 transitions. Word has length 53 [2022-09-16 11:03:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:30,606 INFO L495 AbstractCegarLoop]: Abstraction has 22342 states and 81382 transitions. [2022-09-16 11:03:30,607 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 11:03:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 22342 states and 81382 transitions. [2022-09-16 11:03:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-09-16 11:03:30,612 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:30,612 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 11:03:30,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 11:03:30,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash 159969561, now seen corresponding path program 1 times [2022-09-16 11:03:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:30,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607932047] [2022-09-16 11:03:30,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:30,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:30,750 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 11:03:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:30,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607932047] [2022-09-16 11:03:30,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607932047] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:30,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711251766] [2022-09-16 11:03:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:30,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:30,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:30,754 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 11:03:30,756 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 11:03:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:30,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:03:30,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:30,988 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 11:03:30,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:31,038 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 11:03:31,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711251766] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:31,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:31,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 11:03:31,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805864920] [2022-09-16 11:03:31,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:31,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:03:31,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:31,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:03:31,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:03:31,042 INFO L87 Difference]: Start difference. First operand 22342 states and 81382 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 11:03:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:32,789 INFO L93 Difference]: Finished difference Result 111481 states and 406676 transitions. [2022-09-16 11:03:32,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:32,790 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 11:03:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:33,856 INFO L225 Difference]: With dead ends: 111481 [2022-09-16 11:03:33,856 INFO L226 Difference]: Without dead ends: 111481 [2022-09-16 11:03:33,857 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 11:03:33,858 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 570 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:33,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 676 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111481 states. [2022-09-16 11:03:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111481 to 22368. [2022-09-16 11:03:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22368 states, 22024 states have (on average 3.696558300036324) internal successors, (81413), 22367 states have internal predecessors, (81413), 0 states have call successors, (0), 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 11:03:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22368 states to 22368 states and 81413 transitions. [2022-09-16 11:03:36,205 INFO L78 Accepts]: Start accepts. Automaton has 22368 states and 81413 transitions. Word has length 62 [2022-09-16 11:03:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:36,206 INFO L495 AbstractCegarLoop]: Abstraction has 22368 states and 81413 transitions. [2022-09-16 11:03:36,206 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 11:03:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22368 states and 81413 transitions. [2022-09-16 11:03:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-09-16 11:03:36,208 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:36,208 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 11:03:36,254 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 11:03:36,433 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 11:03:36,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 664089873, now seen corresponding path program 1 times [2022-09-16 11:03:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:36,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123205650] [2022-09-16 11:03:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:36,554 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 11:03:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123205650] [2022-09-16 11:03:36,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123205650] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:36,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174948345] [2022-09-16 11:03:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:36,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:36,572 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 11:03:36,588 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 11:03:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:36,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:03:36,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:36,738 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 11:03:36,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:03:36,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174948345] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:36,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:03:36,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 11:03:36,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646697370] [2022-09-16 11:03:36,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:36,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:03:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:36,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:03:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 11:03:36,740 INFO L87 Difference]: Start difference. First operand 22368 states and 81413 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 11:03:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:37,376 INFO L93 Difference]: Finished difference Result 44644 states and 162725 transitions. [2022-09-16 11:03:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 11:03:37,376 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 11:03:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:37,704 INFO L225 Difference]: With dead ends: 44644 [2022-09-16 11:03:37,704 INFO L226 Difference]: Without dead ends: 44644 [2022-09-16 11:03:37,704 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 11:03:37,705 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 186 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:37,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 714 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:03:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44644 states. [2022-09-16 11:03:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44644 to 22367. [2022-09-16 11:03:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22367 states, 22024 states have (on average 3.6964220849981837) internal successors, (81410), 22366 states have internal predecessors, (81410), 0 states have call successors, (0), 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 11:03:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22367 states to 22367 states and 81410 transitions. [2022-09-16 11:03:38,850 INFO L78 Accepts]: Start accepts. Automaton has 22367 states and 81410 transitions. Word has length 63 [2022-09-16 11:03:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:38,850 INFO L495 AbstractCegarLoop]: Abstraction has 22367 states and 81410 transitions. [2022-09-16 11:03:38,850 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 11:03:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22367 states and 81410 transitions. [2022-09-16 11:03:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-09-16 11:03:38,852 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:38,852 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] [2022-09-16 11:03:38,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:39,065 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 11:03:39,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:39,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash -565198701, now seen corresponding path program 1 times [2022-09-16 11:03:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:39,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376995363] [2022-09-16 11:03:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:03:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:39,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376995363] [2022-09-16 11:03:39,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376995363] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:39,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:39,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 11:03:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567437260] [2022-09-16 11:03:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:39,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 11:03:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 11:03:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 11:03:39,205 INFO L87 Difference]: Start difference. First operand 22367 states and 81410 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 11:03:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:39,783 INFO L93 Difference]: Finished difference Result 29476 states and 105625 transitions. [2022-09-16 11:03:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-16 11:03:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-09-16 11:03:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:39,928 INFO L225 Difference]: With dead ends: 29476 [2022-09-16 11:03:39,928 INFO L226 Difference]: Without dead ends: 29404 [2022-09-16 11:03:39,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 11:03:39,929 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 581 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:39,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 482 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 11:03:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29404 states. [2022-09-16 11:03:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29404 to 24838. [2022-09-16 11:03:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24838 states, 24495 states have (on average 3.69303939579506) internal successors, (90461), 24837 states have internal predecessors, (90461), 0 states have call successors, (0), 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 11:03:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24838 states to 24838 states and 90461 transitions. [2022-09-16 11:03:40,855 INFO L78 Accepts]: Start accepts. Automaton has 24838 states and 90461 transitions. Word has length 66 [2022-09-16 11:03:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:40,856 INFO L495 AbstractCegarLoop]: Abstraction has 24838 states and 90461 transitions. [2022-09-16 11:03:40,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 11:03:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 24838 states and 90461 transitions. [2022-09-16 11:03:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-09-16 11:03:40,858 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:40,859 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] [2022-09-16 11:03:40,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 11:03:40,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1740727052, now seen corresponding path program 1 times [2022-09-16 11:03:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:40,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534323095] [2022-09-16 11:03:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:41,254 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 11:03:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534323095] [2022-09-16 11:03:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534323095] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:41,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:41,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 11:03:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026672367] [2022-09-16 11:03:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 11:03:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 11:03:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-16 11:03:41,256 INFO L87 Difference]: Start difference. First operand 24838 states and 90461 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 11:03:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:41,658 INFO L93 Difference]: Finished difference Result 24352 states and 87642 transitions. [2022-09-16 11:03:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 11:03:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-09-16 11:03:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:41,779 INFO L225 Difference]: With dead ends: 24352 [2022-09-16 11:03:41,780 INFO L226 Difference]: Without dead ends: 24214 [2022-09-16 11:03:41,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:03:41,781 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 639 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:41,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 645 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24214 states. [2022-09-16 11:03:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24214 to 23488. [2022-09-16 11:03:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23488 states, 23145 states have (on average 3.6781594296824367) internal successors, (85131), 23487 states have internal predecessors, (85131), 0 states have call successors, (0), 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 11:03:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23488 states to 23488 states and 85131 transitions. [2022-09-16 11:03:42,649 INFO L78 Accepts]: Start accepts. Automaton has 23488 states and 85131 transitions. Word has length 72 [2022-09-16 11:03:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:42,650 INFO L495 AbstractCegarLoop]: Abstraction has 23488 states and 85131 transitions. [2022-09-16 11:03:42,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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 11:03:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23488 states and 85131 transitions. [2022-09-16 11:03:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-09-16 11:03:42,653 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:42,653 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] [2022-09-16 11:03:42,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 11:03:42,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 466015654, now seen corresponding path program 1 times [2022-09-16 11:03:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846699448] [2022-09-16 11:03:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:42,929 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 11:03:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846699448] [2022-09-16 11:03:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846699448] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201819381] [2022-09-16 11:03:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:42,952 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 11:03:42,953 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 11:03:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:43,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-09-16 11:03:43,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:43,219 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 11:03:43,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:43,539 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 11:03:43,586 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 11:03:43,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:43,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:43,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:43,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) |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 11:03:43,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_107 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_107) |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 11:03:43,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:43,734 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 11:03:43,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:43,743 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 11:03:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:43,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201819381] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:43,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:43,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-09-16 11:03:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328473988] [2022-09-16 11:03:43,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:43,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-16 11:03:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-16 11:03:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=827, Unknown=4, NotChecked=244, Total=1190 [2022-09-16 11:03:43,921 INFO L87 Difference]: Start difference. First operand 23488 states and 85131 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 11:03:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:45,755 INFO L93 Difference]: Finished difference Result 35715 states and 125566 transitions. [2022-09-16 11:03:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 75 [2022-09-16 11:03:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:45,934 INFO L225 Difference]: With dead ends: 35715 [2022-09-16 11:03:45,934 INFO L226 Difference]: Without dead ends: 35715 [2022-09-16 11:03:45,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=1741, Unknown=4, NotChecked=364, Total=2450 [2022-09-16 11:03:45,936 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 1355 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 823 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:45,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 2376 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 823 Unchecked, 0.5s Time] [2022-09-16 11:03:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35715 states. [2022-09-16 11:03:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35715 to 23518. [2022-09-16 11:03:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23518 states, 23175 states have (on average 3.676202804746494) internal successors, (85196), 23517 states have internal predecessors, (85196), 0 states have call successors, (0), 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 11:03:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23518 states to 23518 states and 85196 transitions. [2022-09-16 11:03:46,825 INFO L78 Accepts]: Start accepts. Automaton has 23518 states and 85196 transitions. Word has length 75 [2022-09-16 11:03:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:46,826 INFO L495 AbstractCegarLoop]: Abstraction has 23518 states and 85196 transitions. [2022-09-16 11:03:46,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 11:03:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23518 states and 85196 transitions. [2022-09-16 11:03:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-09-16 11:03:46,827 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:46,827 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] [2022-09-16 11:03:46,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-16 11:03:47,045 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 11:03:47,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash 466015657, now seen corresponding path program 1 times [2022-09-16 11:03:47,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:47,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322011603] [2022-09-16 11:03:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:47,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:47,332 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 11:03:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322011603] [2022-09-16 11:03:47,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322011603] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5899754] [2022-09-16 11:03:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:47,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:47,337 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 11:03:47,338 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 11:03:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:47,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 25 conjunts are in the unsatisfiable core [2022-09-16 11:03:47,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:47,532 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 11:03:47,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:47,653 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 11:03:47,691 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 11:03:47,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:47,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:03:47,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:47,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:47,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:03:47,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:47,791 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 11:03:47,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:47,797 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 11:03:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:47,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5899754] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:47,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:47,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-09-16 11:03:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463932646] [2022-09-16 11:03:47,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:47,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-16 11:03:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:47,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-16 11:03:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=827, Unknown=4, NotChecked=244, Total=1190 [2022-09-16 11:03:47,924 INFO L87 Difference]: Start difference. First operand 23518 states and 85196 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 11:03:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:49,437 INFO L93 Difference]: Finished difference Result 35710 states and 125556 transitions. [2022-09-16 11:03:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:03:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 75 [2022-09-16 11:03:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:49,610 INFO L225 Difference]: With dead ends: 35710 [2022-09-16 11:03:49,610 INFO L226 Difference]: Without dead ends: 35710 [2022-09-16 11:03:49,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=1741, Unknown=4, NotChecked=364, Total=2450 [2022-09-16 11:03:49,612 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 1265 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1228 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:49,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 2449 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 939 Invalid, 0 Unknown, 1228 Unchecked, 0.5s Time] [2022-09-16 11:03:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35710 states. [2022-09-16 11:03:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35710 to 23518. [2022-09-16 11:03:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23518 states, 23175 states have (on average 3.675987055016181) internal successors, (85191), 23517 states have internal predecessors, (85191), 0 states have call successors, (0), 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 11:03:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23518 states to 23518 states and 85191 transitions. [2022-09-16 11:03:50,830 INFO L78 Accepts]: Start accepts. Automaton has 23518 states and 85191 transitions. Word has length 75 [2022-09-16 11:03:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:50,831 INFO L495 AbstractCegarLoop]: Abstraction has 23518 states and 85191 transitions. [2022-09-16 11:03:50,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 11:03:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 23518 states and 85191 transitions. [2022-09-16 11:03:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-09-16 11:03:50,832 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:50,832 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] [2022-09-16 11:03:50,856 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 11:03:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:51,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 466015658, now seen corresponding path program 1 times [2022-09-16 11:03:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:51,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786563818] [2022-09-16 11:03:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:51,136 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 11:03:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:51,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786563818] [2022-09-16 11:03:51,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786563818] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:51,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:51,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 11:03:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472945683] [2022-09-16 11:03:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:51,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:03:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:03:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:03:51,138 INFO L87 Difference]: Start difference. First operand 23518 states and 85191 transitions. Second operand has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 11:03:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:51,436 INFO L93 Difference]: Finished difference Result 33140 states and 119951 transitions. [2022-09-16 11:03:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:03:51,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-09-16 11:03:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:51,609 INFO L225 Difference]: With dead ends: 33140 [2022-09-16 11:03:51,610 INFO L226 Difference]: Without dead ends: 33140 [2022-09-16 11:03:51,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:03:51,610 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:51,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 186 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:03:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33140 states. [2022-09-16 11:03:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33140 to 26046. [2022-09-16 11:03:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26046 states, 25703 states have (on average 3.82223864918492) internal successors, (98243), 26045 states have internal predecessors, (98243), 0 states have call successors, (0), 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 11:03:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26046 states to 26046 states and 98243 transitions. [2022-09-16 11:03:52,872 INFO L78 Accepts]: Start accepts. Automaton has 26046 states and 98243 transitions. Word has length 75 [2022-09-16 11:03:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:52,873 INFO L495 AbstractCegarLoop]: Abstraction has 26046 states and 98243 transitions. [2022-09-16 11:03:52,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 11:03:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 26046 states and 98243 transitions. [2022-09-16 11:03:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-09-16 11:03:52,874 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:52,874 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] [2022-09-16 11:03:52,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 11:03:52,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1164477165, now seen corresponding path program 1 times [2022-09-16 11:03:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:52,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493084244] [2022-09-16 11:03:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:52,930 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 11:03:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:52,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493084244] [2022-09-16 11:03:52,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493084244] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:52,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:52,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:03:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826007960] [2022-09-16 11:03:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:03:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:03:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:03:52,932 INFO L87 Difference]: Start difference. First operand 26046 states and 98243 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 11:03:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:53,370 INFO L93 Difference]: Finished difference Result 39460 states and 143216 transitions. [2022-09-16 11:03:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:03:53,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-09-16 11:03:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:53,595 INFO L225 Difference]: With dead ends: 39460 [2022-09-16 11:03:53,595 INFO L226 Difference]: Without dead ends: 39460 [2022-09-16 11:03:53,596 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 11:03:53,596 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 163 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:53,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 503 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:03:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39460 states. [2022-09-16 11:03:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39460 to 29838. [2022-09-16 11:03:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29838 states, 29495 states have (on average 3.804102390235633) internal successors, (112202), 29837 states have internal predecessors, (112202), 0 states have call successors, (0), 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 11:03:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29838 states to 29838 states and 112202 transitions. [2022-09-16 11:03:54,971 INFO L78 Accepts]: Start accepts. Automaton has 29838 states and 112202 transitions. Word has length 77 [2022-09-16 11:03:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:54,971 INFO L495 AbstractCegarLoop]: Abstraction has 29838 states and 112202 transitions. [2022-09-16 11:03:54,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 11:03:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29838 states and 112202 transitions. [2022-09-16 11:03:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-09-16 11:03:54,973 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:54,973 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] [2022-09-16 11:03:54,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 11:03:54,973 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1644600743, now seen corresponding path program 1 times [2022-09-16 11:03:54,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:54,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718775021] [2022-09-16 11:03:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:55,114 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 11:03:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:55,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718775021] [2022-09-16 11:03:55,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718775021] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:03:55,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:03:55,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-16 11:03:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923884703] [2022-09-16 11:03:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:03:55,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-16 11:03:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:55,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-16 11:03:55,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-09-16 11:03:55,116 INFO L87 Difference]: Start difference. First operand 29838 states and 112202 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:03:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:55,773 INFO L93 Difference]: Finished difference Result 29148 states and 109588 transitions. [2022-09-16 11:03:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-16 11:03:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-09-16 11:03:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:55,928 INFO L225 Difference]: With dead ends: 29148 [2022-09-16 11:03:55,928 INFO L226 Difference]: Without dead ends: 28717 [2022-09-16 11:03:55,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:03:55,929 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 554 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:55,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 750 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 11:03:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28717 states. [2022-09-16 11:03:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28717 to 28717. [2022-09-16 11:03:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28717 states, 28374 states have (on average 3.823218439416367) internal successors, (108480), 28716 states have internal predecessors, (108480), 0 states have call successors, (0), 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 11:03:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 108480 transitions. [2022-09-16 11:03:57,133 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 108480 transitions. Word has length 78 [2022-09-16 11:03:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:57,133 INFO L495 AbstractCegarLoop]: Abstraction has 28717 states and 108480 transitions. [2022-09-16 11:03:57,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:03:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 108480 transitions. [2022-09-16 11:03:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-09-16 11:03:57,134 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:57,135 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] [2022-09-16 11:03:57,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 11:03:57,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:03:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash 326529590, now seen corresponding path program 1 times [2022-09-16 11:03:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:57,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602732912] [2022-09-16 11:03:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:57,445 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 11:03:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:57,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602732912] [2022-09-16 11:03:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602732912] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:57,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390508826] [2022-09-16 11:03:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:57,447 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 11:03:57,448 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 11:03:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:57,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:03:57,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:57,571 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 11:03:57,599 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:03:57,600 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 18 [2022-09-16 11:03:57,727 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:03:57,728 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 15 treesize of output 15 [2022-09-16 11:03:57,818 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 11:03:57,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:57,981 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 11:03:58,068 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 11:03:58,098 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 11:03:58,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:58,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:03:58,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:58,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:03:58,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:03:58,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |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 11:03:58,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |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 11:03:58,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:58,213 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 11:03:58,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:58,219 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 11:03:58,224 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 11:03:58,227 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 11:03:58,603 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 11:03:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:03:58,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390508826] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:58,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:58,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-09-16 11:03:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029647655] [2022-09-16 11:03:58,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-09-16 11:03:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-09-16 11:03:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1137, Unknown=6, NotChecked=438, Total=1722 [2022-09-16 11:03:58,763 INFO L87 Difference]: Start difference. First operand 28717 states and 108480 transitions. Second operand has 42 states, 41 states have (on average 5.0) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 11:04:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:00,156 INFO L93 Difference]: Finished difference Result 46262 states and 167583 transitions. [2022-09-16 11:04:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:04:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.0) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 80 [2022-09-16 11:04:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:00,540 INFO L225 Difference]: With dead ends: 46262 [2022-09-16 11:04:00,541 INFO L226 Difference]: Without dead ends: 46262 [2022-09-16 11:04:00,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 132 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=354, Invalid=2114, Unknown=6, NotChecked=606, Total=3080 [2022-09-16 11:04:00,542 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 547 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1295 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:00,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2791 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1034 Invalid, 0 Unknown, 1295 Unchecked, 0.5s Time] [2022-09-16 11:04:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46262 states. [2022-09-16 11:04:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46262 to 28975. [2022-09-16 11:04:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28975 states, 28632 states have (on average 3.8217029896619166) internal successors, (109423), 28974 states have internal predecessors, (109423), 0 states have call successors, (0), 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 11:04:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28975 states to 28975 states and 109423 transitions. [2022-09-16 11:04:01,512 INFO L78 Accepts]: Start accepts. Automaton has 28975 states and 109423 transitions. Word has length 80 [2022-09-16 11:04:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:01,512 INFO L495 AbstractCegarLoop]: Abstraction has 28975 states and 109423 transitions. [2022-09-16 11:04:01,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.0) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 11:04:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28975 states and 109423 transitions. [2022-09-16 11:04:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-09-16 11:04:01,513 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:01,513 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] [2022-09-16 11:04:01,534 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 11:04:01,716 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,SelfDestructingSolverStorable10 [2022-09-16 11:04:01,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 326529593, now seen corresponding path program 1 times [2022-09-16 11:04:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:01,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085732596] [2022-09-16 11:04:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:02,027 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 11:04:02,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:02,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085732596] [2022-09-16 11:04:02,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085732596] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:02,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515474940] [2022-09-16 11:04:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:02,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:02,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:02,034 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 11:04:02,036 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 11:04:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:02,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjunts are in the unsatisfiable core [2022-09-16 11:04:02,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:02,281 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 11:04:02,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:02,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 11:04:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:02,497 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 11:04:02,516 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 11:04:02,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:02,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:04:02,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:02,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:02,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:02,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:02,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:02,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:02,613 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 11:04:02,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:02,619 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 11:04:02,622 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 11:04:02,626 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 11:04:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:03,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515474940] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:03,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:03,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-09-16 11:04:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170505359] [2022-09-16 11:04:03,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:03,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-09-16 11:04:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-09-16 11:04:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1015, Unknown=6, NotChecked=414, Total=1560 [2022-09-16 11:04:03,258 INFO L87 Difference]: Start difference. First operand 28975 states and 109423 transitions. Second operand has 40 states, 39 states have (on average 4.615384615384615) internal successors, (180), 40 states have internal predecessors, (180), 0 states have call successors, (0), 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 11:04:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:05,103 INFO L93 Difference]: Finished difference Result 46176 states and 167326 transitions. [2022-09-16 11:04:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:04:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 4.615384615384615) internal successors, (180), 40 states have internal predecessors, (180), 0 states have call successors, (0), 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 80 [2022-09-16 11:04:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:05,323 INFO L225 Difference]: With dead ends: 46176 [2022-09-16 11:04:05,323 INFO L226 Difference]: Without dead ends: 46176 [2022-09-16 11:04:05,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 133 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=379, Invalid=1991, Unknown=6, NotChecked=594, Total=2970 [2022-09-16 11:04:05,324 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1637 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1398 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:05,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 2583 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1045 Invalid, 0 Unknown, 1398 Unchecked, 0.5s Time] [2022-09-16 11:04:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46176 states. [2022-09-16 11:04:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46176 to 28975. [2022-09-16 11:04:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28975 states, 28632 states have (on average 3.8186993573623917) internal successors, (109337), 28974 states have internal predecessors, (109337), 0 states have call successors, (0), 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 11:04:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28975 states to 28975 states and 109337 transitions. [2022-09-16 11:04:06,362 INFO L78 Accepts]: Start accepts. Automaton has 28975 states and 109337 transitions. Word has length 80 [2022-09-16 11:04:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:06,362 INFO L495 AbstractCegarLoop]: Abstraction has 28975 states and 109337 transitions. [2022-09-16 11:04:06,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.615384615384615) internal successors, (180), 40 states have internal predecessors, (180), 0 states have call successors, (0), 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 11:04:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 28975 states and 109337 transitions. [2022-09-16 11:04:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-09-16 11:04:06,363 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:06,364 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] [2022-09-16 11:04:06,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:06,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:06,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1072373215, now seen corresponding path program 1 times [2022-09-16 11:04:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787096554] [2022-09-16 11:04:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:06,816 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 11:04:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787096554] [2022-09-16 11:04:06,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787096554] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938373616] [2022-09-16 11:04:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:06,828 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 11:04:06,829 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 11:04:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:06,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 11:04:06,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:06,950 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 11:04:06,980 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:04:06,980 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 18 [2022-09-16 11:04:07,408 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:04:07,409 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 15 treesize of output 15 [2022-09-16 11:04:07,530 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 11:04:07,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:07,685 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 11:04:07,728 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 11:04:07,776 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 11:04:07,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:07,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:07,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:07,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:07,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:07,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:07,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:07,957 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 11:04:07,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:07,963 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 11:04:07,966 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 11:04:07,977 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 11:04:08,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 10 treesize of output 8 [2022-09-16 11:04:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:08,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938373616] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:08,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:08,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-09-16 11:04:08,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896534212] [2022-09-16 11:04:08,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:08,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-09-16 11:04:08,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:08,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-09-16 11:04:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1197, Unknown=5, NotChecked=370, Total=1722 [2022-09-16 11:04:08,399 INFO L87 Difference]: Start difference. First operand 28975 states and 109337 transitions. Second operand has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 11:04:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:09,945 INFO L93 Difference]: Finished difference Result 46365 states and 168717 transitions. [2022-09-16 11:04:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:04:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 81 [2022-09-16 11:04:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:10,233 INFO L225 Difference]: With dead ends: 46365 [2022-09-16 11:04:10,233 INFO L226 Difference]: Without dead ends: 46365 [2022-09-16 11:04:10,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=358, Invalid=2413, Unknown=5, NotChecked=530, Total=3306 [2022-09-16 11:04:10,242 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 529 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 871 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:10,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 3100 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1195 Invalid, 0 Unknown, 871 Unchecked, 0.5s Time] [2022-09-16 11:04:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2022-09-16 11:04:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 29404. [2022-09-16 11:04:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29404 states, 29061 states have (on average 3.8181755617494235) internal successors, (110960), 29403 states have internal predecessors, (110960), 0 states have call successors, (0), 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 11:04:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29404 states to 29404 states and 110960 transitions. [2022-09-16 11:04:11,429 INFO L78 Accepts]: Start accepts. Automaton has 29404 states and 110960 transitions. Word has length 81 [2022-09-16 11:04:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:11,430 INFO L495 AbstractCegarLoop]: Abstraction has 29404 states and 110960 transitions. [2022-09-16 11:04:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 11:04:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29404 states and 110960 transitions. [2022-09-16 11:04:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-09-16 11:04:11,431 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:11,431 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] [2022-09-16 11:04:11,455 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 11:04:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:11,657 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:11,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1072373216, now seen corresponding path program 1 times [2022-09-16 11:04:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:11,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221644719] [2022-09-16 11:04:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:11,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:11,750 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 11:04:11,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:11,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221644719] [2022-09-16 11:04:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221644719] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:04:11,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:04:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 11:04:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620464012] [2022-09-16 11:04:11,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:04:11,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:04:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:04:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:04:11,751 INFO L87 Difference]: Start difference. First operand 29404 states and 110960 transitions. Second operand has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 11:04:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:12,336 INFO L93 Difference]: Finished difference Result 36001 states and 135429 transitions. [2022-09-16 11:04:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:04:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-09-16 11:04:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:12,522 INFO L225 Difference]: With dead ends: 36001 [2022-09-16 11:04:12,522 INFO L226 Difference]: Without dead ends: 36001 [2022-09-16 11:04:12,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:04:12,523 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:12,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 183 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:04:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36001 states. [2022-09-16 11:04:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36001 to 33855. [2022-09-16 11:04:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33855 states, 33512 states have (on average 3.8735378371926474) internal successors, (129810), 33854 states have internal predecessors, (129810), 0 states have call successors, (0), 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 11:04:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33855 states to 33855 states and 129810 transitions. [2022-09-16 11:04:14,056 INFO L78 Accepts]: Start accepts. Automaton has 33855 states and 129810 transitions. Word has length 81 [2022-09-16 11:04:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:14,057 INFO L495 AbstractCegarLoop]: Abstraction has 33855 states and 129810 transitions. [2022-09-16 11:04:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 11:04:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 33855 states and 129810 transitions. [2022-09-16 11:04:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-09-16 11:04:14,058 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:14,058 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] [2022-09-16 11:04:14,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-16 11:04:14,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1072373212, now seen corresponding path program 1 times [2022-09-16 11:04:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:14,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739374264] [2022-09-16 11:04:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:14,365 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 11:04:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739374264] [2022-09-16 11:04:14,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739374264] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789922900] [2022-09-16 11:04:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:14,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:14,367 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 11:04:14,373 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 11:04:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:14,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:04:14,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:14,507 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 11:04:14,549 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:04:14,549 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 18 [2022-09-16 11:04:14,671 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:04:14,671 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 15 treesize of output 15 [2022-09-16 11:04:14,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, 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 11:04:14,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:14,909 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 11:04:14,947 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 11:04:14,987 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 11:04:14,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:15,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-09-16 11:04:15,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:15,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:15,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) |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 11:04:15,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_320) |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 11:04:15,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:15,114 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 11:04:15,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:15,119 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 11:04:15,123 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 11:04:15,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 118 treesize of output 110 [2022-09-16 11:04:15,511 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 11:04:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:15,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789922900] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:15,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:15,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-09-16 11:04:15,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229444548] [2022-09-16 11:04:15,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:15,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-09-16 11:04:15,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:15,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-09-16 11:04:15,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1197, Unknown=5, NotChecked=370, Total=1722 [2022-09-16 11:04:15,545 INFO L87 Difference]: Start difference. First operand 33855 states and 129810 transitions. Second operand has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 11:04:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:17,257 INFO L93 Difference]: Finished difference Result 50721 states and 187712 transitions. [2022-09-16 11:04:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:04:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 81 [2022-09-16 11:04:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:17,549 INFO L225 Difference]: With dead ends: 50721 [2022-09-16 11:04:17,549 INFO L226 Difference]: Without dead ends: 50721 [2022-09-16 11:04:17,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=2195, Unknown=5, NotChecked=510, Total=3080 [2022-09-16 11:04:17,553 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 484 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 837 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:17,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 2378 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 979 Invalid, 0 Unknown, 837 Unchecked, 0.6s Time] [2022-09-16 11:04:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50721 states. [2022-09-16 11:04:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50721 to 33840. [2022-09-16 11:04:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33840 states, 33497 states have (on average 3.8709436665970087) internal successors, (129665), 33839 states have internal predecessors, (129665), 0 states have call successors, (0), 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 11:04:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33840 states to 33840 states and 129665 transitions. [2022-09-16 11:04:19,212 INFO L78 Accepts]: Start accepts. Automaton has 33840 states and 129665 transitions. Word has length 81 [2022-09-16 11:04:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:19,212 INFO L495 AbstractCegarLoop]: Abstraction has 33840 states and 129665 transitions. [2022-09-16 11:04:19,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.073170731707317) internal successors, (208), 42 states have internal predecessors, (208), 0 states have call successors, (0), 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 11:04:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33840 states and 129665 transitions. [2022-09-16 11:04:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-09-16 11:04:19,214 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:19,214 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:04:19,241 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 11:04:19,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-09-16 11:04:19,428 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2003119547, now seen corresponding path program 1 times [2022-09-16 11:04:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:19,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235685561] [2022-09-16 11:04:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:19,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235685561] [2022-09-16 11:04:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235685561] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992590338] [2022-09-16 11:04:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:19,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:19,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:19,564 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 11:04:19,566 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 11:04:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:19,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:04:19,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:19,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992590338] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:19,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:19,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-09-16 11:04:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666524135] [2022-09-16 11:04:19,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:19,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-09-16 11:04:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-09-16 11:04:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-09-16 11:04:19,996 INFO L87 Difference]: Start difference. First operand 33840 states and 129665 transitions. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 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 11:04:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:21,594 INFO L93 Difference]: Finished difference Result 59271 states and 222806 transitions. [2022-09-16 11:04:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-16 11:04:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 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 82 [2022-09-16 11:04:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:21,960 INFO L225 Difference]: With dead ends: 59271 [2022-09-16 11:04:21,961 INFO L226 Difference]: Without dead ends: 59055 [2022-09-16 11:04:21,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 11:04:21,962 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1364 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:21,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2383 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 11:04:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59055 states. [2022-09-16 11:04:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59055 to 45972. [2022-09-16 11:04:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45972 states, 45629 states have (on average 3.934931732012536) internal successors, (179547), 45971 states have internal predecessors, (179547), 0 states have call successors, (0), 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 11:04:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45972 states to 45972 states and 179547 transitions. [2022-09-16 11:04:24,039 INFO L78 Accepts]: Start accepts. Automaton has 45972 states and 179547 transitions. Word has length 82 [2022-09-16 11:04:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:24,039 INFO L495 AbstractCegarLoop]: Abstraction has 45972 states and 179547 transitions. [2022-09-16 11:04:24,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 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 11:04:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 45972 states and 179547 transitions. [2022-09-16 11:04:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-09-16 11:04:24,040 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:24,040 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] [2022-09-16 11:04:24,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:24,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 11:04:24,254 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash -241461213, now seen corresponding path program 1 times [2022-09-16 11:04:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:24,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761311390] [2022-09-16 11:04:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:24,284 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 11:04:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:24,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761311390] [2022-09-16 11:04:24,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761311390] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:04:24,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:04:24,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:04:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661244809] [2022-09-16 11:04:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:04:24,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:04:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:04:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:04:24,286 INFO L87 Difference]: Start difference. First operand 45972 states and 179547 transitions. Second operand has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:04:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:25,465 INFO L93 Difference]: Finished difference Result 75673 states and 295183 transitions. [2022-09-16 11:04:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:04:25,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-09-16 11:04:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:26,352 INFO L225 Difference]: With dead ends: 75673 [2022-09-16 11:04:26,353 INFO L226 Difference]: Without dead ends: 75673 [2022-09-16 11:04:26,353 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 11:04:26,353 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 153 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:26,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 491 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:04:26,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75673 states. [2022-09-16 11:04:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75673 to 57071. [2022-09-16 11:04:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57071 states, 56728 states have (on average 4.101607671696517) internal successors, (232676), 57070 states have internal predecessors, (232676), 0 states have call successors, (0), 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 11:04:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57071 states to 57071 states and 232676 transitions. [2022-09-16 11:04:28,875 INFO L78 Accepts]: Start accepts. Automaton has 57071 states and 232676 transitions. Word has length 83 [2022-09-16 11:04:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:28,876 INFO L495 AbstractCegarLoop]: Abstraction has 57071 states and 232676 transitions. [2022-09-16 11:04:28,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:04:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 57071 states and 232676 transitions. [2022-09-16 11:04:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-09-16 11:04:28,878 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:28,878 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] [2022-09-16 11:04:28,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-16 11:04:28,878 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1005241843, now seen corresponding path program 2 times [2022-09-16 11:04:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:28,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298648280] [2022-09-16 11:04:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:29,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:29,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298648280] [2022-09-16 11:04:29,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298648280] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:29,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538182767] [2022-09-16 11:04:29,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:04:29,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:29,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:29,223 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 11:04:29,224 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 11:04:29,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:04:29,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:04:29,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-16 11:04:29,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:29,496 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 11:04:29,601 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:04:29,602 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 11:04:30,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:30,241 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 11:04:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:30,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:30,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:30,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:30,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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 11:04:30,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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 11:04:30,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int 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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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 11:04:30,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int)) (or (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int 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~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|)))) is different from false [2022-09-16 11:04:30,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int) (v_ArrVal_391 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 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~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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 11:04:30,466 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:04:30,467 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 11:04:30,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:30,473 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 11:04:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:04:30,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538182767] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:30,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:30,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-09-16 11:04:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675914489] [2022-09-16 11:04:30,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-09-16 11:04:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-09-16 11:04:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1132, Unknown=7, NotChecked=518, Total=1806 [2022-09-16 11:04:30,618 INFO L87 Difference]: Start difference. First operand 57071 states and 232676 transitions. Second operand has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 11:04:31,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_389 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int) (v_ArrVal_391 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 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~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ |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|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) is different from false [2022-09-16 11:04:31,582 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_389 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int) (v_ArrVal_391 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 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~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) is different from false [2022-09-16 11:04:33,586 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| Int)) (or (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int 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~3#1_32| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |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~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|)))) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 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_#t~post23#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 11:04:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:35,546 INFO L93 Difference]: Finished difference Result 85775 states and 339771 transitions. [2022-09-16 11:04:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:04:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 84 [2022-09-16 11:04:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:36,083 INFO L225 Difference]: With dead ends: 85775 [2022-09-16 11:04:36,084 INFO L226 Difference]: Without dead ends: 85775 [2022-09-16 11:04:36,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=363, Invalid=2217, Unknown=10, NotChecked=1070, Total=3660 [2022-09-16 11:04:36,089 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 717 mSDsluCounter, 2849 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1484 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:36,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 2758 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1337 Invalid, 0 Unknown, 1484 Unchecked, 0.6s Time] [2022-09-16 11:04:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85775 states. [2022-09-16 11:04:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85775 to 57071. [2022-09-16 11:04:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57071 states, 56728 states have (on average 4.101519531800874) internal successors, (232671), 57070 states have internal predecessors, (232671), 0 states have call successors, (0), 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 11:04:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57071 states to 57071 states and 232671 transitions. [2022-09-16 11:04:38,899 INFO L78 Accepts]: Start accepts. Automaton has 57071 states and 232671 transitions. Word has length 84 [2022-09-16 11:04:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:38,899 INFO L495 AbstractCegarLoop]: Abstraction has 57071 states and 232671 transitions. [2022-09-16 11:04:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 11:04:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 57071 states and 232671 transitions. [2022-09-16 11:04:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-09-16 11:04:38,901 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:38,901 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] [2022-09-16 11:04:38,924 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 11:04:39,115 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,SelfDestructingSolverStorable17 [2022-09-16 11:04:39,118 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1005241846, now seen corresponding path program 2 times [2022-09-16 11:04:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:39,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680071665] [2022-09-16 11:04:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:39,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680071665] [2022-09-16 11:04:39,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680071665] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:39,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860269832] [2022-09-16 11:04:39,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:04:39,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:39,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:39,368 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 11:04:39,370 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 11:04:39,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:04:39,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:04:39,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjunts are in the unsatisfiable core [2022-09-16 11:04:39,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:39,603 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 11:04:39,715 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:04:39,715 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 11:04:39,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:39,833 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 11:04:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:04:39,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:39,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:39,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:39,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:39,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:39,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_424 (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_423)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:39,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36|)) (forall ((v_ArrVal_423 Int) (v_ArrVal_424 (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~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_423)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) is different from false [2022-09-16 11:04:40,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int)) (or (<= (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~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_423)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:04:40,366 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:04:40,367 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 11:04:40,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:40,374 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 11:04:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:04:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860269832] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:40,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:40,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-09-16 11:04:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015271004] [2022-09-16 11:04:40,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-09-16 11:04:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:40,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-09-16 11:04:40,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1132, Unknown=7, NotChecked=518, Total=1806 [2022-09-16 11:04:40,529 INFO L87 Difference]: Start difference. First operand 57071 states and 232671 transitions. Second operand has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 11:04:41,109 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_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (forall ((v_ArrVal_423 Int) (v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int)) (or (<= (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~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_423)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= (+ |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|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |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_#t~nondet24#1| 2147483647)) is different from false [2022-09-16 11:04:41,487 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_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (forall ((v_ArrVal_423 Int) (v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| Int)) (or (<= (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~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_423)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) is different from false [2022-09-16 11:04:43,490 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= (+ 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~3#1_36| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_36|)) (forall ((v_ArrVal_423 Int) (v_ArrVal_424 (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~3#1_36| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_423)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 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 11:04:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:45,212 INFO L93 Difference]: Finished difference Result 85770 states and 339761 transitions. [2022-09-16 11:04:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:04:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 84 [2022-09-16 11:04:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:45,766 INFO L225 Difference]: With dead ends: 85770 [2022-09-16 11:04:45,766 INFO L226 Difference]: Without dead ends: 85770 [2022-09-16 11:04:45,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=363, Invalid=2217, Unknown=10, NotChecked=1070, Total=3660 [2022-09-16 11:04:45,767 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 568 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1339 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:45,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2523 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1183 Invalid, 0 Unknown, 1339 Unchecked, 0.5s Time] [2022-09-16 11:04:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85770 states. [2022-09-16 11:04:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85770 to 57071. [2022-09-16 11:04:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57071 states, 56728 states have (on average 4.101431391905232) internal successors, (232666), 57070 states have internal predecessors, (232666), 0 states have call successors, (0), 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 11:04:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57071 states to 57071 states and 232666 transitions. [2022-09-16 11:04:48,770 INFO L78 Accepts]: Start accepts. Automaton has 57071 states and 232666 transitions. Word has length 84 [2022-09-16 11:04:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:48,771 INFO L495 AbstractCegarLoop]: Abstraction has 57071 states and 232666 transitions. [2022-09-16 11:04:48,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 4.571428571428571) internal successors, (192), 43 states have internal predecessors, (192), 0 states have call successors, (0), 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 11:04:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 57071 states and 232666 transitions. [2022-09-16 11:04:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:04:48,777 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:48,778 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 11:04:48,795 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 11:04:48,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:48,997 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash -651618818, now seen corresponding path program 1 times [2022-09-16 11:04:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:48,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538355364] [2022-09-16 11:04:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:49,376 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 11:04:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538355364] [2022-09-16 11:04:49,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538355364] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990602479] [2022-09-16 11:04:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:49,379 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 11:04:49,380 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 11:04:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:49,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-09-16 11:04:49,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:49,754 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 11:04:50,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:50,003 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 11:04:50,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:50,088 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 11:04:50,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:50,135 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 11:04:50,155 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 11:04:50,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:50,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:04:50,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:04:50,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:04:50,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-09-16 11:04:50,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:04:50,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) |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 11:04:50,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_461) |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 11:04:50,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:50,305 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 11:04:50,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:50,314 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 11:04:50,319 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 11:04:50,325 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 121 treesize of output 117 [2022-09-16 11:04:50,330 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 11:04:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:51,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990602479] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:51,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:51,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2022-09-16 11:04:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144033115] [2022-09-16 11:04:51,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:51,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-09-16 11:04:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-09-16 11:04:51,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1282, Unknown=7, NotChecked=546, Total=1980 [2022-09-16 11:04:51,034 INFO L87 Difference]: Start difference. First operand 57071 states and 232666 transitions. Second operand has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 11:04:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:04:53,856 INFO L93 Difference]: Finished difference Result 93391 states and 361203 transitions. [2022-09-16 11:04:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:04:53,857 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 11:04:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:04:54,733 INFO L225 Difference]: With dead ends: 93391 [2022-09-16 11:04:54,733 INFO L226 Difference]: Without dead ends: 93391 [2022-09-16 11:04:54,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=405, Invalid=2268, Unknown=7, NotChecked=742, Total=3422 [2022-09-16 11:04:54,734 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1698 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1364 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:04:54,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 2673 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1112 Invalid, 0 Unknown, 1364 Unchecked, 0.6s Time] [2022-09-16 11:04:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93391 states. [2022-09-16 11:04:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93391 to 57071. [2022-09-16 11:04:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57071 states, 56728 states have (on average 4.072045550698068) internal successors, (230999), 57070 states have internal predecessors, (230999), 0 states have call successors, (0), 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 11:04:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57071 states to 57071 states and 230999 transitions. [2022-09-16 11:04:57,219 INFO L78 Accepts]: Start accepts. Automaton has 57071 states and 230999 transitions. Word has length 86 [2022-09-16 11:04:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:04:57,219 INFO L495 AbstractCegarLoop]: Abstraction has 57071 states and 230999 transitions. [2022-09-16 11:04:57,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 11:04:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 57071 states and 230999 transitions. [2022-09-16 11:04:57,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:04:57,221 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:04:57,221 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 11:04:57,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-09-16 11:04:57,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:57,436 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:04:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:04:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash -651618815, now seen corresponding path program 1 times [2022-09-16 11:04:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:04:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798191379] [2022-09-16 11:04:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:04:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:58,130 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 11:04:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:04:58,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798191379] [2022-09-16 11:04:58,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798191379] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:04:58,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995457049] [2022-09-16 11:04:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:04:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:04:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:04:58,133 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 11:04:58,134 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 11:04:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:04:58,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:04:58,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:04:58,239 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 11:04:58,254 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:04:58,254 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 11:04:58,280 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-16 11:04:58,280 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 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-16 11:04:58,442 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:04:58,442 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 24 treesize of output 34 [2022-09-16 11:04:58,544 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 11:04:58,701 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 11:04:58,771 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 11:04:58,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:04:58,824 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 11:04:58,851 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 11:04:58,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:04:58,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:04:58,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:04:58,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:58,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:04:58,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:58,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:58,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:04:58,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:58,962 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 11:04:58,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:04:58,969 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 11:04:58,972 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 218 [2022-09-16 11:04:58,977 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 218 treesize of output 202 [2022-09-16 11:04:58,982 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 98 [2022-09-16 11:04:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:04:59,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995457049] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:04:59,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:04:59,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 47 [2022-09-16 11:04:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894806507] [2022-09-16 11:04:59,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:04:59,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:04:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:04:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:04:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1507, Unknown=7, NotChecked=588, Total=2256 [2022-09-16 11:04:59,560 INFO L87 Difference]: Start difference. First operand 57071 states and 230999 transitions. Second operand has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 11:05:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:01,786 INFO L93 Difference]: Finished difference Result 91724 states and 354532 transitions. [2022-09-16 11:05:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:05:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 11:05:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:02,400 INFO L225 Difference]: With dead ends: 91724 [2022-09-16 11:05:02,400 INFO L226 Difference]: Without dead ends: 91616 [2022-09-16 11:05:02,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=407, Invalid=2694, Unknown=7, NotChecked=798, Total=3906 [2022-09-16 11:05:02,401 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 803 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1611 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:02,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 2989 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1123 Invalid, 0 Unknown, 1611 Unchecked, 0.4s Time] [2022-09-16 11:05:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91616 states. [2022-09-16 11:05:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91616 to 56963. [2022-09-16 11:05:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56963 states, 56620 states have (on average 4.041946308724833) internal successors, (228855), 56962 states have internal predecessors, (228855), 0 states have call successors, (0), 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 11:05:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56963 states to 56963 states and 228855 transitions. [2022-09-16 11:05:05,373 INFO L78 Accepts]: Start accepts. Automaton has 56963 states and 228855 transitions. Word has length 86 [2022-09-16 11:05:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:05,373 INFO L495 AbstractCegarLoop]: Abstraction has 56963 states and 228855 transitions. [2022-09-16 11:05:05,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 11:05:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 56963 states and 228855 transitions. [2022-09-16 11:05:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:05:05,377 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:05,377 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 11:05:05,401 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 11:05:05,594 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,SelfDestructingSolverStorable20 [2022-09-16 11:05:05,595 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash 523286255, now seen corresponding path program 1 times [2022-09-16 11:05:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:05,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850104392] [2022-09-16 11:05:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:05,946 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 11:05:05,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:05,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850104392] [2022-09-16 11:05:05,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850104392] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:05,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825678246] [2022-09-16 11:05:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:05,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:05,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:05,948 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 11:05:05,949 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 11:05:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:06,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjunts are in the unsatisfiable core [2022-09-16 11:05:06,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:06,120 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 11:05:06,138 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:05:06,139 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 11:05:06,175 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-16 11:05:06,176 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 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-16 11:05:06,385 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:05:06,385 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 24 treesize of output 34 [2022-09-16 11:05:06,501 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 11:05:06,709 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 11:05:06,758 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 11:05:06,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:06,838 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 11:05:06,867 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 11:05:06,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:06,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_541 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:05:06,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_541 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:05:06,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:05:06,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:05:06,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:06,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:06,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_539) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:05:06,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:06,997 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 11:05:07,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:07,005 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 11:05:07,010 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 11:05:07,013 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 11:05:07,017 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 11:05:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:05:07,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825678246] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:07,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 47 [2022-09-16 11:05:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239264782] [2022-09-16 11:05:07,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:07,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:05:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:07,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:05:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1510, Unknown=7, NotChecked=588, Total=2256 [2022-09-16 11:05:07,994 INFO L87 Difference]: Start difference. First operand 56963 states and 228855 transitions. Second operand has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 11:05:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:10,592 INFO L93 Difference]: Finished difference Result 87813 states and 335446 transitions. [2022-09-16 11:05:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:05:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 11:05:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:11,501 INFO L225 Difference]: With dead ends: 87813 [2022-09-16 11:05:11,502 INFO L226 Difference]: Without dead ends: 87813 [2022-09-16 11:05:11,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 143 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=389, Invalid=2937, Unknown=8, NotChecked=826, Total=4160 [2022-09-16 11:05:11,503 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 698 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1633 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:11,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 3581 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1369 Invalid, 0 Unknown, 1633 Unchecked, 0.7s Time] [2022-09-16 11:05:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87813 states. [2022-09-16 11:05:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87813 to 57935. [2022-09-16 11:05:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57935 states, 57592 states have (on average 4.033303236560633) internal successors, (232286), 57934 states have internal predecessors, (232286), 0 states have call successors, (0), 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 11:05:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57935 states to 57935 states and 232286 transitions. [2022-09-16 11:05:14,166 INFO L78 Accepts]: Start accepts. Automaton has 57935 states and 232286 transitions. Word has length 86 [2022-09-16 11:05:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:14,168 INFO L495 AbstractCegarLoop]: Abstraction has 57935 states and 232286 transitions. [2022-09-16 11:05:14,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.76595744680851) internal successors, (224), 48 states have internal predecessors, (224), 0 states have call successors, (0), 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 11:05:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 57935 states and 232286 transitions. [2022-09-16 11:05:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-09-16 11:05:14,169 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:14,169 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 11:05:14,197 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 11:05:14,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:14,384 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash 523286252, now seen corresponding path program 1 times [2022-09-16 11:05:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:14,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249509875] [2022-09-16 11:05:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:14,739 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 11:05:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249509875] [2022-09-16 11:05:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249509875] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973891894] [2022-09-16 11:05:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:14,741 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 11:05:14,742 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 11:05:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:14,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-09-16 11:05:14,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:15,107 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 11:05:15,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:15,621 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 11:05:15,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:15,657 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 11:05:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:15,711 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 11:05:15,728 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 11:05:15,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:15,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:05:15,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:15,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:15,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:15,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:05:15,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) |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 11:05:15,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) |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 11:05:15,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:15,834 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 11:05:15,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:15,847 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 11:05:15,852 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 129 treesize of output 121 [2022-09-16 11:05:15,856 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 250 treesize of output 234 [2022-09-16 11:05:15,859 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 234 treesize of output 230 [2022-09-16 11:05:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-16 11:05:16,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973891894] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:16,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:16,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2022-09-16 11:05:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111217602] [2022-09-16 11:05:16,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:16,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-09-16 11:05:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:16,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-09-16 11:05:16,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1284, Unknown=7, NotChecked=546, Total=1980 [2022-09-16 11:05:16,234 INFO L87 Difference]: Start difference. First operand 57935 states and 232286 transitions. Second operand has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 11:05:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:18,746 INFO L93 Difference]: Finished difference Result 86832 states and 331411 transitions. [2022-09-16 11:05:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:05:18,747 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 11:05:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:19,549 INFO L225 Difference]: With dead ends: 86832 [2022-09-16 11:05:19,549 INFO L226 Difference]: Without dead ends: 86832 [2022-09-16 11:05:19,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=435, Invalid=2342, Unknown=7, NotChecked=756, Total=3540 [2022-09-16 11:05:19,551 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 1675 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1864 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 2554 Invalid, 2970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1055 Invalid, 0 Unknown, 1864 Unchecked, 0.6s Time] [2022-09-16 11:05:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86832 states. [2022-09-16 11:05:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86832 to 57818. [2022-09-16 11:05:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57818 states, 57475 states have (on average 4.012422792518486) internal successors, (230614), 57817 states have internal predecessors, (230614), 0 states have call successors, (0), 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 11:05:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57818 states to 57818 states and 230614 transitions. [2022-09-16 11:05:22,016 INFO L78 Accepts]: Start accepts. Automaton has 57818 states and 230614 transitions. Word has length 86 [2022-09-16 11:05:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:22,016 INFO L495 AbstractCegarLoop]: Abstraction has 57818 states and 230614 transitions. [2022-09-16 11:05:22,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 11:05:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 57818 states and 230614 transitions. [2022-09-16 11:05:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-09-16 11:05:22,022 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:22,022 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 11:05:22,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-09-16 11:05:22,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:22,241 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -734891284, now seen corresponding path program 1 times [2022-09-16 11:05:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135641178] [2022-09-16 11:05:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:23,184 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 11:05:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:23,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135641178] [2022-09-16 11:05:23,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135641178] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:23,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799376622] [2022-09-16 11:05:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:23,186 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 11:05:23,188 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 11:05:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:23,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:05:23,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:23,563 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 11:05:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:24,271 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 11:05:24,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:24,374 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 11:05:24,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:24,471 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 11:05:24,620 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 11:05:24,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:26,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:26,047 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 34 treesize of output 35 [2022-09-16 11:05:26,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:26,058 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 1362 treesize of output 1302 [2022-09-16 11:05:26,068 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 1286 treesize of output 1190 [2022-09-16 11:05:26,080 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 1190 treesize of output 998 [2022-09-16 11:05:26,091 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 998 treesize of output 950 [2022-09-16 11:05:27,948 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 11:05:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799376622] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:27,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:27,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 68 [2022-09-16 11:05:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861621744] [2022-09-16 11:05:27,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:27,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-09-16 11:05:27,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-09-16 11:05:27,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4357, Unknown=43, NotChecked=0, Total=4692 [2022-09-16 11:05:27,952 INFO L87 Difference]: Start difference. First operand 57818 states and 230614 transitions. Second operand has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 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 11:05:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:31,991 INFO L93 Difference]: Finished difference Result 74567 states and 291884 transitions. [2022-09-16 11:05:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 11:05:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 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 11:05:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:32,772 INFO L225 Difference]: With dead ends: 74567 [2022-09-16 11:05:32,772 INFO L226 Difference]: Without dead ends: 74567 [2022-09-16 11:05:32,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 131 SyntacticMatches, 12 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2532 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=861, Invalid=8026, Unknown=43, NotChecked=0, Total=8930 [2022-09-16 11:05:32,774 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 1450 mSDsluCounter, 4789 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 3790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2025 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:32,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 4515 Invalid, 3790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1728 Invalid, 0 Unknown, 2025 Unchecked, 0.7s Time] [2022-09-16 11:05:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74567 states. [2022-09-16 11:05:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74567 to 60437. [2022-09-16 11:05:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60437 states, 60094 states have (on average 4.048307651346224) internal successors, (243279), 60436 states have internal predecessors, (243279), 0 states have call successors, (0), 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 11:05:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60437 states to 60437 states and 243279 transitions. [2022-09-16 11:05:35,615 INFO L78 Accepts]: Start accepts. Automaton has 60437 states and 243279 transitions. Word has length 87 [2022-09-16 11:05:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:35,615 INFO L495 AbstractCegarLoop]: Abstraction has 60437 states and 243279 transitions. [2022-09-16 11:05:35,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.9558823529411766) internal successors, (201), 69 states have internal predecessors, (201), 0 states have call successors, (0), 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 11:05:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 60437 states and 243279 transitions. [2022-09-16 11:05:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-09-16 11:05:35,617 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:35,617 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 11:05:35,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-09-16 11:05:35,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-09-16 11:05:35,835 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -734891281, now seen corresponding path program 1 times [2022-09-16 11:05:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347641984] [2022-09-16 11:05:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:36,482 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 11:05:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:36,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347641984] [2022-09-16 11:05:36,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347641984] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:36,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459855468] [2022-09-16 11:05:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:36,484 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 11:05:36,485 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 11:05:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:36,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 53 conjunts are in the unsatisfiable core [2022-09-16 11:05:36,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:36,642 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 11:05:36,670 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:05:36,670 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 11:05:36,716 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-16 11:05:36,716 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 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-16 11:05:36,982 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:05:36,982 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 24 treesize of output 34 [2022-09-16 11:05:37,145 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 15 treesize of output 11 [2022-09-16 11:05:37,882 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 11:05:38,003 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 11:05:38,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:38,108 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 11:05:38,420 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 11:05:38,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:39,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:39,552 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 32 treesize of output 33 [2022-09-16 11:05:39,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:39,560 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 310 treesize of output 298 [2022-09-16 11:05:39,564 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 282 treesize of output 234 [2022-09-16 11:05:39,570 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 234 treesize of output 210 [2022-09-16 11:05:39,576 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 198 [2022-09-16 11:05:40,774 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 11:05:40,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459855468] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:40,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:40,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-09-16 11:05:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441143132] [2022-09-16 11:05:40,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:40,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-09-16 11:05:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:40,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-09-16 11:05:40,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=4832, Unknown=92, NotChecked=0, Total=5256 [2022-09-16 11:05:40,776 INFO L87 Difference]: Start difference. First operand 60437 states and 243279 transitions. Second operand has 73 states, 72 states have (on average 3.138888888888889) internal successors, (226), 73 states have internal predecessors, (226), 0 states have call successors, (0), 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 11:05:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:44,507 INFO L93 Difference]: Finished difference Result 73442 states and 287513 transitions. [2022-09-16 11:05:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 11:05:44,507 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 3.138888888888889) internal successors, (226), 73 states have internal predecessors, (226), 0 states have call successors, (0), 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 11:05:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:45,003 INFO L225 Difference]: With dead ends: 73442 [2022-09-16 11:05:45,003 INFO L226 Difference]: Without dead ends: 73442 [2022-09-16 11:05:45,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1356, Invalid=8854, Unknown=92, NotChecked=0, Total=10302 [2022-09-16 11:05:45,004 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 3248 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3248 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:45,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3248 Valid, 3515 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1585 Invalid, 0 Unknown, 891 Unchecked, 0.8s Time] [2022-09-16 11:05:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73442 states. [2022-09-16 11:05:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73442 to 60284. [2022-09-16 11:05:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60284 states, 59941 states have (on average 4.029512353814584) internal successors, (241533), 60283 states have internal predecessors, (241533), 0 states have call successors, (0), 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 11:05:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60284 states to 60284 states and 241533 transitions. [2022-09-16 11:05:47,780 INFO L78 Accepts]: Start accepts. Automaton has 60284 states and 241533 transitions. Word has length 87 [2022-09-16 11:05:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:47,780 INFO L495 AbstractCegarLoop]: Abstraction has 60284 states and 241533 transitions. [2022-09-16 11:05:47,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 3.138888888888889) internal successors, (226), 73 states have internal predecessors, (226), 0 states have call successors, (0), 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 11:05:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 60284 states and 241533 transitions. [2022-09-16 11:05:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-09-16 11:05:47,790 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:47,790 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:05:47,816 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 11:05:48,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:48,007 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1507842724, now seen corresponding path program 1 times [2022-09-16 11:05:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:48,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842076072] [2022-09-16 11:05:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:48,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:48,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842076072] [2022-09-16 11:05:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842076072] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:48,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576448015] [2022-09-16 11:05:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:48,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:48,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:48,148 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 11:05:48,153 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 11:05:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:48,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 11:05:48,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:48,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:48,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576448015] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:48,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:48,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-09-16 11:05:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041286237] [2022-09-16 11:05:48,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:48,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-09-16 11:05:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:48,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-09-16 11:05:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-09-16 11:05:48,780 INFO L87 Difference]: Start difference. First operand 60284 states and 241533 transitions. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 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 11:05:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:50,245 INFO L93 Difference]: Finished difference Result 57998 states and 226922 transitions. [2022-09-16 11:05:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:05:50,245 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 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 88 [2022-09-16 11:05:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:50,596 INFO L225 Difference]: With dead ends: 57998 [2022-09-16 11:05:50,596 INFO L226 Difference]: Without dead ends: 56621 [2022-09-16 11:05:50,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=458, Invalid=1704, Unknown=0, NotChecked=0, Total=2162 [2022-09-16 11:05:50,597 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 1530 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:50,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 2910 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:05:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56621 states. [2022-09-16 11:05:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56621 to 53489. [2022-09-16 11:05:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53489 states, 53146 states have (on average 3.98475896586761) internal successors, (211774), 53488 states have internal predecessors, (211774), 0 states have call successors, (0), 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 11:05:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 211774 transitions. [2022-09-16 11:05:52,733 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 211774 transitions. Word has length 88 [2022-09-16 11:05:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:52,733 INFO L495 AbstractCegarLoop]: Abstraction has 53489 states and 211774 transitions. [2022-09-16 11:05:52,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 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 11:05:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 211774 transitions. [2022-09-16 11:05:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:05:52,736 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:52,736 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] [2022-09-16 11:05:52,756 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 11:05:52,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:52,952 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1855853645, now seen corresponding path program 1 times [2022-09-16 11:05:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:52,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142450257] [2022-09-16 11:05:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:53,039 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 11:05:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142450257] [2022-09-16 11:05:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142450257] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991311917] [2022-09-16 11:05:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:53,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:53,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:53,041 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 11:05:53,079 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 11:05:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:53,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:05:53,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:53,312 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 11:05:53,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:05:53,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991311917] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:05:53,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:05:53,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-09-16 11:05:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154068335] [2022-09-16 11:05:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:05:53,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:05:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:05:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-09-16 11:05:53,314 INFO L87 Difference]: Start difference. First operand 53489 states and 211774 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 11:05:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:54,271 INFO L93 Difference]: Finished difference Result 50845 states and 201150 transitions. [2022-09-16 11:05:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 11:05:54,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 11:05:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:54,617 INFO L225 Difference]: With dead ends: 50845 [2022-09-16 11:05:54,617 INFO L226 Difference]: Without dead ends: 50845 [2022-09-16 11:05:54,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:05:54,627 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 213 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:54,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 629 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:05:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50845 states. [2022-09-16 11:05:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50845 to 50845. [2022-09-16 11:05:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50845 states, 50551 states have (on average 3.979149769539673) internal successors, (201150), 50844 states have internal predecessors, (201150), 0 states have call successors, (0), 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 11:05:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50845 states to 50845 states and 201150 transitions. [2022-09-16 11:05:56,838 INFO L78 Accepts]: Start accepts. Automaton has 50845 states and 201150 transitions. Word has length 89 [2022-09-16 11:05:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:56,839 INFO L495 AbstractCegarLoop]: Abstraction has 50845 states and 201150 transitions. [2022-09-16 11:05:56,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 11:05:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 50845 states and 201150 transitions. [2022-09-16 11:05:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:05:56,842 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:56,842 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] [2022-09-16 11:05:56,869 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 11:05:57,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:57,056 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:05:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:57,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1616008695, now seen corresponding path program 2 times [2022-09-16 11:05:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:57,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071924543] [2022-09-16 11:05:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:57,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:57,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071924543] [2022-09-16 11:05:57,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071924543] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508122522] [2022-09-16 11:05:57,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:05:57,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:57,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:57,396 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 11:05:57,398 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 11:05:57,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:05:57,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:05:57,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 11:05:57,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:57,738 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 11:05:58,230 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:05:58,231 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 11:05:58,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:58,419 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 11:05:58,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:58,497 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 11:05:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:05:58,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:58,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:05:58,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:58,569 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:05:58,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:05:58,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |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 11:05:58,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |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 11:05:58,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 Int) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int 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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_750)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |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 11:05:58,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62|)) (forall ((v_ArrVal_750 Int) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int 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~3#1_62| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_750)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |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 11:05:58,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| Int) (v_ArrVal_750 Int) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (< 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~3#1_62| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_750)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:05:58,677 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:05:58,677 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 11:05:58,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:58,685 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 11:05:58,689 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 28 treesize of output 26 [2022-09-16 11:05:58,692 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 54 treesize of output 50 [2022-09-16 11:05:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:05:58,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508122522] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:58,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:58,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:05:58,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80896348] [2022-09-16 11:05:58,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:58,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:05:58,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:58,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:05:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1350, Unknown=9, NotChecked=738, Total=2256 [2022-09-16 11:05:58,947 INFO L87 Difference]: Start difference. First operand 50845 states and 201150 transitions. Second operand has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:05:59,568 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~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 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|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| Int) (v_ArrVal_750 Int) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (< 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~3#1_62| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_750)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))))) is different from false [2022-09-16 11:05:59,983 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 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|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| Int) (v_ArrVal_750 Int) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (< 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~3#1_62| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_750)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))))) is different from false [2022-09-16 11:06:01,992 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_62|)) (forall ((v_ArrVal_750 Int) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int 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~3#1_62| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_750)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))))) (<= 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)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 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 11:06:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:04,080 INFO L93 Difference]: Finished difference Result 74444 states and 288590 transitions. [2022-09-16 11:06:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:06:04,081 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:06:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:04,537 INFO L225 Difference]: With dead ends: 74444 [2022-09-16 11:06:04,538 INFO L226 Difference]: Without dead ends: 74444 [2022-09-16 11:06:04,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=381, Invalid=2517, Unknown=12, NotChecked=1380, Total=4290 [2022-09-16 11:06:04,539 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 876 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2200 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:04,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 2737 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1407 Invalid, 0 Unknown, 2200 Unchecked, 0.7s Time] [2022-09-16 11:06:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74444 states. [2022-09-16 11:06:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74444 to 50845. [2022-09-16 11:06:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50845 states, 50551 states have (on average 3.976459417222211) internal successors, (201014), 50844 states have internal predecessors, (201014), 0 states have call successors, (0), 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 11:06:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50845 states to 50845 states and 201014 transitions. [2022-09-16 11:06:07,203 INFO L78 Accepts]: Start accepts. Automaton has 50845 states and 201014 transitions. Word has length 89 [2022-09-16 11:06:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:07,204 INFO L495 AbstractCegarLoop]: Abstraction has 50845 states and 201014 transitions. [2022-09-16 11:06:07,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:06:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 50845 states and 201014 transitions. [2022-09-16 11:06:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:06:07,207 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:07,207 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] [2022-09-16 11:06:07,233 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 11:06:07,427 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,SelfDestructingSolverStorable27 [2022-09-16 11:06:07,428 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:07,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1616008692, now seen corresponding path program 2 times [2022-09-16 11:06:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:07,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901757366] [2022-09-16 11:06:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901757366] [2022-09-16 11:06:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901757366] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756388347] [2022-09-16 11:06:07,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:07,711 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 11:06:07,712 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 11:06:07,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:06:07,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:07,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjunts are in the unsatisfiable core [2022-09-16 11:06:07,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:08,006 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 11:06:08,110 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:06:08,110 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 11:06:08,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:08,232 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 11:06:08,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:08,286 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 11:06:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:08,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:08,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:06:08,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:06:08,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:06:08,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:08,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:08,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:08,398 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_788 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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_788)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:08,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|)) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_788 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~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_788)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) is different from false [2022-09-16 11:06:08,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int) (v_ArrVal_788 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#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~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_788)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) is different from false [2022-09-16 11:06:08,455 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:06:08,455 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 11:06:08,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:06:08,462 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 11:06:08,466 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 24 treesize of output 22 [2022-09-16 11:06:08,468 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 46 treesize of output 42 [2022-09-16 11:06:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:06:08,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756388347] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:08,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:08,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:06:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465702851] [2022-09-16 11:06:08,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:06:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:06:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1350, Unknown=9, NotChecked=738, Total=2256 [2022-09-16 11:06:08,693 INFO L87 Difference]: Start difference. First operand 50845 states and 201014 transitions. Second operand has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:06:09,232 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int) (v_ArrVal_788 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#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~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_788)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |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|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (<= .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 11:06:09,538 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int) (v_ArrVal_788 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#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~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_788)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |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|)))) is different from false [2022-09-16 11:06:11,553 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|)) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_788 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~3#1_66| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_788)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) (= 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 11:06:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:13,472 INFO L93 Difference]: Finished difference Result 74308 states and 288183 transitions. [2022-09-16 11:06:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:06:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:06:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:14,276 INFO L225 Difference]: With dead ends: 74308 [2022-09-16 11:06:14,277 INFO L226 Difference]: Without dead ends: 74308 [2022-09-16 11:06:14,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=381, Invalid=2517, Unknown=12, NotChecked=1380, Total=4290 [2022-09-16 11:06:14,278 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 969 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 3480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1919 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:14,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3128 Invalid, 3480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1517 Invalid, 0 Unknown, 1919 Unchecked, 0.9s Time] [2022-09-16 11:06:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74308 states. [2022-09-16 11:06:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74308 to 50845. [2022-09-16 11:06:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50845 states, 50551 states have (on average 3.9737690649047495) internal successors, (200878), 50844 states have internal predecessors, (200878), 0 states have call successors, (0), 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 11:06:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50845 states to 50845 states and 200878 transitions. [2022-09-16 11:06:16,546 INFO L78 Accepts]: Start accepts. Automaton has 50845 states and 200878 transitions. Word has length 89 [2022-09-16 11:06:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:16,547 INFO L495 AbstractCegarLoop]: Abstraction has 50845 states and 200878 transitions. [2022-09-16 11:06:16,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.404255319148936) internal successors, (207), 48 states have internal predecessors, (207), 0 states have call successors, (0), 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 11:06:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 50845 states and 200878 transitions. [2022-09-16 11:06:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-09-16 11:06:16,549 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:16,549 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 11:06:16,575 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 11:06:16,749 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,SelfDestructingSolverStorable28 [2022-09-16 11:06:16,750 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:16,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -243999156, now seen corresponding path program 2 times [2022-09-16 11:06:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:16,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370246970] [2022-09-16 11:06:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:16,856 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 11:06:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370246970] [2022-09-16 11:06:16,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370246970] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982014181] [2022-09-16 11:06:16,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:16,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:16,858 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 11:06:16,860 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 11:06:17,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:06:17,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:17,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-16 11:06:17,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:17,108 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 11:06:17,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:17,197 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 11:06:17,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982014181] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:17,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:17,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-09-16 11:06:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261773690] [2022-09-16 11:06:17,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:17,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:06:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:06:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:06:17,199 INFO L87 Difference]: Start difference. First operand 50845 states and 200878 transitions. Second operand has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 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 11:06:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:20,416 INFO L93 Difference]: Finished difference Result 207611 states and 829158 transitions. [2022-09-16 11:06:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:06:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 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 11:06:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:22,729 INFO L225 Difference]: With dead ends: 207611 [2022-09-16 11:06:22,729 INFO L226 Difference]: Without dead ends: 207611 [2022-09-16 11:06:22,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=419, Invalid=1063, Unknown=0, NotChecked=0, Total=1482 [2022-09-16 11:06:22,730 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 2328 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:22,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2328 Valid, 973 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 11:06:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207611 states. [2022-09-16 11:06:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207611 to 50821. [2022-09-16 11:06:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50821 states, 50528 states have (on average 3.9750633312222927) internal successors, (200852), 50820 states have internal predecessors, (200852), 0 states have call successors, (0), 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 11:06:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50821 states to 50821 states and 200852 transitions. [2022-09-16 11:06:26,913 INFO L78 Accepts]: Start accepts. Automaton has 50821 states and 200852 transitions. Word has length 89 [2022-09-16 11:06:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:26,914 INFO L495 AbstractCegarLoop]: Abstraction has 50821 states and 200852 transitions. [2022-09-16 11:06:26,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.529411764705882) internal successors, (128), 18 states have internal predecessors, (128), 0 states have call successors, (0), 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 11:06:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 50821 states and 200852 transitions. [2022-09-16 11:06:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:26,916 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:26,916 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] [2022-09-16 11:06:26,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-09-16 11:06:27,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:27,129 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:27,129 INFO L85 PathProgramCache]: Analyzing trace with hash -704138325, now seen corresponding path program 1 times [2022-09-16 11:06:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:27,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415796932] [2022-09-16 11:06:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:27,234 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 11:06:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:27,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415796932] [2022-09-16 11:06:27,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415796932] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:27,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609021384] [2022-09-16 11:06:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:27,236 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 11:06:27,237 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 11:06:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:27,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:27,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:27,549 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 11:06:27,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:27,729 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 11:06:27,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609021384] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:27,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:27,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2022-09-16 11:06:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913606314] [2022-09-16 11:06:27,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:27,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-09-16 11:06:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:27,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-09-16 11:06:27,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-09-16 11:06:27,731 INFO L87 Difference]: Start difference. First operand 50821 states and 200852 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 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 11:06:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:29,140 INFO L93 Difference]: Finished difference Result 54239 states and 211197 transitions. [2022-09-16 11:06:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:06:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 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 90 [2022-09-16 11:06:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:29,448 INFO L225 Difference]: With dead ends: 54239 [2022-09-16 11:06:29,448 INFO L226 Difference]: Without dead ends: 52493 [2022-09-16 11:06:29,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=444, Invalid=1278, Unknown=0, NotChecked=0, Total=1722 [2022-09-16 11:06:29,449 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1158 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:29,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1989 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 11:06:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52493 states. [2022-09-16 11:06:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52493 to 49588. [2022-09-16 11:06:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49588 states, 49295 states have (on average 3.992210163302566) internal successors, (196796), 49587 states have internal predecessors, (196796), 0 states have call successors, (0), 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 11:06:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49588 states to 49588 states and 196796 transitions. [2022-09-16 11:06:31,634 INFO L78 Accepts]: Start accepts. Automaton has 49588 states and 196796 transitions. Word has length 90 [2022-09-16 11:06:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:31,634 INFO L495 AbstractCegarLoop]: Abstraction has 49588 states and 196796 transitions. [2022-09-16 11:06:31,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 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 11:06:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 49588 states and 196796 transitions. [2022-09-16 11:06:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:31,637 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:31,637 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] [2022-09-16 11:06:31,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-09-16 11:06:31,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:31,861 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash -494927893, now seen corresponding path program 1 times [2022-09-16 11:06:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:31,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710448031] [2022-09-16 11:06:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:31,949 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 11:06:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:31,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710448031] [2022-09-16 11:06:31,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710448031] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:31,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201152956] [2022-09-16 11:06:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:31,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:31,950 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 11:06:31,951 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 11:06:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:32,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:32,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:32,212 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 11:06:32,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:32,666 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 11:06:32,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201152956] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:32,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:32,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-09-16 11:06:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621791629] [2022-09-16 11:06:32,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:32,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 11:06:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 11:06:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-09-16 11:06:32,670 INFO L87 Difference]: Start difference. First operand 49588 states and 196796 transitions. Second operand has 25 states, 25 states have (on average 5.88) internal successors, (147), 25 states have internal predecessors, (147), 0 states have call successors, (0), 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 11:06:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:34,072 INFO L93 Difference]: Finished difference Result 68225 states and 264433 transitions. [2022-09-16 11:06:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-16 11:06:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.88) internal successors, (147), 25 states have internal predecessors, (147), 0 states have call successors, (0), 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 90 [2022-09-16 11:06:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:34,407 INFO L225 Difference]: With dead ends: 68225 [2022-09-16 11:06:34,408 INFO L226 Difference]: Without dead ends: 68072 [2022-09-16 11:06:34,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=420, Invalid=1302, Unknown=0, NotChecked=0, Total=1722 [2022-09-16 11:06:34,408 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1763 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:34,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 1916 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:06:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68072 states. [2022-09-16 11:06:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68072 to 49690. [2022-09-16 11:06:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49690 states, 49397 states have (on average 3.992651375589611) internal successors, (197225), 49689 states have internal predecessors, (197225), 0 states have call successors, (0), 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 11:06:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49690 states to 49690 states and 197225 transitions. [2022-09-16 11:06:36,421 INFO L78 Accepts]: Start accepts. Automaton has 49690 states and 197225 transitions. Word has length 90 [2022-09-16 11:06:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:36,422 INFO L495 AbstractCegarLoop]: Abstraction has 49690 states and 197225 transitions. [2022-09-16 11:06:36,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.88) internal successors, (147), 25 states have internal predecessors, (147), 0 states have call successors, (0), 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 11:06:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 49690 states and 197225 transitions. [2022-09-16 11:06:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:36,424 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:36,424 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] [2022-09-16 11:06:36,449 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 11:06:36,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:36,628 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -495531133, now seen corresponding path program 2 times [2022-09-16 11:06:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:36,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650368156] [2022-09-16 11:06:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:36,702 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 11:06:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650368156] [2022-09-16 11:06:36,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650368156] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055415813] [2022-09-16 11:06:36,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:36,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:36,709 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 11:06:36,710 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 11:06:36,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:06:36,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:36,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-16 11:06:36,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:36,875 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 11:06:36,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:06:36,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055415813] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:36,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:06:36,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2022-09-16 11:06:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153594899] [2022-09-16 11:06:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:06:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:06:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:06:36,876 INFO L87 Difference]: Start difference. First operand 49690 states and 197225 transitions. Second operand has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:06:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:37,449 INFO L93 Difference]: Finished difference Result 45045 states and 177040 transitions. [2022-09-16 11:06:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:06:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-09-16 11:06:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:37,653 INFO L225 Difference]: With dead ends: 45045 [2022-09-16 11:06:37,654 INFO L226 Difference]: Without dead ends: 45045 [2022-09-16 11:06:37,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:06:37,654 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:37,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 133 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 11:06:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45045 states. [2022-09-16 11:06:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45045 to 45045. [2022-09-16 11:06:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45045 states, 44836 states have (on average 3.948612721919886) internal successors, (177040), 45044 states have internal predecessors, (177040), 0 states have call successors, (0), 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 11:06:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45045 states to 45045 states and 177040 transitions. [2022-09-16 11:06:39,242 INFO L78 Accepts]: Start accepts. Automaton has 45045 states and 177040 transitions. Word has length 90 [2022-09-16 11:06:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:39,242 INFO L495 AbstractCegarLoop]: Abstraction has 45045 states and 177040 transitions. [2022-09-16 11:06:39,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:06:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45045 states and 177040 transitions. [2022-09-16 11:06:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:39,244 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:39,249 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] [2022-09-16 11:06:39,271 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 11:06:39,459 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,SelfDestructingSolverStorable32 [2022-09-16 11:06:39,459 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash -495531132, now seen corresponding path program 1 times [2022-09-16 11:06:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476129125] [2022-09-16 11:06:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:39,544 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 11:06:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476129125] [2022-09-16 11:06:39,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476129125] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:39,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779421282] [2022-09-16 11:06:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:39,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:39,556 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 11:06:39,557 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 11:06:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:39,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:39,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:39,828 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 11:06:39,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:39,995 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 11:06:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779421282] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:39,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-09-16 11:06:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310600748] [2022-09-16 11:06:39,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:39,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-09-16 11:06:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:39,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-09-16 11:06:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-09-16 11:06:39,998 INFO L87 Difference]: Start difference. First operand 45045 states and 177040 transitions. Second operand has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 0 states have call successors, (0), 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 11:06:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:41,495 INFO L93 Difference]: Finished difference Result 61342 states and 234139 transitions. [2022-09-16 11:06:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 11:06:41,496 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 0 states have call successors, (0), 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 90 [2022-09-16 11:06:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:41,836 INFO L225 Difference]: With dead ends: 61342 [2022-09-16 11:06:41,836 INFO L226 Difference]: Without dead ends: 60829 [2022-09-16 11:06:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=445, Invalid=1447, Unknown=0, NotChecked=0, Total=1892 [2022-09-16 11:06:41,837 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 1622 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:41,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 2433 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:06:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60829 states. [2022-09-16 11:06:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60829 to 45045. [2022-09-16 11:06:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45045 states, 44836 states have (on average 3.9474752431082165) internal successors, (176989), 45044 states have internal predecessors, (176989), 0 states have call successors, (0), 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 11:06:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45045 states to 45045 states and 176989 transitions. [2022-09-16 11:06:43,569 INFO L78 Accepts]: Start accepts. Automaton has 45045 states and 176989 transitions. Word has length 90 [2022-09-16 11:06:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:43,569 INFO L495 AbstractCegarLoop]: Abstraction has 45045 states and 176989 transitions. [2022-09-16 11:06:43,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.8) internal successors, (145), 25 states have internal predecessors, (145), 0 states have call successors, (0), 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 11:06:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45045 states and 176989 transitions. [2022-09-16 11:06:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:43,571 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:43,571 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] [2022-09-16 11:06:43,589 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 11:06:43,788 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,SelfDestructingSolverStorable33 [2022-09-16 11:06:43,788 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1696919970, now seen corresponding path program 1 times [2022-09-16 11:06:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:43,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838175702] [2022-09-16 11:06:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:43,872 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 11:06:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:43,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838175702] [2022-09-16 11:06:43,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838175702] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:43,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437612584] [2022-09-16 11:06:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:43,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:43,873 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 11:06:43,876 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 11:06:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:44,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:06:44,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:44,165 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 11:06:44,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:44,318 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 11:06:44,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437612584] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:44,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:44,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-09-16 11:06:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97113409] [2022-09-16 11:06:44,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:44,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-16 11:06:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-16 11:06:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-09-16 11:06:44,320 INFO L87 Difference]: Start difference. First operand 45045 states and 176989 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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 11:06:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:45,632 INFO L93 Difference]: Finished difference Result 53254 states and 205047 transitions. [2022-09-16 11:06:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 11:06:45,632 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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 90 [2022-09-16 11:06:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:45,883 INFO L225 Difference]: With dead ends: 53254 [2022-09-16 11:06:45,883 INFO L226 Difference]: Without dead ends: 52948 [2022-09-16 11:06:45,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=503, Invalid=1477, Unknown=0, NotChecked=0, Total=1980 [2022-09-16 11:06:45,887 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 1057 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:45,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 2270 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:06:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52948 states. [2022-09-16 11:06:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52948 to 44892. [2022-09-16 11:06:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44892 states, 44683 states have (on average 3.9483024864042253) internal successors, (176422), 44891 states have internal predecessors, (176422), 0 states have call successors, (0), 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 11:06:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44892 states to 44892 states and 176422 transitions. [2022-09-16 11:06:47,736 INFO L78 Accepts]: Start accepts. Automaton has 44892 states and 176422 transitions. Word has length 90 [2022-09-16 11:06:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:47,737 INFO L495 AbstractCegarLoop]: Abstraction has 44892 states and 176422 transitions. [2022-09-16 11:06:47,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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 11:06:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44892 states and 176422 transitions. [2022-09-16 11:06:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:47,739 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:47,739 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] [2022-09-16 11:06:47,764 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 11:06:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-09-16 11:06:47,953 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1696887239, now seen corresponding path program 1 times [2022-09-16 11:06:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:47,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185024322] [2022-09-16 11:06:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:47,999 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 11:06:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:47,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185024322] [2022-09-16 11:06:47,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185024322] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:47,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:06:47,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 11:06:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658035838] [2022-09-16 11:06:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:48,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:06:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:06:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-16 11:06:48,001 INFO L87 Difference]: Start difference. First operand 44892 states and 176422 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:06:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:48,797 INFO L93 Difference]: Finished difference Result 42375 states and 166394 transitions. [2022-09-16 11:06:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 11:06:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-09-16 11:06:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:49,026 INFO L225 Difference]: With dead ends: 42375 [2022-09-16 11:06:49,026 INFO L226 Difference]: Without dead ends: 42375 [2022-09-16 11:06:49,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-09-16 11:06:49,027 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 167 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:49,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 578 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:06:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42375 states. [2022-09-16 11:06:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42375 to 42375. [2022-09-16 11:06:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42375 states, 42208 states have (on average 3.9422384382107656) internal successors, (166394), 42374 states have internal predecessors, (166394), 0 states have call successors, (0), 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 11:06:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42375 states to 42375 states and 166394 transitions. [2022-09-16 11:06:50,494 INFO L78 Accepts]: Start accepts. Automaton has 42375 states and 166394 transitions. Word has length 90 [2022-09-16 11:06:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:50,495 INFO L495 AbstractCegarLoop]: Abstraction has 42375 states and 166394 transitions. [2022-09-16 11:06:50,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:06:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 42375 states and 166394 transitions. [2022-09-16 11:06:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:50,497 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:50,498 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] [2022-09-16 11:06:50,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-09-16 11:06:50,498 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1718369490, now seen corresponding path program 2 times [2022-09-16 11:06:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:50,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665760256] [2022-09-16 11:06:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:50,591 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 11:06:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665760256] [2022-09-16 11:06:50,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665760256] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428748556] [2022-09-16 11:06:50,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:50,593 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 11:06:50,594 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 11:06:50,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:06:50,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:50,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-16 11:06:50,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:50,790 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 11:06:50,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:06:50,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428748556] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:06:50,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:06:50,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2022-09-16 11:06:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428157681] [2022-09-16 11:06:50,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:06:50,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:06:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:50,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:06:50,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:06:50,792 INFO L87 Difference]: Start difference. First operand 42375 states and 166394 transitions. Second operand has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:06:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:06:51,588 INFO L93 Difference]: Finished difference Result 38111 states and 147997 transitions. [2022-09-16 11:06:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:06:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-09-16 11:06:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:06:51,780 INFO L225 Difference]: With dead ends: 38111 [2022-09-16 11:06:51,780 INFO L226 Difference]: Without dead ends: 37805 [2022-09-16 11:06:51,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:06:51,781 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 124 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:06:51,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 132 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:06:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37805 states. [2022-09-16 11:06:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37805 to 33446. [2022-09-16 11:06:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33446 states, 33342 states have (on average 3.8672845060284327) internal successors, (128943), 33445 states have internal predecessors, (128943), 0 states have call successors, (0), 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 11:06:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33446 states to 33446 states and 128943 transitions. [2022-09-16 11:06:53,159 INFO L78 Accepts]: Start accepts. Automaton has 33446 states and 128943 transitions. Word has length 90 [2022-09-16 11:06:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:06:53,160 INFO L495 AbstractCegarLoop]: Abstraction has 33446 states and 128943 transitions. [2022-09-16 11:06:53,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:06:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 33446 states and 128943 transitions. [2022-09-16 11:06:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:06:53,162 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:06:53,163 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] [2022-09-16 11:06:53,191 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 11:06:53,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:53,369 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:06:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:06:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 983228524, now seen corresponding path program 2 times [2022-09-16 11:06:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:06:53,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147661294] [2022-09-16 11:06:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:06:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:06:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:06:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:54,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:06:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147661294] [2022-09-16 11:06:54,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147661294] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:06:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516066830] [2022-09-16 11:06:54,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:06:54,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:06:54,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:06:54,020 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 11:06:54,021 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 11:06:54,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:06:54,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:06:54,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 11:06:54,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:06:54,218 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 11:06:54,245 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:06:54,245 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 18 [2022-09-16 11:06:54,374 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:06:54,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 15 treesize of output 15 [2022-09-16 11:06:54,468 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 15 treesize of output 11 [2022-09-16 11:06:54,611 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:06:54,612 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:06:54,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:06:54,804 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 11:06:54,847 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 11:06:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:06:54,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:06:54,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:06:54,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:06:54,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:55,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:55,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:55,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 Int) (v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1072)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:06:55,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int)) (or (forall ((v_ArrVal_1072 Int) (v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (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~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1072)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88|)))) is different from false [2022-09-16 11:06:55,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (or (<= (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~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1072)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:06:55,104 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:06:55,105 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 11:06:55,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:06:55,112 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 11:06:55,114 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 11:06:55,118 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 11:06:55,535 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 11:06:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:06:55,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516066830] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:06:55,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:06:55,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 49 [2022-09-16 11:06:55,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003711309] [2022-09-16 11:06:55,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:06:55,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 11:06:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:06:55,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 11:06:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1563, Unknown=8, NotChecked=696, Total=2450 [2022-09-16 11:06:55,563 INFO L87 Difference]: Start difference. First operand 33446 states and 128943 transitions. Second operand has 50 states, 49 states have (on average 4.795918367346939) internal successors, (235), 50 states have internal predecessors, (235), 0 states have call successors, (0), 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 11:06:56,310 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |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|) (forall ((v_ArrVal_1072 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (or (<= (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~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1072)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |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|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 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 11:06:56,716 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_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_1072 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (or (<= (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~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1072)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (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 11:06:58,719 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 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int)) (or (forall ((v_ArrVal_1072 Int) (v_ArrVal_1075 (Array Int Int)) (v_ArrVal_1074 (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~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1072)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88|)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse0 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 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) (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 11:07:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:00,792 INFO L93 Difference]: Finished difference Result 84447 states and 323591 transitions. [2022-09-16 11:07:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 11:07:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 4.795918367346939) internal successors, (235), 50 states have internal predecessors, (235), 0 states have call successors, (0), 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 90 [2022-09-16 11:07:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:01,610 INFO L225 Difference]: With dead ends: 84447 [2022-09-16 11:07:01,610 INFO L226 Difference]: Without dead ends: 84447 [2022-09-16 11:07:01,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=423, Invalid=2916, Unknown=11, NotChecked=1342, Total=4692 [2022-09-16 11:07:01,611 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 895 mSDsluCounter, 3508 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1701 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:01,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 3409 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1265 Invalid, 0 Unknown, 1701 Unchecked, 0.7s Time] [2022-09-16 11:07:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84447 states. [2022-09-16 11:07:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84447 to 33932. [2022-09-16 11:07:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33932 states, 33828 states have (on average 3.8566572070474163) internal successors, (130463), 33931 states have internal predecessors, (130463), 0 states have call successors, (0), 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 11:07:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33932 states to 33932 states and 130463 transitions. [2022-09-16 11:07:03,767 INFO L78 Accepts]: Start accepts. Automaton has 33932 states and 130463 transitions. Word has length 90 [2022-09-16 11:07:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:03,767 INFO L495 AbstractCegarLoop]: Abstraction has 33932 states and 130463 transitions. [2022-09-16 11:07:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.795918367346939) internal successors, (235), 50 states have internal predecessors, (235), 0 states have call successors, (0), 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 11:07:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33932 states and 130463 transitions. [2022-09-16 11:07:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-09-16 11:07:03,770 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:03,770 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] [2022-09-16 11:07:03,798 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 11:07:03,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-09-16 11:07:03,995 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash 983228521, now seen corresponding path program 2 times [2022-09-16 11:07:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:03,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264382854] [2022-09-16 11:07:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:04,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264382854] [2022-09-16 11:07:04,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264382854] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258643264] [2022-09-16 11:07:04,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:04,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:04,298 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 11:07:04,299 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 11:07:04,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:04,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:04,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 11:07:04,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:04,650 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 11:07:04,781 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:07:04,782 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 11:07:04,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:04,966 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 11:07:05,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:05,008 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 11:07:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:05,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:05,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:05,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:05,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:05,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |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 11:07:05,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |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 11:07:05,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int 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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |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 11:07:05,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92|)) (forall ((v_ArrVal_1111 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int 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~3#1_92| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |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 11:07:05,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| Int) (v_ArrVal_1111 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (or (< 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~3#1_92| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:07:05,224 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:07:05,224 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 11:07:05,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:05,232 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 11:07:05,237 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 11:07:05,240 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 11:07:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:07:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258643264] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:05,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:05,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-09-16 11:07:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028919221] [2022-09-16 11:07:05,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:05,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-09-16 11:07:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-09-16 11:07:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1417, Unknown=8, NotChecked=664, Total=2256 [2022-09-16 11:07:05,541 INFO L87 Difference]: Start difference. First operand 33932 states and 130463 transitions. Second operand has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 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 11:07:06,200 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~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| Int) (v_ArrVal_1111 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (or (< 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~3#1_92| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (= 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|)))) is different from false [2022-09-16 11:07:06,594 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| Int) (v_ArrVal_1111 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (or (< 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~3#1_92| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (= 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|)))) is different from false [2022-09-16 11:07:08,597 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 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_92|)) (forall ((v_ArrVal_1111 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int 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~3#1_92| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1111)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1113) |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|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 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)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (= 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 11:07:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:10,682 INFO L93 Difference]: Finished difference Result 46532 states and 176813 transitions. [2022-09-16 11:07:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:07:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 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 90 [2022-09-16 11:07:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:10,934 INFO L225 Difference]: With dead ends: 46532 [2022-09-16 11:07:10,935 INFO L226 Difference]: Without dead ends: 46532 [2022-09-16 11:07:10,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=437, Invalid=2788, Unknown=11, NotChecked=1320, Total=4556 [2022-09-16 11:07:10,936 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 911 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2110 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:10,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 3053 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1408 Invalid, 0 Unknown, 2110 Unchecked, 0.7s Time] [2022-09-16 11:07:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46532 states. [2022-09-16 11:07:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46532 to 33932. [2022-09-16 11:07:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33932 states, 33828 states have (on average 3.850153718812818) internal successors, (130243), 33931 states have internal predecessors, (130243), 0 states have call successors, (0), 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 11:07:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33932 states to 33932 states and 130243 transitions. [2022-09-16 11:07:12,582 INFO L78 Accepts]: Start accepts. Automaton has 33932 states and 130243 transitions. Word has length 90 [2022-09-16 11:07:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:12,582 INFO L495 AbstractCegarLoop]: Abstraction has 33932 states and 130243 transitions. [2022-09-16 11:07:12,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.468085106382978) internal successors, (210), 48 states have internal predecessors, (210), 0 states have call successors, (0), 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 11:07:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 33932 states and 130243 transitions. [2022-09-16 11:07:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:12,585 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:12,585 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:12,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-09-16 11:07:12,806 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,SelfDestructingSolverStorable38 [2022-09-16 11:07:12,806 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash -760365874, now seen corresponding path program 2 times [2022-09-16 11:07:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752246941] [2022-09-16 11:07:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752246941] [2022-09-16 11:07:13,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752246941] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658374043] [2022-09-16 11:07:13,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:13,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:13,184 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 11:07:13,185 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 11:07:13,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:13,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:13,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:07:13,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:13,633 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 13 treesize of output 9 [2022-09-16 11:07:13,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:13,842 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 11:07:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:13,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:14,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1144) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:07:14,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4))))) is different from false [2022-09-16 11:07:14,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 11:07:14,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-09-16 11:07:14,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:14,106 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 26 treesize of output 27 [2022-09-16 11:07:14,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:14,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 42 treesize of output 38 [2022-09-16 11:07:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:07:14,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658374043] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:14,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:14,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 46 [2022-09-16 11:07:14,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463628361] [2022-09-16 11:07:14,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:14,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-09-16 11:07:14,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:14,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-09-16 11:07:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1652, Unknown=4, NotChecked=340, Total=2162 [2022-09-16 11:07:14,285 INFO L87 Difference]: Start difference. First operand 33932 states and 130243 transitions. Second operand has 47 states, 46 states have (on average 4.630434782608695) internal successors, (213), 47 states have internal predecessors, (213), 0 states have call successors, (0), 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 11:07:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:16,967 INFO L93 Difference]: Finished difference Result 50901 states and 190512 transitions. [2022-09-16 11:07:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 11:07:16,967 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.630434782608695) internal successors, (213), 47 states have internal predecessors, (213), 0 states have call successors, (0), 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 91 [2022-09-16 11:07:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:17,479 INFO L225 Difference]: With dead ends: 50901 [2022-09-16 11:07:17,479 INFO L226 Difference]: Without dead ends: 50901 [2022-09-16 11:07:17,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=583, Invalid=3851, Unknown=4, NotChecked=532, Total=4970 [2022-09-16 11:07:17,480 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1415 mSDsluCounter, 3997 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:17,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 3944 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1651 Invalid, 0 Unknown, 1153 Unchecked, 1.1s Time] [2022-09-16 11:07:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50901 states. [2022-09-16 11:07:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50901 to 33952. [2022-09-16 11:07:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33952 states, 33848 states have (on average 3.8496513826518552) internal successors, (130303), 33951 states have internal predecessors, (130303), 0 states have call successors, (0), 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 11:07:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33952 states to 33952 states and 130303 transitions. [2022-09-16 11:07:18,879 INFO L78 Accepts]: Start accepts. Automaton has 33952 states and 130303 transitions. Word has length 91 [2022-09-16 11:07:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:18,880 INFO L495 AbstractCegarLoop]: Abstraction has 33952 states and 130303 transitions. [2022-09-16 11:07:18,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.630434782608695) internal successors, (213), 47 states have internal predecessors, (213), 0 states have call successors, (0), 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 11:07:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 33952 states and 130303 transitions. [2022-09-16 11:07:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:18,883 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:18,883 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:18,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-09-16 11:07:19,089 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,SelfDestructingSolverStorable39 [2022-09-16 11:07:19,089 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -760365871, now seen corresponding path program 1 times [2022-09-16 11:07:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:19,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650573105] [2022-09-16 11:07:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:19,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650573105] [2022-09-16 11:07:19,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650573105] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:19,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70055151] [2022-09-16 11:07:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:19,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:19,416 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 11:07:19,418 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 11:07:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:19,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-09-16 11:07:19,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:19,773 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 13 treesize of output 9 [2022-09-16 11:07:19,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:19,885 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 11:07:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:19,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:20,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1175) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:07:20,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1175) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:07:20,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1175) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:07:20,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967295)) is different from false [2022-09-16 11:07:20,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:20,138 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 11:07:20,143 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:20,143 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 34 [2022-09-16 11:07:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:07:20,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70055151] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:20,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:20,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 46 [2022-09-16 11:07:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350437849] [2022-09-16 11:07:20,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-09-16 11:07:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-09-16 11:07:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1649, Unknown=4, NotChecked=340, Total=2162 [2022-09-16 11:07:20,625 INFO L87 Difference]: Start difference. First operand 33952 states and 130303 transitions. Second operand has 47 states, 46 states have (on average 4.630434782608695) internal successors, (213), 47 states have internal predecessors, (213), 0 states have call successors, (0), 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 11:07:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:23,152 INFO L93 Difference]: Finished difference Result 50896 states and 190502 transitions. [2022-09-16 11:07:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 11:07:23,152 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.630434782608695) internal successors, (213), 47 states have internal predecessors, (213), 0 states have call successors, (0), 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 91 [2022-09-16 11:07:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:23,433 INFO L225 Difference]: With dead ends: 50896 [2022-09-16 11:07:23,433 INFO L226 Difference]: Without dead ends: 50896 [2022-09-16 11:07:23,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=560, Invalid=3742, Unknown=4, NotChecked=524, Total=4830 [2022-09-16 11:07:23,434 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 1332 mSDsluCounter, 3873 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1065 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:23,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 3816 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1645 Invalid, 0 Unknown, 1065 Unchecked, 0.7s Time] [2022-09-16 11:07:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50896 states. [2022-09-16 11:07:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50896 to 33952. [2022-09-16 11:07:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33952 states, 33848 states have (on average 3.84950366343654) internal successors, (130298), 33951 states have internal predecessors, (130298), 0 states have call successors, (0), 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 11:07:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33952 states to 33952 states and 130298 transitions. [2022-09-16 11:07:24,690 INFO L78 Accepts]: Start accepts. Automaton has 33952 states and 130298 transitions. Word has length 91 [2022-09-16 11:07:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:24,690 INFO L495 AbstractCegarLoop]: Abstraction has 33952 states and 130298 transitions. [2022-09-16 11:07:24,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.630434782608695) internal successors, (213), 47 states have internal predecessors, (213), 0 states have call successors, (0), 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 11:07:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33952 states and 130298 transitions. [2022-09-16 11:07:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:24,693 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:24,693 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:24,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:24,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:24,918 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash -760365870, now seen corresponding path program 1 times [2022-09-16 11:07:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:24,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316731316] [2022-09-16 11:07:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:25,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:25,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316731316] [2022-09-16 11:07:25,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316731316] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:25,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570361467] [2022-09-16 11:07:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:25,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:25,036 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:25,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-09-16 11:07:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:25,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-16 11:07:25,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:25,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:07:25,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570361467] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:25,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:07:25,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-09-16 11:07:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504895786] [2022-09-16 11:07:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:25,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:07:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:07:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 11:07:25,776 INFO L87 Difference]: Start difference. First operand 33952 states and 130298 transitions. Second operand has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 11:07:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:26,498 INFO L93 Difference]: Finished difference Result 56421 states and 218699 transitions. [2022-09-16 11:07:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:07:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 91 [2022-09-16 11:07:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:26,857 INFO L225 Difference]: With dead ends: 56421 [2022-09-16 11:07:26,857 INFO L226 Difference]: Without dead ends: 56421 [2022-09-16 11:07:26,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 11:07:26,858 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 37 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:26,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-09-16 11:07:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56421 states. [2022-09-16 11:07:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56421 to 45712. [2022-09-16 11:07:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45712 states, 45608 states have (on average 3.99335642869672) internal successors, (182129), 45711 states have internal predecessors, (182129), 0 states have call successors, (0), 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 11:07:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45712 states to 45712 states and 182129 transitions. [2022-09-16 11:07:29,015 INFO L78 Accepts]: Start accepts. Automaton has 45712 states and 182129 transitions. Word has length 91 [2022-09-16 11:07:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:29,015 INFO L495 AbstractCegarLoop]: Abstraction has 45712 states and 182129 transitions. [2022-09-16 11:07:29,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 11:07:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 45712 states and 182129 transitions. [2022-09-16 11:07:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 11:07:29,019 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:29,019 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:29,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:29,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-09-16 11:07:29,231 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash -760365869, now seen corresponding path program 1 times [2022-09-16 11:07:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:29,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950504784] [2022-09-16 11:07:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:29,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:29,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950504784] [2022-09-16 11:07:29,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950504784] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:29,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:07:29,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 11:07:29,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738896469] [2022-09-16 11:07:29,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:29,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:07:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:07:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:07:29,286 INFO L87 Difference]: Start difference. First operand 45712 states and 182129 transitions. Second operand has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 11:07:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:29,671 INFO L93 Difference]: Finished difference Result 44525 states and 176444 transitions. [2022-09-16 11:07:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:07:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 91 [2022-09-16 11:07:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:30,307 INFO L225 Difference]: With dead ends: 44525 [2022-09-16 11:07:30,307 INFO L226 Difference]: Without dead ends: 44525 [2022-09-16 11:07:30,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:07:30,311 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 120 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:30,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 131 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 11:07:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44525 states. [2022-09-16 11:07:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44525 to 44525. [2022-09-16 11:07:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44525 states, 44436 states have (on average 3.970744441443874) internal successors, (176444), 44524 states have internal predecessors, (176444), 0 states have call successors, (0), 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 11:07:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44525 states to 44525 states and 176444 transitions. [2022-09-16 11:07:31,870 INFO L78 Accepts]: Start accepts. Automaton has 44525 states and 176444 transitions. Word has length 91 [2022-09-16 11:07:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:31,870 INFO L495 AbstractCegarLoop]: Abstraction has 44525 states and 176444 transitions. [2022-09-16 11:07:31,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 11:07:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 44525 states and 176444 transitions. [2022-09-16 11:07:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-09-16 11:07:31,876 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:31,876 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:31,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-09-16 11:07:31,876 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:31,877 INFO L85 PathProgramCache]: Analyzing trace with hash -567132139, now seen corresponding path program 1 times [2022-09-16 11:07:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:31,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670982905] [2022-09-16 11:07:31,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670982905] [2022-09-16 11:07:31,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670982905] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093443927] [2022-09-16 11:07:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:31,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:31,928 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:31,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-09-16 11:07:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:32,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:07:32,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:32,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:32,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093443927] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:32,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:32,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 11:07:32,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384819062] [2022-09-16 11:07:32,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:32,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:07:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:07:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:07:32,183 INFO L87 Difference]: Start difference. First operand 44525 states and 176444 transitions. Second operand has 12 states, 11 states have (on average 9.363636363636363) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 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 11:07:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:34,433 INFO L93 Difference]: Finished difference Result 131548 states and 514900 transitions. [2022-09-16 11:07:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:07:34,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.363636363636363) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 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 93 [2022-09-16 11:07:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:35,314 INFO L225 Difference]: With dead ends: 131548 [2022-09-16 11:07:35,315 INFO L226 Difference]: Without dead ends: 131548 [2022-09-16 11:07:35,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 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 11:07:35,315 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 1824 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:35,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 996 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-09-16 11:07:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131548 states. [2022-09-16 11:07:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131548 to 91785. [2022-09-16 11:07:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91785 states, 91696 states have (on average 4.20332402722038) internal successors, (385428), 91784 states have internal predecessors, (385428), 0 states have call successors, (0), 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 11:07:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91785 states to 91785 states and 385428 transitions. [2022-09-16 11:07:40,386 INFO L78 Accepts]: Start accepts. Automaton has 91785 states and 385428 transitions. Word has length 93 [2022-09-16 11:07:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:40,387 INFO L495 AbstractCegarLoop]: Abstraction has 91785 states and 385428 transitions. [2022-09-16 11:07:40,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.363636363636363) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 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 11:07:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91785 states and 385428 transitions. [2022-09-16 11:07:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-09-16 11:07:40,394 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:40,394 INFO L195 NwaCegarLoop]: trace histogram [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 11:07:40,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:40,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:40,611 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1959606563, now seen corresponding path program 1 times [2022-09-16 11:07:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:40,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589099719] [2022-09-16 11:07:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589099719] [2022-09-16 11:07:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589099719] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442320886] [2022-09-16 11:07:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:40,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:40,851 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:40,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-09-16 11:07:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:41,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 11:07:41,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:41,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:42,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442320886] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:42,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:42,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-09-16 11:07:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408410919] [2022-09-16 11:07:42,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:42,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-16 11:07:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-16 11:07:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2022-09-16 11:07:42,070 INFO L87 Difference]: Start difference. First operand 91785 states and 385428 transitions. Second operand has 34 states, 34 states have (on average 6.235294117647059) internal successors, (212), 34 states have internal predecessors, (212), 0 states have call successors, (0), 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 11:07:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:44,145 INFO L93 Difference]: Finished difference Result 90372 states and 379260 transitions. [2022-09-16 11:07:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:07:44,146 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.235294117647059) internal successors, (212), 34 states have internal predecessors, (212), 0 states have call successors, (0), 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 94 [2022-09-16 11:07:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:44,843 INFO L225 Difference]: With dead ends: 90372 [2022-09-16 11:07:44,843 INFO L226 Difference]: Without dead ends: 84747 [2022-09-16 11:07:44,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2022-09-16 11:07:44,844 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1207 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:44,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 2225 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:07:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84747 states. [2022-09-16 11:07:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84747 to 84747. [2022-09-16 11:07:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84747 states, 84658 states have (on average 4.247856079756196) internal successors, (359615), 84746 states have internal predecessors, (359615), 0 states have call successors, (0), 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 11:07:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84747 states to 84747 states and 359615 transitions. [2022-09-16 11:07:49,006 INFO L78 Accepts]: Start accepts. Automaton has 84747 states and 359615 transitions. Word has length 94 [2022-09-16 11:07:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:49,007 INFO L495 AbstractCegarLoop]: Abstraction has 84747 states and 359615 transitions. [2022-09-16 11:07:49,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.235294117647059) internal successors, (212), 34 states have internal predecessors, (212), 0 states have call successors, (0), 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 11:07:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 84747 states and 359615 transitions. [2022-09-16 11:07:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-09-16 11:07:49,008 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:49,008 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:07:49,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:49,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-09-16 11:07:49,236 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -401226257, now seen corresponding path program 1 times [2022-09-16 11:07:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187907858] [2022-09-16 11:07:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187907858] [2022-09-16 11:07:49,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187907858] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166310038] [2022-09-16 11:07:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:49,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:49,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:49,286 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:49,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-09-16 11:07:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:49,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:07:49,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:07:49,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:07:49,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166310038] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:07:49,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:07:49,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 11:07:49,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117756096] [2022-09-16 11:07:49,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:07:49,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:07:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:07:49,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 11:07:49,579 INFO L87 Difference]: Start difference. First operand 84747 states and 359615 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:07:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:07:51,023 INFO L93 Difference]: Finished difference Result 89916 states and 369669 transitions. [2022-09-16 11:07:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 11:07:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-09-16 11:07:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:07:51,707 INFO L225 Difference]: With dead ends: 89916 [2022-09-16 11:07:51,708 INFO L226 Difference]: Without dead ends: 89916 [2022-09-16 11:07:51,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 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 11:07:51,708 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 251 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:07:51,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 702 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 11:07:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89916 states. [2022-09-16 11:07:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89916 to 83560. [2022-09-16 11:07:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83560 states, 83486 states have (on average 4.182821071796469) internal successors, (349207), 83559 states have internal predecessors, (349207), 0 states have call successors, (0), 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 11:07:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83560 states to 83560 states and 349207 transitions. [2022-09-16 11:07:55,480 INFO L78 Accepts]: Start accepts. Automaton has 83560 states and 349207 transitions. Word has length 94 [2022-09-16 11:07:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:07:55,480 INFO L495 AbstractCegarLoop]: Abstraction has 83560 states and 349207 transitions. [2022-09-16 11:07:55,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:07:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 83560 states and 349207 transitions. [2022-09-16 11:07:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:07:55,482 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:07:55,482 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] [2022-09-16 11:07:55,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-09-16 11:07:55,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:55,696 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:07:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:07:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash 815653777, now seen corresponding path program 2 times [2022-09-16 11:07:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:07:55,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060535571] [2022-09-16 11:07:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:07:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:07:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:07:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:07:56,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060535571] [2022-09-16 11:07:56,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060535571] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:07:56,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605367105] [2022-09-16 11:07:56,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:07:56,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:07:56,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:07:56,045 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:07:56,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-09-16 11:07:56,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:07:56,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:07:56,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:07:56,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:07:56,233 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 11:07:56,342 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:07:56,342 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 11:07:56,444 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 15 treesize of output 11 [2022-09-16 11:07:56,579 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:07:56,579 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 11:07:56,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:56,786 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 11:07:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:07:56,872 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 11:07:56,918 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 11:07:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:07:56,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:07:56,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:07:56,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:07:56,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:56,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:07:57,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:07:57,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |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 11:07:57,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |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 11:07:57,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 Int)) (< 0 (+ (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1346)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |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 11:07:57,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107|)) (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 Int)) (< 0 (+ (select (select (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~3#1_107| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1346)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |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 11:07:57,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_107| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1346)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |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 11:07:57,094 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:07:57,095 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 37 treesize of output 43 [2022-09-16 11:07:57,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:07:57,103 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 1106 treesize of output 1076 [2022-09-16 11:07:57,109 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 1062 treesize of output 1030 [2022-09-16 11:07:57,115 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 1030 treesize of output 966 [2022-09-16 11:07:57,124 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 491 treesize of output 475 [2022-09-16 11:07:58,008 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 11:07:58,010 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 11:07:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:07:58,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605367105] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:07:58,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:07:58,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-09-16 11:07:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906553801] [2022-09-16 11:07:58,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:07:58,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:07:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:07:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:07:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1732, Unknown=10, NotChecked=930, Total=2862 [2022-09-16 11:07:58,052 INFO L87 Difference]: Start difference. First operand 83560 states and 349207 transitions. Second operand has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:07:58,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (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~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_107| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1346)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (<= .cse1 |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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 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|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-09-16 11:07:59,219 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_107| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1346)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (<= .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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 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|)))) is different from false [2022-09-16 11:08:01,222 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 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)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_107|)) (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 Int)) (< 0 (+ (select (select (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~3#1_107| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1346)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1349) |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_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:08:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:03,226 INFO L93 Difference]: Finished difference Result 86873 states and 357611 transitions. [2022-09-16 11:08:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:08:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:03,733 INFO L225 Difference]: With dead ends: 86873 [2022-09-16 11:08:03,734 INFO L226 Difference]: Without dead ends: 86873 [2022-09-16 11:08:03,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 159 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 13 IntricatePredicates, 2 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=377, Invalid=3201, Unknown=14, NotChecked=1664, Total=5256 [2022-09-16 11:08:03,734 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 330 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1942 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:03,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 3672 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1083 Invalid, 0 Unknown, 1942 Unchecked, 0.4s Time] [2022-09-16 11:08:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86873 states. [2022-09-16 11:08:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86873 to 83560. [2022-09-16 11:08:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83560 states, 83486 states have (on average 4.1701243322233665) internal successors, (348147), 83559 states have internal predecessors, (348147), 0 states have call successors, (0), 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 11:08:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83560 states to 83560 states and 348147 transitions. [2022-09-16 11:08:07,466 INFO L78 Accepts]: Start accepts. Automaton has 83560 states and 348147 transitions. Word has length 95 [2022-09-16 11:08:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:08:07,466 INFO L495 AbstractCegarLoop]: Abstraction has 83560 states and 348147 transitions. [2022-09-16 11:08:07,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 83560 states and 348147 transitions. [2022-09-16 11:08:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:08:07,468 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:08:07,468 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] [2022-09-16 11:08:07,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-09-16 11:08:07,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-09-16 11:08:07,669 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:08:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:08:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash 815653780, now seen corresponding path program 2 times [2022-09-16 11:08:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:08:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780280266] [2022-09-16 11:08:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:08:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:08,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:08:08,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780280266] [2022-09-16 11:08:08,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780280266] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:08:08,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416924523] [2022-09-16 11:08:08,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:08:08,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:08:08,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:08:08,051 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:08:08,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-09-16 11:08:08,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:08:08,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:08:08,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjunts are in the unsatisfiable core [2022-09-16 11:08:08,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:08:08,503 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 11:08:08,643 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:08:08,644 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 11:08:08,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:08,847 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 11:08:08,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:08,935 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 11:08:08,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:08,983 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 11:08:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:09,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:08:09,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:08:09,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:08:09,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:08:09,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:08:09,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:09,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:09,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:09,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1389 Int) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:09,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111|)) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1389 Int) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (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~3#1_111| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) is different from false [2022-09-16 11:08:09,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| Int) (v_ArrVal_1389 Int) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (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~3#1_111| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) is different from false [2022-09-16 11:08:09,154 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:08:09,155 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 11:08:09,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:08:09,162 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 490 treesize of output 476 [2022-09-16 11:08:09,166 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 462 treesize of output 430 [2022-09-16 11:08:09,171 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 430 treesize of output 422 [2022-09-16 11:08:09,176 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 422 treesize of output 406 [2022-09-16 11:08:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:08:09,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416924523] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:09,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:09,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-09-16 11:08:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403935518] [2022-09-16 11:08:09,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:09,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:08:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:08:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1734, Unknown=10, NotChecked=930, Total=2862 [2022-09-16 11:08:09,961 INFO L87 Difference]: Start difference. First operand 83560 states and 348147 transitions. Second operand has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:10,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| Int) (v_ArrVal_1389 Int) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (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~3#1_111| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (<= .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|)))) is different from false [2022-09-16 11:08:10,828 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| Int) (v_ArrVal_1389 Int) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (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~3#1_111| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |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|)))) is different from false [2022-09-16 11:08:12,831 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 (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_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_111|)) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1389 Int) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (<= (select (select (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~3#1_111| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1389)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) (= 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 11:08:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:15,249 INFO L93 Difference]: Finished difference Result 87796 states and 361431 transitions. [2022-09-16 11:08:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:08:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:16,324 INFO L225 Difference]: With dead ends: 87796 [2022-09-16 11:08:16,324 INFO L226 Difference]: Without dead ends: 87796 [2022-09-16 11:08:16,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=437, Invalid=3024, Unknown=13, NotChecked=1638, Total=5112 [2022-09-16 11:08:16,326 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 1154 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1777 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:16,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 2106 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 864 Invalid, 0 Unknown, 1777 Unchecked, 0.5s Time] [2022-09-16 11:08:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87796 states. [2022-09-16 11:08:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87796 to 83560. [2022-09-16 11:08:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83560 states, 83486 states have (on average 4.157427592650265) internal successors, (347087), 83559 states have internal predecessors, (347087), 0 states have call successors, (0), 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 11:08:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83560 states to 83560 states and 347087 transitions. [2022-09-16 11:08:19,814 INFO L78 Accepts]: Start accepts. Automaton has 83560 states and 347087 transitions. Word has length 95 [2022-09-16 11:08:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:08:19,814 INFO L495 AbstractCegarLoop]: Abstraction has 83560 states and 347087 transitions. [2022-09-16 11:08:19,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 83560 states and 347087 transitions. [2022-09-16 11:08:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:08:19,816 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:08:19,818 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] [2022-09-16 11:08:19,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-09-16 11:08:20,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-09-16 11:08:20,024 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:08:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:08:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1990558850, now seen corresponding path program 2 times [2022-09-16 11:08:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:08:20,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283254726] [2022-09-16 11:08:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:08:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:20,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:08:20,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283254726] [2022-09-16 11:08:20,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283254726] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:08:20,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816273016] [2022-09-16 11:08:20,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:08:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:08:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:08:20,412 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:08:20,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-09-16 11:08:20,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:08:20,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:08:20,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 11:08:20,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:08:20,614 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 11:08:20,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:08:20,709 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 11:08:20,819 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 15 treesize of output 11 [2022-09-16 11:08:20,944 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:08:20,945 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:08:21,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:21,534 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 11:08:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:21,573 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 11:08:21,629 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 11:08:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:21,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:08:21,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:08:21,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:08:21,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:08:21,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:08:21,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:21,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:21,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:21,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 Int)) (<= (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:08:21,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 Int)) (<= (select (select (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~3#1_115| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) is different from false [2022-09-16 11:08:21,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 Int)) (or (<= (select (select (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~3#1_115| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:08:21,785 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:08:21,786 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 11:08:21,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:08:21,791 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 11:08:21,795 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 11:08:21,797 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 11:08:21,800 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 11:08:22,174 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 11:08:22,184 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 11:08:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:08:22,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816273016] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:22,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:22,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2022-09-16 11:08:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338703634] [2022-09-16 11:08:22,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:22,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-09-16 11:08:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-09-16 11:08:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1653, Unknown=10, NotChecked=910, Total=2756 [2022-09-16 11:08:22,239 INFO L87 Difference]: Start difference. First operand 83560 states and 347087 transitions. Second operand has 53 states, 52 states have (on average 4.326923076923077) internal successors, (225), 53 states have internal predecessors, (225), 0 states have call successors, (0), 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 11:08:22,962 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 Int)) (or (<= (select (select (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~3#1_115| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (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 11:08:23,355 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |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|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 Int)) (or (<= (select (select (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~3#1_115| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (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 11:08:25,358 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_115|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1433 Int)) (<= (select (select (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~3#1_115| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)))) (<= .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 11:08:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:28,067 INFO L93 Difference]: Finished difference Result 153772 states and 641242 transitions. [2022-09-16 11:08:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:08:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.326923076923077) internal successors, (225), 53 states have internal predecessors, (225), 0 states have call successors, (0), 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 11:08:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:29,748 INFO L225 Difference]: With dead ends: 153772 [2022-09-16 11:08:29,749 INFO L226 Difference]: Without dead ends: 153772 [2022-09-16 11:08:29,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 160 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=324, Invalid=2685, Unknown=13, NotChecked=1534, Total=4556 [2022-09-16 11:08:29,749 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 679 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1619 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:29,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 3203 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 966 Invalid, 0 Unknown, 1619 Unchecked, 0.5s Time] [2022-09-16 11:08:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153772 states. [2022-09-16 11:08:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153772 to 94992. [2022-09-16 11:08:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94992 states, 94918 states have (on average 4.226806295960724) internal successors, (401200), 94991 states have internal predecessors, (401200), 0 states have call successors, (0), 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 11:08:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94992 states to 94992 states and 401200 transitions. [2022-09-16 11:08:35,112 INFO L78 Accepts]: Start accepts. Automaton has 94992 states and 401200 transitions. Word has length 95 [2022-09-16 11:08:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:08:35,112 INFO L495 AbstractCegarLoop]: Abstraction has 94992 states and 401200 transitions. [2022-09-16 11:08:35,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.326923076923077) internal successors, (225), 53 states have internal predecessors, (225), 0 states have call successors, (0), 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 11:08:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 94992 states and 401200 transitions. [2022-09-16 11:08:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-09-16 11:08:35,114 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:08:35,115 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] [2022-09-16 11:08:35,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-09-16 11:08:35,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-09-16 11:08:35,328 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:08:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:08:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1990558847, now seen corresponding path program 2 times [2022-09-16 11:08:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:08:35,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835954128] [2022-09-16 11:08:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:35,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:08:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:08:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835954128] [2022-09-16 11:08:35,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835954128] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:08:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088401487] [2022-09-16 11:08:35,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:08:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:08:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:08:35,669 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:08:35,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-09-16 11:08:35,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:08:35,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:08:35,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:08:35,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:08:35,921 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 11:08:36,049 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:08:36,049 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 11:08:36,601 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 15 treesize of output 11 [2022-09-16 11:08:36,791 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:08:36,792 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 11:08:36,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:36,973 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 11:08:37,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:37,013 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 11:08:37,074 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 11:08:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:37,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:08:37,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:08:37,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:08:37,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:08:37,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-09-16 11:08:37,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 9223372039002259456))) is different from false [2022-09-16 11:08:37,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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 11:08:37,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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 11:08:37,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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 11:08:37,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119|)) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (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~3#1_119| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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 11:08:37,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| Int) (v_ArrVal_1480 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_119| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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 11:08:37,295 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:08:37,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 2 case distinctions, treesize of input 37 treesize of output 43 [2022-09-16 11:08:37,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:08:37,303 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 11:08:37,306 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 11:08:37,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 121 treesize of output 117 [2022-09-16 11:08:37,315 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 11:08:37,792 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 11:08:37,795 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 11:08:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:08:37,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088401487] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:37,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:37,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2022-09-16 11:08:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865999376] [2022-09-16 11:08:37,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:37,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:08:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:37,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:08:37,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1732, Unknown=10, NotChecked=930, Total=2862 [2022-09-16 11:08:37,841 INFO L87 Difference]: Start difference. First operand 94992 states and 401200 transitions. Second operand has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:38,598 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| Int) (v_ArrVal_1480 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_119| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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|)) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 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|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-09-16 11:08:39,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| Int) (v_ArrVal_1480 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_119| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 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|)))) is different from false [2022-09-16 11:08:41,012 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 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_119|)) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1480 (Array Int Int))) (< 0 (+ (select (select (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~3#1_119| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1477)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1480) |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|)) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 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)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 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 11:08:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:44,218 INFO L93 Difference]: Finished difference Result 167978 states and 699323 transitions. [2022-09-16 11:08:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 11:08:44,219 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:45,554 INFO L225 Difference]: With dead ends: 167978 [2022-09-16 11:08:45,555 INFO L226 Difference]: Without dead ends: 167978 [2022-09-16 11:08:45,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 159 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 13 IntricatePredicates, 2 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=364, Invalid=3097, Unknown=13, NotChecked=1638, Total=5112 [2022-09-16 11:08:45,555 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 693 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3038 SdHoareTripleChecker+Invalid, 3116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2112 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:45,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 3038 Invalid, 3116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 985 Invalid, 0 Unknown, 2112 Unchecked, 0.5s Time] [2022-09-16 11:08:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167978 states. [2022-09-16 11:08:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167978 to 98582. [2022-09-16 11:08:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98582 states, 98508 states have (on average 4.220459252040444) internal successors, (415749), 98581 states have internal predecessors, (415749), 0 states have call successors, (0), 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 11:08:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98582 states to 98582 states and 415749 transitions. [2022-09-16 11:08:51,969 INFO L78 Accepts]: Start accepts. Automaton has 98582 states and 415749 transitions. Word has length 95 [2022-09-16 11:08:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:08:51,969 INFO L495 AbstractCegarLoop]: Abstraction has 98582 states and 415749 transitions. [2022-09-16 11:08:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.69811320754717) internal successors, (249), 54 states have internal predecessors, (249), 0 states have call successors, (0), 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 11:08:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 98582 states and 415749 transitions. [2022-09-16 11:08:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 11:08:51,971 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:08:51,972 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:08:51,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-09-16 11:08:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-09-16 11:08:52,191 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:08:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:08:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 805946382, now seen corresponding path program 1 times [2022-09-16 11:08:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:08:52,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436046425] [2022-09-16 11:08:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:08:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:52,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:08:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436046425] [2022-09-16 11:08:52,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436046425] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:08:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061529254] [2022-09-16 11:08:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:08:52,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:08:52,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:08:52,602 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:08:52,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-09-16 11:08:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:08:52,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 45 conjunts are in the unsatisfiable core [2022-09-16 11:08:52,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:08:52,828 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 11:08:52,854 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:08:52,854 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 18 [2022-09-16 11:08:52,982 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:08:52,982 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 15 treesize of output 15 [2022-09-16 11:08:53,165 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 13 treesize of output 9 [2022-09-16 11:08:53,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:08:53,367 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 18 treesize of output 20 [2022-09-16 11:08:53,539 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 11:08:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:08:53,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:08:53,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) c_~A~0.base) (+ (* 4 |c_thread1Thread1of1ForFork1_#t~post1#1|) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1518) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-09-16 11:08:53,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:08:53,688 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 29 treesize of output 30 [2022-09-16 11:08:53,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:08:53,692 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 80 treesize of output 76 [2022-09-16 11:08:53,695 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 62 treesize of output 54 [2022-09-16 11:08:53,697 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 28 treesize of output 24 [2022-09-16 11:08:54,434 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 11:08:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-09-16 11:08:54,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061529254] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:08:54,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:08:54,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-09-16 11:08:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770795189] [2022-09-16 11:08:54,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:08:54,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:08:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:08:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:08:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1907, Unknown=8, NotChecked=760, Total=2862 [2022-09-16 11:08:54,462 INFO L87 Difference]: Start difference. First operand 98582 states and 415749 transitions. Second operand has 54 states, 53 states have (on average 4.773584905660377) internal successors, (253), 54 states have internal predecessors, (253), 0 states have call successors, (0), 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 11:08:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:08:58,055 INFO L93 Difference]: Finished difference Result 134189 states and 546825 transitions. [2022-09-16 11:08:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-16 11:08:58,056 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.773584905660377) internal successors, (253), 54 states have internal predecessors, (253), 0 states have call successors, (0), 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 11:08:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:08:59,047 INFO L225 Difference]: With dead ends: 134189 [2022-09-16 11:08:59,047 INFO L226 Difference]: Without dead ends: 134189 [2022-09-16 11:08:59,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=506, Invalid=3940, Unknown=8, NotChecked=1096, Total=5550 [2022-09-16 11:08:59,055 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 749 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2074 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:08:59,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 3928 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1537 Invalid, 0 Unknown, 2074 Unchecked, 0.7s Time] [2022-09-16 11:08:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134189 states. [2022-09-16 11:09:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134189 to 100027. [2022-09-16 11:09:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100027 states, 99953 states have (on average 4.207547547347253) internal successors, (420557), 100026 states have internal predecessors, (420557), 0 states have call successors, (0), 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 11:09:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100027 states to 100027 states and 420557 transitions. [2022-09-16 11:09:04,696 INFO L78 Accepts]: Start accepts. Automaton has 100027 states and 420557 transitions. Word has length 96 [2022-09-16 11:09:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:09:04,696 INFO L495 AbstractCegarLoop]: Abstraction has 100027 states and 420557 transitions. [2022-09-16 11:09:04,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.773584905660377) internal successors, (253), 54 states have internal predecessors, (253), 0 states have call successors, (0), 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 11:09:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 100027 states and 420557 transitions. [2022-09-16 11:09:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 11:09:04,699 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:09:04,699 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:09:04,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-09-16 11:09:04,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:04,920 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:09:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:09:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash 805946385, now seen corresponding path program 1 times [2022-09-16 11:09:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:09:04,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282938920] [2022-09-16 11:09:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:09:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:09:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:09:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:09:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282938920] [2022-09-16 11:09:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282938920] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:09:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020059806] [2022-09-16 11:09:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:09:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:09:05,406 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:09:05,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-09-16 11:09:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:09:05,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-09-16 11:09:05,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:09:05,881 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 13 treesize of output 9 [2022-09-16 11:09:06,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:06,059 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 11:09:06,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:06,220 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 11:09:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:06,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:09:06,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:09:06,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) c_~A~0.base) (+ (* 4 |c_thread1Thread1of1ForFork1_#t~post1#1|) c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:09:06,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:09:06,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:09:06,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:09:06,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:09:06,347 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:09:06,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1554) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967295)) is different from false [2022-09-16 11:09:06,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:09:06,391 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 11:09:06,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:09:06,398 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 68 [2022-09-16 11:09:06,401 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 54 treesize of output 46 [2022-09-16 11:09:06,406 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 24 treesize of output 20 [2022-09-16 11:09:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-09-16 11:09:06,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020059806] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:09:06,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:09:06,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-09-16 11:09:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45651947] [2022-09-16 11:09:06,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:09:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-09-16 11:09:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:09:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-09-16 11:09:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1749, Unknown=8, NotChecked=728, Total=2652 [2022-09-16 11:09:06,854 INFO L87 Difference]: Start difference. First operand 100027 states and 420557 transitions. Second operand has 52 states, 51 states have (on average 4.470588235294118) internal successors, (228), 52 states have internal predecessors, (228), 0 states have call successors, (0), 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 11:09:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:09:11,443 INFO L93 Difference]: Finished difference Result 133879 states and 545783 transitions. [2022-09-16 11:09:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 11:09:11,452 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 4.470588235294118) internal successors, (228), 52 states have internal predecessors, (228), 0 states have call successors, (0), 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 11:09:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:09:12,427 INFO L225 Difference]: With dead ends: 133879 [2022-09-16 11:09:12,427 INFO L226 Difference]: Without dead ends: 133879 [2022-09-16 11:09:12,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 157 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=579, Invalid=3735, Unknown=8, NotChecked=1080, Total=5402 [2022-09-16 11:09:12,428 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 1476 mSDsluCounter, 5452 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 5362 SdHoareTripleChecker+Invalid, 4351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2077 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 11:09:12,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 5362 Invalid, 4351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2212 Invalid, 0 Unknown, 2077 Unchecked, 0.9s Time] [2022-09-16 11:09:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133879 states. [2022-09-16 11:09:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133879 to 100027. [2022-09-16 11:09:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100027 states, 99953 states have (on average 4.205476573989775) internal successors, (420350), 100026 states have internal predecessors, (420350), 0 states have call successors, (0), 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 11:09:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100027 states to 100027 states and 420350 transitions. [2022-09-16 11:09:17,415 INFO L78 Accepts]: Start accepts. Automaton has 100027 states and 420350 transitions. Word has length 96 [2022-09-16 11:09:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:09:17,415 INFO L495 AbstractCegarLoop]: Abstraction has 100027 states and 420350 transitions. [2022-09-16 11:09:17,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.470588235294118) internal successors, (228), 52 states have internal predecessors, (228), 0 states have call successors, (0), 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 11:09:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 100027 states and 420350 transitions. [2022-09-16 11:09:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 11:09:17,417 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:09:17,417 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:09:17,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-09-16 11:09:17,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:17,628 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:09:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:09:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash 805946386, now seen corresponding path program 1 times [2022-09-16 11:09:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:09:17,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850302306] [2022-09-16 11:09:17,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:09:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:09:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:09:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 11:09:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:09:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850302306] [2022-09-16 11:09:18,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850302306] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:09:18,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:09:18,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 11:09:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80756827] [2022-09-16 11:09:18,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:09:18,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:09:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:09:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:09:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:09:18,176 INFO L87 Difference]: Start difference. First operand 100027 states and 420350 transitions. Second operand has 3 states, 2 states have (on average 43.5) internal successors, (87), 3 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 11:09:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:09:19,459 INFO L93 Difference]: Finished difference Result 98633 states and 410707 transitions. [2022-09-16 11:09:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:09:19,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 43.5) internal successors, (87), 3 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 96 [2022-09-16 11:09:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:09:20,174 INFO L225 Difference]: With dead ends: 98633 [2022-09-16 11:09:20,174 INFO L226 Difference]: Without dead ends: 98633 [2022-09-16 11:09:20,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:09:20,176 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 113 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:09:20,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 11:09:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98633 states. [2022-09-16 11:09:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98633 to 56368. [2022-09-16 11:09:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56368 states, 56309 states have (on average 4.07618675522563) internal successors, (229526), 56367 states have internal predecessors, (229526), 0 states have call successors, (0), 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 11:09:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56368 states to 56368 states and 229526 transitions. [2022-09-16 11:09:23,281 INFO L78 Accepts]: Start accepts. Automaton has 56368 states and 229526 transitions. Word has length 96 [2022-09-16 11:09:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:09:23,282 INFO L495 AbstractCegarLoop]: Abstraction has 56368 states and 229526 transitions. [2022-09-16 11:09:23,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 43.5) internal successors, (87), 3 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 11:09:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 56368 states and 229526 transitions. [2022-09-16 11:09:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 11:09:23,284 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:09:23,284 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] [2022-09-16 11:09:23,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-09-16 11:09:23,284 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:09:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:09:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1800886201, now seen corresponding path program 2 times [2022-09-16 11:09:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:09:23,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335563643] [2022-09-16 11:09:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:09:23,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:09:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:09:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:09:24,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335563643] [2022-09-16 11:09:24,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335563643] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:09:24,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545807112] [2022-09-16 11:09:24,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:09:24,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:24,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:09:24,148 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:09:24,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-09-16 11:09:24,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:09:24,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:09:24,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 59 conjunts are in the unsatisfiable core [2022-09-16 11:09:24,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:09:24,374 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 11:09:24,395 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:09:24,395 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 18 [2022-09-16 11:09:24,422 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:09:24,422 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 16 treesize of output 22 [2022-09-16 11:09:24,608 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-16 11:09:24,608 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 20 treesize of output 30 [2022-09-16 11:09:24,733 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 15 treesize of output 11 [2022-09-16 11:09:25,201 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-09-16 11:09:25,201 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 1 case distinctions, treesize of input 29 treesize of output 36 [2022-09-16 11:09:26,222 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 34 treesize of output 34 [2022-09-16 11:09:26,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:26,394 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 34 treesize of output 34 [2022-09-16 11:09:26,547 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 34 treesize of output 34 [2022-09-16 11:09:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:26,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:09:28,806 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-09-16 11:09:28,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 56 [2022-09-16 11:09:28,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:09:28,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 704 treesize of output 692 [2022-09-16 11:09:28,833 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 319 treesize of output 271 [2022-09-16 11:09:28,842 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 590 treesize of output 494 [2022-09-16 11:09:28,854 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 494 treesize of output 470 [2022-09-16 11:09:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:30,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545807112] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:09:30,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:09:30,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-09-16 11:09:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720393546] [2022-09-16 11:09:30,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:09:30,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-16 11:09:30,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:09:30,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-16 11:09:30,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=6756, Unknown=162, NotChecked=0, Total=7310 [2022-09-16 11:09:30,555 INFO L87 Difference]: Start difference. First operand 56368 states and 229526 transitions. Second operand has 86 states, 85 states have (on average 2.988235294117647) internal successors, (254), 86 states have internal predecessors, (254), 0 states have call successors, (0), 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 11:09:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:09:34,107 INFO L93 Difference]: Finished difference Result 56488 states and 230025 transitions. [2022-09-16 11:09:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-09-16 11:09:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 2.988235294117647) internal successors, (254), 86 states have internal predecessors, (254), 0 states have call successors, (0), 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 11:09:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:09:34,411 INFO L225 Difference]: With dead ends: 56488 [2022-09-16 11:09:34,411 INFO L226 Difference]: Without dead ends: 56488 [2022-09-16 11:09:34,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3901 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1001, Invalid=13542, Unknown=219, NotChecked=0, Total=14762 [2022-09-16 11:09:34,412 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 340 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 828 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 11:09:34,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 4020 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 418 Invalid, 0 Unknown, 828 Unchecked, 0.2s Time] [2022-09-16 11:09:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56488 states. [2022-09-16 11:09:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56488 to 56488. [2022-09-16 11:09:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56488 states, 56429 states have (on average 4.0763614453561114) internal successors, (230025), 56487 states have internal predecessors, (230025), 0 states have call successors, (0), 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 11:09:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56488 states to 56488 states and 230025 transitions. [2022-09-16 11:09:36,603 INFO L78 Accepts]: Start accepts. Automaton has 56488 states and 230025 transitions. Word has length 96 [2022-09-16 11:09:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:09:36,603 INFO L495 AbstractCegarLoop]: Abstraction has 56488 states and 230025 transitions. [2022-09-16 11:09:36,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 2.988235294117647) internal successors, (254), 86 states have internal predecessors, (254), 0 states have call successors, (0), 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 11:09:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 56488 states and 230025 transitions. [2022-09-16 11:09:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 11:09:36,605 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:09:36,605 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] [2022-09-16 11:09:36,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-09-16 11:09:36,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-09-16 11:09:36,817 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:09:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:09:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1800886204, now seen corresponding path program 2 times [2022-09-16 11:09:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:09:36,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199465212] [2022-09-16 11:09:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:09:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:09:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:09:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:09:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199465212] [2022-09-16 11:09:37,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199465212] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:09:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964500060] [2022-09-16 11:09:37,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:09:37,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:37,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:09:37,896 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:09:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-09-16 11:09:38,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:09:38,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:09:38,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 54 conjunts are in the unsatisfiable core [2022-09-16 11:09:38,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:09:38,103 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 11:09:38,127 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:09:38,128 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 18 [2022-09-16 11:09:38,158 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:09:38,158 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 16 treesize of output 22 [2022-09-16 11:09:38,406 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:09:38,406 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 18 treesize of output 18 [2022-09-16 11:09:38,540 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 15 treesize of output 11 [2022-09-16 11:09:38,742 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:09:38,743 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 1 case distinctions, treesize of input 23 treesize of output 28 [2022-09-16 11:09:39,758 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 25 [2022-09-16 11:09:39,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:39,871 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 25 [2022-09-16 11:09:39,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:39,978 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 25 [2022-09-16 11:09:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:40,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:09:41,655 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-09-16 11:09:41,656 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 39 treesize of output 54 [2022-09-16 11:09:41,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:09:41,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 334 [2022-09-16 11:09:41,675 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 282 treesize of output 234 [2022-09-16 11:09:41,684 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 110 [2022-09-16 11:09:41,690 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 198 [2022-09-16 11:09:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:43,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964500060] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:09:43,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:09:43,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-09-16 11:09:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937569108] [2022-09-16 11:09:43,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:09:43,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-16 11:09:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:09:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-16 11:09:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=6778, Unknown=134, NotChecked=0, Total=7310 [2022-09-16 11:09:43,224 INFO L87 Difference]: Start difference. First operand 56488 states and 230025 transitions. Second operand has 86 states, 85 states have (on average 2.988235294117647) internal successors, (254), 86 states have internal predecessors, (254), 0 states have call successors, (0), 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 11:09:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:09:49,202 INFO L93 Difference]: Finished difference Result 129559 states and 540159 transitions. [2022-09-16 11:09:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-09-16 11:09:49,203 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 2.988235294117647) internal successors, (254), 86 states have internal predecessors, (254), 0 states have call successors, (0), 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 11:09:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:09:50,566 INFO L225 Difference]: With dead ends: 129559 [2022-09-16 11:09:50,566 INFO L226 Difference]: Without dead ends: 129559 [2022-09-16 11:09:50,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1359, Invalid=15115, Unknown=556, NotChecked=0, Total=17030 [2022-09-16 11:09:50,567 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 1611 mSDsluCounter, 6110 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 5815 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2760 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:09:50,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 5815 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1279 Invalid, 0 Unknown, 2760 Unchecked, 0.5s Time] [2022-09-16 11:09:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129559 states. [2022-09-16 11:09:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129559 to 69082. [2022-09-16 11:09:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69082 states, 69023 states have (on average 4.128884574706982) internal successors, (284988), 69081 states have internal predecessors, (284988), 0 states have call successors, (0), 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 11:09:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69082 states to 69082 states and 284988 transitions. [2022-09-16 11:09:54,181 INFO L78 Accepts]: Start accepts. Automaton has 69082 states and 284988 transitions. Word has length 96 [2022-09-16 11:09:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:09:54,181 INFO L495 AbstractCegarLoop]: Abstraction has 69082 states and 284988 transitions. [2022-09-16 11:09:54,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 2.988235294117647) internal successors, (254), 86 states have internal predecessors, (254), 0 states have call successors, (0), 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 11:09:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 69082 states and 284988 transitions. [2022-09-16 11:09:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-09-16 11:09:54,184 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:09:54,184 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:09:54,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-09-16 11:09:54,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:54,386 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:09:54,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:09:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash -208152017, now seen corresponding path program 2 times [2022-09-16 11:09:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:09:54,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087595761] [2022-09-16 11:09:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:09:54,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:09:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:09:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:09:54,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087595761] [2022-09-16 11:09:54,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087595761] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:09:54,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252570254] [2022-09-16 11:09:54,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:09:54,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:09:54,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:09:54,747 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:09:54,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-09-16 11:09:54,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:09:54,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:09:54,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjunts are in the unsatisfiable core [2022-09-16 11:09:54,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:09:55,194 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 13 treesize of output 9 [2022-09-16 11:09:55,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:55,385 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 11:09:55,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:09:55,420 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 11:09:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:09:55,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:09:55,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1698 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1698) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:09:55,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1698) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967295)) is different from false [2022-09-16 11:09:55,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:09:55,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1698) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967295)) is different from false [2022-09-16 11:09:55,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1698) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967295)) is different from false [2022-09-16 11:09:55,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:09:55,995 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 11:09:56,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:09:56,001 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 68 [2022-09-16 11:09:56,004 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 28 treesize of output 24 [2022-09-16 11:09:56,007 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 42 [2022-09-16 11:09:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:09:56,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252570254] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:09:56,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:09:56,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-09-16 11:09:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135289856] [2022-09-16 11:09:56,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:09:56,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-09-16 11:09:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:09:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-09-16 11:09:56,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1990, Unknown=5, NotChecked=470, Total=2652 [2022-09-16 11:09:56,365 INFO L87 Difference]: Start difference. First operand 69082 states and 284988 transitions. Second operand has 52 states, 51 states have (on average 4.529411764705882) internal successors, (231), 52 states have internal predecessors, (231), 0 states have call successors, (0), 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 11:09:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:09:59,038 INFO L93 Difference]: Finished difference Result 98617 states and 399956 transitions. [2022-09-16 11:09:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 11:09:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 4.529411764705882) internal successors, (231), 52 states have internal predecessors, (231), 0 states have call successors, (0), 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 97 [2022-09-16 11:09:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:10:00,056 INFO L225 Difference]: With dead ends: 98617 [2022-09-16 11:10:00,056 INFO L226 Difference]: Without dead ends: 98617 [2022-09-16 11:10:00,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 159 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=624, Invalid=4083, Unknown=5, NotChecked=690, Total=5402 [2022-09-16 11:10:00,057 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1590 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1056 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:10:00,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 3670 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1547 Invalid, 0 Unknown, 1056 Unchecked, 0.6s Time] [2022-09-16 11:10:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98617 states. [2022-09-16 11:10:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98617 to 69862. [2022-09-16 11:10:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69862 states, 69803 states have (on average 4.124149391859949) internal successors, (287878), 69861 states have internal predecessors, (287878), 0 states have call successors, (0), 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 11:10:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69862 states to 69862 states and 287878 transitions. [2022-09-16 11:10:03,536 INFO L78 Accepts]: Start accepts. Automaton has 69862 states and 287878 transitions. Word has length 97 [2022-09-16 11:10:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:10:03,536 INFO L495 AbstractCegarLoop]: Abstraction has 69862 states and 287878 transitions. [2022-09-16 11:10:03,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.529411764705882) internal successors, (231), 52 states have internal predecessors, (231), 0 states have call successors, (0), 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 11:10:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 69862 states and 287878 transitions. [2022-09-16 11:10:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-09-16 11:10:03,540 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:10:03,540 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-09-16 11:10:03,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-09-16 11:10:03,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-09-16 11:10:03,756 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:10:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:10:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -208152020, now seen corresponding path program 1 times [2022-09-16 11:10:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:10:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822296432] [2022-09-16 11:10:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:10:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:04,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:10:04,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822296432] [2022-09-16 11:10:04,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822296432] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:04,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976816300] [2022-09-16 11:10:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:10:04,057 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:10:04,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-09-16 11:10:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:04,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 45 conjunts are in the unsatisfiable core [2022-09-16 11:10:04,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:10:04,299 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 11:10:04,322 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:10:04,322 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 18 [2022-09-16 11:10:04,430 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:10:04,430 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 15 treesize of output 15 [2022-09-16 11:10:04,571 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 13 treesize of output 9 [2022-09-16 11:10:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:10:04,741 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 18 treesize of output 20 [2022-09-16 11:10:04,780 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 11:10:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:04,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:10:04,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1736) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:10:04,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1736) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-09-16 11:10:05,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1736) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 11:10:05,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1736) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 11:10:05,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1736) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-09-16 11:10:05,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:10:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-09-16 11:10:05,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:10:05,044 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 158 treesize of output 148 [2022-09-16 11:10:05,049 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 67 treesize of output 59 [2022-09-16 11:10:05,051 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 126 treesize of output 110 [2022-09-16 11:10:05,822 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 11:10:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:10:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976816300] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:10:05,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:10:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-09-16 11:10:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813335881] [2022-09-16 11:10:05,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:10:05,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:10:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:10:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:10:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2163, Unknown=5, NotChecked=490, Total=2862 [2022-09-16 11:10:05,846 INFO L87 Difference]: Start difference. First operand 69862 states and 287878 transitions. Second operand has 54 states, 53 states have (on average 4.830188679245283) internal successors, (256), 54 states have internal predecessors, (256), 0 states have call successors, (0), 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 11:10:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:10:08,716 INFO L93 Difference]: Finished difference Result 98422 states and 399331 transitions. [2022-09-16 11:10:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 11:10:08,717 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.830188679245283) internal successors, (256), 54 states have internal predecessors, (256), 0 states have call successors, (0), 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 97 [2022-09-16 11:10:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:10:09,562 INFO L225 Difference]: With dead ends: 98422 [2022-09-16 11:10:09,562 INFO L226 Difference]: Without dead ends: 98422 [2022-09-16 11:10:09,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=538, Invalid=4589, Unknown=5, NotChecked=720, Total=5852 [2022-09-16 11:10:09,562 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 765 mSDsluCounter, 4031 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1208 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:10:09,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 3997 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1598 Invalid, 0 Unknown, 1208 Unchecked, 0.6s Time] [2022-09-16 11:10:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98422 states. [2022-09-16 11:10:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98422 to 69862. [2022-09-16 11:10:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69862 states, 69803 states have (on average 4.121355815652622) internal successors, (287683), 69861 states have internal predecessors, (287683), 0 states have call successors, (0), 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 11:10:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69862 states to 69862 states and 287683 transitions. [2022-09-16 11:10:13,288 INFO L78 Accepts]: Start accepts. Automaton has 69862 states and 287683 transitions. Word has length 97 [2022-09-16 11:10:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:10:13,288 INFO L495 AbstractCegarLoop]: Abstraction has 69862 states and 287683 transitions. [2022-09-16 11:10:13,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.830188679245283) internal successors, (256), 54 states have internal predecessors, (256), 0 states have call successors, (0), 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 11:10:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 69862 states and 287683 transitions. [2022-09-16 11:10:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:10:13,292 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:10:13,292 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] [2022-09-16 11:10:13,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-09-16 11:10:13,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:13,507 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:10:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:10:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1270232617, now seen corresponding path program 1 times [2022-09-16 11:10:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:10:13,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033470829] [2022-09-16 11:10:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:10:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-09-16 11:10:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:10:13,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033470829] [2022-09-16 11:10:13,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033470829] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:13,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632974360] [2022-09-16 11:10:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:13,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:13,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:10:13,582 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:10:13,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-09-16 11:10:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:13,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-16 11:10:13,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:10:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:13,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:10:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:14,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632974360] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:14,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-16 11:10:14,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 9] total 19 [2022-09-16 11:10:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392777512] [2022-09-16 11:10:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:10:14,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-16 11:10:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:10:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-16 11:10:14,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-09-16 11:10:14,028 INFO L87 Difference]: Start difference. First operand 69862 states and 287683 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 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 11:10:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:10:15,132 INFO L93 Difference]: Finished difference Result 69769 states and 285607 transitions. [2022-09-16 11:10:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-16 11:10:15,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-09-16 11:10:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:10:15,605 INFO L225 Difference]: With dead ends: 69769 [2022-09-16 11:10:15,605 INFO L226 Difference]: Without dead ends: 69769 [2022-09-16 11:10:15,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2022-09-16 11:10:15,605 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 432 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:10:15,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 423 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 11:10:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69769 states. [2022-09-16 11:10:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69769 to 69769. [2022-09-16 11:10:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69769 states, 69710 states have (on average 4.097073590589585) internal successors, (285607), 69768 states have internal predecessors, (285607), 0 states have call successors, (0), 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 11:10:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69769 states to 69769 states and 285607 transitions. [2022-09-16 11:10:18,476 INFO L78 Accepts]: Start accepts. Automaton has 69769 states and 285607 transitions. Word has length 98 [2022-09-16 11:10:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:10:18,476 INFO L495 AbstractCegarLoop]: Abstraction has 69769 states and 285607 transitions. [2022-09-16 11:10:18,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 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 11:10:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69769 states and 285607 transitions. [2022-09-16 11:10:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:10:18,478 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:10:18,479 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-09-16 11:10:18,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-09-16 11:10:18,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:18,701 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:10:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:10:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1133811309, now seen corresponding path program 3 times [2022-09-16 11:10:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:10:18,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779779798] [2022-09-16 11:10:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:10:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:10:18,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779779798] [2022-09-16 11:10:18,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779779798] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280900537] [2022-09-16 11:10:18,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 11:10:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:18,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:10:18,851 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:10:18,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-09-16 11:10:19,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-09-16 11:10:19,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:10:19,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2022-09-16 11:10:19,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:10:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:19,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:10:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280900537] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:10:19,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:10:19,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-09-16 11:10:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143748389] [2022-09-16 11:10:19,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:10:19,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-16 11:10:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:10:19,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-16 11:10:19,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-09-16 11:10:19,506 INFO L87 Difference]: Start difference. First operand 69769 states and 285607 transitions. Second operand has 34 states, 34 states have (on average 5.294117647058823) internal successors, (180), 34 states have internal predecessors, (180), 0 states have call successors, (0), 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 11:10:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:10:21,206 INFO L93 Difference]: Finished difference Result 81501 states and 319468 transitions. [2022-09-16 11:10:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 11:10:21,206 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.294117647058823) internal successors, (180), 34 states have internal predecessors, (180), 0 states have call successors, (0), 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 98 [2022-09-16 11:10:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:10:22,067 INFO L225 Difference]: With dead ends: 81501 [2022-09-16 11:10:22,067 INFO L226 Difference]: Without dead ends: 81285 [2022-09-16 11:10:22,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=587, Invalid=2169, Unknown=0, NotChecked=0, Total=2756 [2022-09-16 11:10:22,068 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1754 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:10:22,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 3097 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:10:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81285 states. [2022-09-16 11:10:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81285 to 71619. [2022-09-16 11:10:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71619 states, 71560 states have (on average 4.0053521520402455) internal successors, (286623), 71618 states have internal predecessors, (286623), 0 states have call successors, (0), 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 11:10:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71619 states to 71619 states and 286623 transitions. [2022-09-16 11:10:24,793 INFO L78 Accepts]: Start accepts. Automaton has 71619 states and 286623 transitions. Word has length 98 [2022-09-16 11:10:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:10:24,794 INFO L495 AbstractCegarLoop]: Abstraction has 71619 states and 286623 transitions. [2022-09-16 11:10:24,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.294117647058823) internal successors, (180), 34 states have internal predecessors, (180), 0 states have call successors, (0), 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 11:10:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 71619 states and 286623 transitions. [2022-09-16 11:10:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:10:24,796 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:10:24,796 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] [2022-09-16 11:10:24,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-09-16 11:10:25,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-09-16 11:10:25,021 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:10:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:10:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2000035147, now seen corresponding path program 1 times [2022-09-16 11:10:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:10:25,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764100815] [2022-09-16 11:10:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:10:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:10:25,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764100815] [2022-09-16 11:10:25,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764100815] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:25,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935360523] [2022-09-16 11:10:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:25,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:25,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:10:25,890 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:10:25,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-09-16 11:10:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:26,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 11:10:26,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:10:26,144 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 11:10:26,174 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:10:26,175 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 18 [2022-09-16 11:10:26,343 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:10:26,343 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 15 treesize of output 15 [2022-09-16 11:10:26,447 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 15 treesize of output 11 [2022-09-16 11:10:26,590 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:10:26,590 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:10:26,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:10:26,799 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 11:10:26,854 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 11:10:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:10:26,931 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 11:10:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:26,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:10:26,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 4294967295)) is different from false [2022-09-16 11:10:26,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:10:27,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:10:27,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) c_~A~0.base) c_~A~0.offset) 4294967295)) is different from false [2022-09-16 11:10:27,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 4294967295)) is different from false [2022-09-16 11:10:27,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 4294967295)) is different from false [2022-09-16 11:10:27,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:10:27,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 Int)) (<= (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1841)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) is different from false [2022-09-16 11:10:27,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| Int)) (or (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 Int)) (<= (select (select (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~3#1_157| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1841)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157|)))) is different from false [2022-09-16 11:10:27,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| Int) (v_ArrVal_1841 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (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~3#1_157| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1841)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) is different from false [2022-09-16 11:10:27,121 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:10:27,121 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 11:10:27,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:10:27,126 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 11:10:27,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 108 treesize of output 100 [2022-09-16 11:10:27,131 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 11:10:27,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 48 treesize of output 46 [2022-09-16 11:10:27,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:10:27,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:10:27,694 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 11:10:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:10:27,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935360523] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:10:27,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:10:27,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 56 [2022-09-16 11:10:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124011849] [2022-09-16 11:10:27,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:10:27,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-09-16 11:10:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:10:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-09-16 11:10:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1995, Unknown=10, NotChecked=990, Total=3192 [2022-09-16 11:10:27,714 INFO L87 Difference]: Start difference. First operand 71619 states and 286623 transitions. Second operand has 57 states, 56 states have (on average 4.625) internal successors, (259), 57 states have internal predecessors, (259), 0 states have call successors, (0), 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 11:10:28,476 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| Int) (v_ArrVal_1841 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (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~3#1_157| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1841)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1| 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-09-16 11:10:28,881 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| Int) (v_ArrVal_1841 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (<= (select (select (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~3#1_157| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1841)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295))) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (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 11:10:30,884 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 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157| Int)) (or (forall ((v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 Int)) (<= (select (select (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~3#1_157| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1841)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1844) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967295)) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_157|)))) (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_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (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 11:10:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:10:32,964 INFO L93 Difference]: Finished difference Result 87102 states and 338119 transitions. [2022-09-16 11:10:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-16 11:10:32,964 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 4.625) internal successors, (259), 57 states have internal predecessors, (259), 0 states have call successors, (0), 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 98 [2022-09-16 11:10:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:10:33,533 INFO L225 Difference]: With dead ends: 87102 [2022-09-16 11:10:33,533 INFO L226 Difference]: Without dead ends: 87102 [2022-09-16 11:10:33,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 162 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=428, Invalid=3770, Unknown=14, NotChecked=1794, Total=6006 [2022-09-16 11:10:33,534 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 791 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2898 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:10:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 3573 Invalid, 4476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1540 Invalid, 0 Unknown, 2898 Unchecked, 0.6s Time] [2022-09-16 11:10:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87102 states. [2022-09-16 11:10:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87102 to 70396. [2022-09-16 11:10:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70396 states, 70337 states have (on average 3.9602200833131924) internal successors, (278550), 70395 states have internal predecessors, (278550), 0 states have call successors, (0), 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 11:10:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70396 states to 70396 states and 278550 transitions. [2022-09-16 11:10:36,857 INFO L78 Accepts]: Start accepts. Automaton has 70396 states and 278550 transitions. Word has length 98 [2022-09-16 11:10:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:10:36,857 INFO L495 AbstractCegarLoop]: Abstraction has 70396 states and 278550 transitions. [2022-09-16 11:10:36,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 4.625) internal successors, (259), 57 states have internal predecessors, (259), 0 states have call successors, (0), 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 11:10:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 70396 states and 278550 transitions. [2022-09-16 11:10:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:10:36,860 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:10:36,860 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] [2022-09-16 11:10:36,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-09-16 11:10:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-09-16 11:10:37,076 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:10:37,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:10:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1780766794, now seen corresponding path program 1 times [2022-09-16 11:10:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:10:37,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421152095] [2022-09-16 11:10:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:10:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:38,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:10:38,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421152095] [2022-09-16 11:10:38,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421152095] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:38,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306964563] [2022-09-16 11:10:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:38,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:38,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:10:38,477 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:10:38,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-09-16 11:10:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:38,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 56 conjunts are in the unsatisfiable core [2022-09-16 11:10:38,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:10:38,743 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 11:10:38,771 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:10:38,771 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 11:10:38,816 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-09-16 11:10:38,816 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 3 case distinctions, treesize of input 17 treesize of output 22 [2022-09-16 11:10:39,050 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-09-16 11:10:39,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 25 [2022-09-16 11:10:39,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 11:10:39,468 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:10:39,468 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-09-16 11:10:40,271 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 29 treesize of output 29 [2022-09-16 11:10:40,428 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 29 treesize of output 29 [2022-09-16 11:10:40,574 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 29 treesize of output 29 [2022-09-16 11:10:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:40,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:10:42,527 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-09-16 11:10:42,527 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 41 treesize of output 56 [2022-09-16 11:10:42,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:10:42,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 704 treesize of output 692 [2022-09-16 11:10:42,556 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 319 treesize of output 271 [2022-09-16 11:10:42,566 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 590 treesize of output 566 [2022-09-16 11:10:42,576 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 566 treesize of output 470 [2022-09-16 11:10:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:44,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306964563] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:10:44,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:10:44,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-09-16 11:10:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321456536] [2022-09-16 11:10:44,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:10:44,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-16 11:10:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:10:44,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-16 11:10:44,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=6768, Unknown=106, NotChecked=0, Total=7310 [2022-09-16 11:10:44,344 INFO L87 Difference]: Start difference. First operand 70396 states and 278550 transitions. Second operand has 86 states, 85 states have (on average 3.0588235294117645) internal successors, (260), 86 states have internal predecessors, (260), 0 states have call successors, (0), 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 11:10:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:10:49,919 INFO L93 Difference]: Finished difference Result 104003 states and 413948 transitions. [2022-09-16 11:10:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-09-16 11:10:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.0588235294117645) internal successors, (260), 86 states have internal predecessors, (260), 0 states have call successors, (0), 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 98 [2022-09-16 11:10:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:10:50,741 INFO L225 Difference]: With dead ends: 104003 [2022-09-16 11:10:50,741 INFO L226 Difference]: Without dead ends: 104003 [2022-09-16 11:10:50,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1345, Invalid=14261, Unknown=396, NotChecked=0, Total=16002 [2022-09-16 11:10:50,742 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 1087 mSDsluCounter, 6799 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 6556 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2853 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:10:50,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 6556 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1094 Invalid, 0 Unknown, 2853 Unchecked, 0.6s Time] [2022-09-16 11:10:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104003 states. [2022-09-16 11:10:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104003 to 87187. [2022-09-16 11:10:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87187 states, 87128 states have (on average 4.0243664493618585) internal successors, (350635), 87186 states have internal predecessors, (350635), 0 states have call successors, (0), 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 11:10:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87187 states to 87187 states and 350635 transitions. [2022-09-16 11:10:55,228 INFO L78 Accepts]: Start accepts. Automaton has 87187 states and 350635 transitions. Word has length 98 [2022-09-16 11:10:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:10:55,228 INFO L495 AbstractCegarLoop]: Abstraction has 87187 states and 350635 transitions. [2022-09-16 11:10:55,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.0588235294117645) internal successors, (260), 86 states have internal predecessors, (260), 0 states have call successors, (0), 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 11:10:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 87187 states and 350635 transitions. [2022-09-16 11:10:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:10:55,260 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:10:55,261 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] [2022-09-16 11:10:55,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-09-16 11:10:55,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-09-16 11:10:55,479 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:10:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:10:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1456218525, now seen corresponding path program 1 times [2022-09-16 11:10:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:10:55,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833456551] [2022-09-16 11:10:55,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:10:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:56,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:10:56,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833456551] [2022-09-16 11:10:56,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833456551] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:10:56,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852079666] [2022-09-16 11:10:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:10:56,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:10:56,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:10:56,484 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:10:56,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-09-16 11:10:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:10:56,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 54 conjunts are in the unsatisfiable core [2022-09-16 11:10:56,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:10:56,756 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 11:10:56,788 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 11:10:56,789 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 11:10:57,045 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-09-16 11:10:57,046 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 11:10:57,226 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 15 treesize of output 11 [2022-09-16 11:10:57,470 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:10:57,471 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 1 case distinctions, treesize of input 23 treesize of output 28 [2022-09-16 11:10:58,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:10:58,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:10:58,566 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 25 treesize of output 25 [2022-09-16 11:10:58,684 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 25 [2022-09-16 11:10:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:10:58,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:11:00,748 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-09-16 11:11:00,748 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 39 treesize of output 54 [2022-09-16 11:11:00,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:11:00,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 334 [2022-09-16 11:11:00,770 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 282 treesize of output 234 [2022-09-16 11:11:00,778 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 117 treesize of output 105 [2022-09-16 11:11:00,785 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 198 [2022-09-16 11:11:02,297 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 13 treesize of output 11 [2022-09-16 11:11:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:11:02,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852079666] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:11:02,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:11:02,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-09-16 11:11:02,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448129631] [2022-09-16 11:11:02,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:11:02,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-09-16 11:11:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:11:02,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-09-16 11:11:02,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=6593, Unknown=136, NotChecked=0, Total=7140 [2022-09-16 11:11:02,346 INFO L87 Difference]: Start difference. First operand 87187 states and 350635 transitions. Second operand has 85 states, 84 states have (on average 3.0833333333333335) internal successors, (259), 85 states have internal predecessors, (259), 0 states have call successors, (0), 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 11:11:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:11:07,908 INFO L93 Difference]: Finished difference Result 102257 states and 402757 transitions. [2022-09-16 11:11:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-09-16 11:11:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 3.0833333333333335) internal successors, (259), 85 states have internal predecessors, (259), 0 states have call successors, (0), 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 98 [2022-09-16 11:11:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:11:09,028 INFO L225 Difference]: With dead ends: 102257 [2022-09-16 11:11:09,028 INFO L226 Difference]: Without dead ends: 102257 [2022-09-16 11:11:09,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4142 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1172, Invalid=13009, Unknown=339, NotChecked=0, Total=14520 [2022-09-16 11:11:09,029 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 737 mSDsluCounter, 5740 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 5373 SdHoareTripleChecker+Invalid, 4296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2691 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 11:11:09,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 5373 Invalid, 4296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1564 Invalid, 0 Unknown, 2691 Unchecked, 0.8s Time] [2022-09-16 11:11:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102257 states. [2022-09-16 11:11:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102257 to 85608. [2022-09-16 11:11:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85608 states, 85549 states have (on average 4.008731837894072) internal successors, (342943), 85607 states have internal predecessors, (342943), 0 states have call successors, (0), 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 11:11:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85608 states to 85608 states and 342943 transitions. [2022-09-16 11:11:13,387 INFO L78 Accepts]: Start accepts. Automaton has 85608 states and 342943 transitions. Word has length 98 [2022-09-16 11:11:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:11:13,387 INFO L495 AbstractCegarLoop]: Abstraction has 85608 states and 342943 transitions. [2022-09-16 11:11:13,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 3.0833333333333335) internal successors, (259), 85 states have internal predecessors, (259), 0 states have call successors, (0), 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 11:11:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 85608 states and 342943 transitions. [2022-09-16 11:11:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:11:13,391 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:11:13,391 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] [2022-09-16 11:11:13,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-09-16 11:11:13,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:11:13,612 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:11:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:11:13,613 INFO L85 PathProgramCache]: Analyzing trace with hash -181375385, now seen corresponding path program 1 times [2022-09-16 11:11:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:11:13,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104268294] [2022-09-16 11:11:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:11:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:11:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:11:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:11:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:11:14,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104268294] [2022-09-16 11:11:14,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104268294] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:11:14,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837225366] [2022-09-16 11:11:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:11:14,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:11:14,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:11:14,250 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:11:14,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-09-16 11:11:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:11:14,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjunts are in the unsatisfiable core [2022-09-16 11:11:14,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:11:14,488 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 11:11:14,519 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:11:14,519 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 18 [2022-09-16 11:11:14,666 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:11:14,667 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 15 treesize of output 15 [2022-09-16 11:11:14,794 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 15 treesize of output 11 [2022-09-16 11:11:14,974 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:11:14,974 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 11:11:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:11:15,345 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 11:11:15,408 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 11:11:15,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:11:15,511 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 11:11:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:11:15,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:11:16,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 9223372039002259456)))) is different from false [2022-09-16 11:11:16,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) 9223372039002259456)) (< ~M~0 0))) is different from false [2022-09-16 11:11:16,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456)) (< ~M~0 0))) is different from false [2022-09-16 11:11:16,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ 9223372039002259456 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2022-09-16 11:11:16,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-09-16 11:11:16,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| Int)) (or (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (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~3#1_171| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171|)))) is different from false [2022-09-16 11:11:16,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| Int) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_171| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-09-16 11:11:16,458 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 11:11:16,459 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 41 treesize of output 47 [2022-09-16 11:11:16,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:11:16,465 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 172 treesize of output 168 [2022-09-16 11:11:16,468 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 152 treesize of output 128 [2022-09-16 11:11:16,470 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 128 treesize of output 116 [2022-09-16 11:11:16,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 60 treesize of output 54 [2022-09-16 11:11:16,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:11:16,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:11:16,954 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 11:11:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-09-16 11:11:16,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837225366] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:11:16,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:11:16,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 69 [2022-09-16 11:11:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218140691] [2022-09-16 11:11:16,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:11:16,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-09-16 11:11:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:11:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-09-16 11:11:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3650, Unknown=19, NotChecked=896, Total=4830 [2022-09-16 11:11:16,980 INFO L87 Difference]: Start difference. First operand 85608 states and 342943 transitions. Second operand has 70 states, 69 states have (on average 3.753623188405797) internal successors, (259), 70 states have internal predecessors, (259), 0 states have call successors, (0), 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 11:11:17,708 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (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~nondet24#1| 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| Int) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_171| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |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|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-09-16 11:11:18,075 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|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| Int) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< 0 (+ (select (select (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~3#1_171| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (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 11:11:20,078 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 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171| Int)) (or (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (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~3#1_171| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_171|)))) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (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 11:11:20,449 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 (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (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_~#t3~0#1.base|) (<= 0 (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((~M~0 Int) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1978 Int) (v_ArrVal_1979 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< 0 (+ (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1978)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1980) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1981) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (not (= (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0)) (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 11:11:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:11:24,661 INFO L93 Difference]: Finished difference Result 172779 states and 685939 transitions. [2022-09-16 11:11:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 11:11:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 3.753623188405797) internal successors, (259), 70 states have internal predecessors, (259), 0 states have call successors, (0), 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 98 [2022-09-16 11:11:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:11:26,408 INFO L225 Difference]: With dead ends: 172779 [2022-09-16 11:11:26,408 INFO L226 Difference]: Without dead ends: 172779 [2022-09-16 11:11:26,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 156 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2342 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=821, Invalid=7210, Unknown=23, NotChecked=2046, Total=10100 [2022-09-16 11:11:26,409 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1850 mSDsluCounter, 5124 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 4974 SdHoareTripleChecker+Invalid, 4514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2310 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 11:11:26,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 4974 Invalid, 4514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2152 Invalid, 0 Unknown, 2310 Unchecked, 0.9s Time] [2022-09-16 11:11:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172779 states. [2022-09-16 11:11:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172779 to 86330. [2022-09-16 11:11:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86330 states, 86271 states have (on average 4.0094122010872715) internal successors, (345896), 86329 states have internal predecessors, (345896), 0 states have call successors, (0), 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 11:11:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86330 states to 86330 states and 345896 transitions. [2022-09-16 11:11:31,427 INFO L78 Accepts]: Start accepts. Automaton has 86330 states and 345896 transitions. Word has length 98 [2022-09-16 11:11:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:11:31,427 INFO L495 AbstractCegarLoop]: Abstraction has 86330 states and 345896 transitions. [2022-09-16 11:11:31,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 3.753623188405797) internal successors, (259), 70 states have internal predecessors, (259), 0 states have call successors, (0), 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 11:11:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 86330 states and 345896 transitions. [2022-09-16 11:11:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-09-16 11:11:31,437 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:11:31,437 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] [2022-09-16 11:11:31,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-09-16 11:11:31,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-09-16 11:11:31,663 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-09-16 11:11:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:11:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -181375354, now seen corresponding path program 1 times [2022-09-16 11:11:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:11:31,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441979836] [2022-09-16 11:11:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:11:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:11:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:11:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:11:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:11:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441979836] [2022-09-16 11:11:32,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441979836] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:11:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470799059] [2022-09-16 11:11:32,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:11:32,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:11:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:11:32,331 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:11:32,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-09-16 11:11:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:11:32,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-16 11:11:32,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:11:32,955 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 11:11:33,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:11:33,763 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 11:11:33,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:11:33,857 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 11:11:34,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:11:34,008 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 11:11:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:11:34,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:11:34,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:11:34,963 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 34 treesize of output 35 [2022-09-16 11:11:34,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:11:34,971 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 1362 treesize of output 1302 [2022-09-16 11:11:34,980 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 1286 treesize of output 1094 [2022-09-16 11:11:34,991 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 571 treesize of output 523 [2022-09-16 11:11:35,004 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 1046 treesize of output 950 [2022-09-16 11:11:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:11:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470799059] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:11:37,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:11:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 71 [2022-09-16 11:11:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608966123] [2022-09-16 11:11:37,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:11:37,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-09-16 11:11:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:11:37,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-09-16 11:11:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4775, Unknown=27, NotChecked=0, Total=5112 [2022-09-16 11:11:37,238 INFO L87 Difference]: Start difference. First operand 86330 states and 345896 transitions. Second operand has 72 states, 71 states have (on average 3.295774647887324) internal successors, (234), 72 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)