/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/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 10:55:28,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 10:55:28,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 10:55:28,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 10:55:28,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 10:55:28,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 10:55:28,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 10:55:28,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 10:55:28,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 10:55:28,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 10:55:28,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 10:55:28,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 10:55:28,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 10:55:28,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 10:55:28,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 10:55:28,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 10:55:28,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 10:55:28,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 10:55:28,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 10:55:28,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 10:55:28,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 10:55:28,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 10:55:28,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 10:55:28,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 10:55:28,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 10:55:28,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 10:55:28,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 10:55:28,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 10:55:28,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 10:55:28,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 10:55:28,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 10:55:28,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 10:55:28,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 10:55:28,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 10:55:28,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 10:55:28,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 10:55:28,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 10:55:28,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 10:55:28,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 10:55:28,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 10:55:28,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 10:55:28,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-09-16 10:55:28,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 10:55:28,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 10:55:28,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 10:55:28,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 10:55:28,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 10:55:28,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 10:55:28,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 10:55:28,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 10:55:28,844 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 10:55:28,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 10:55:28,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 10:55:28,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 10:55:28,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 10:55:28,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 10:55:28,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 10:55:28,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 10:55:28,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 10:55:28,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 10:55:28,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 10:55:28,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 10:55:28,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 10:55:28,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 10:55:28,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 10:55:28,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 10:55:28,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 10:55:28,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:55:28,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 10:55:28,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 10:55:28,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 10:55:28,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 10:55:28,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 10:55:28,849 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 10:55:28,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 10:55:28,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 10:55:29,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 10:55:29,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 10:55:29,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 10:55:29,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 10:55:29,140 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 10:55:29,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-09-16 10:55:29,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da44b98d1/b0cdcb071b41453eb8d01441c5eff9c4/FLAG6da522dda [2022-09-16 10:55:29,583 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 10:55:29,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-09-16 10:55:29,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da44b98d1/b0cdcb071b41453eb8d01441c5eff9c4/FLAG6da522dda [2022-09-16 10:55:29,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da44b98d1/b0cdcb071b41453eb8d01441c5eff9c4 [2022-09-16 10:55:29,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 10:55:29,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 10:55:29,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 10:55:29,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 10:55:29,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 10:55:29,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:55:29" (1/1) ... [2022-09-16 10:55:29,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2714349a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:29, skipping insertion in model container [2022-09-16 10:55:30,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 10:55:29" (1/1) ... [2022-09-16 10:55:30,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 10:55:30,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 10:55:30,322 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-09-16 10:55:30,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:55:30,347 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 10:55:30,384 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/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-09-16 10:55:30,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 10:55:30,408 INFO L208 MainTranslator]: Completed translation [2022-09-16 10:55:30,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30 WrapperNode [2022-09-16 10:55:30,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 10:55:30,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 10:55:30,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 10:55:30,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 10:55:30,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,456 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 297 [2022-09-16 10:55:30,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 10:55:30,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 10:55:30,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 10:55:30,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 10:55:30,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 10:55:30,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 10:55:30,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 10:55:30,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 10:55:30,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (1/1) ... [2022-09-16 10:55:30,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 10:55:30,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:55:30,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-16 10:55:30,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-16 10:55:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 10:55:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 10:55:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 10:55:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 10:55:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 10:55:30,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 10:55:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 10:55:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 10:55:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 10:55:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 10:55:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-09-16 10:55:30,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-09-16 10:55:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 10:55:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 10:55:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 10:55:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 10:55:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 10:55:30,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 10:55:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 10:55:30,585 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 10:55:30,688 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 10:55:30,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 10:55:31,165 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 10:55:31,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 10:55:31,536 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-16 10:55:31,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:55:31 BoogieIcfgContainer [2022-09-16 10:55:31,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 10:55:31,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 10:55:31,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 10:55:31,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 10:55:31,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 10:55:29" (1/3) ... [2022-09-16 10:55:31,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4193ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:55:31, skipping insertion in model container [2022-09-16 10:55:31,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 10:55:30" (2/3) ... [2022-09-16 10:55:31,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4193ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 10:55:31, skipping insertion in model container [2022-09-16 10:55:31,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 10:55:31" (3/3) ... [2022-09-16 10:55:31,550 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-09-16 10:55:31,558 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 10:55:31,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 10:55:31,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-09-16 10:55:31,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 10:55:31,724 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-09-16 10:55:31,763 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 235 places, 236 transitions, 516 flow [2022-09-16 10:55:35,398 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 100952 states, 100220 states have (on average 4.529285571742167) internal successors, (453925), 100951 states have internal predecessors, (453925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:35,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 10:55:35,428 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;@68d60b2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 10:55:35,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-09-16 10:55:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 100952 states, 100220 states have (on average 4.529285571742167) internal successors, (453925), 100951 states have internal predecessors, (453925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-09-16 10:55:35,624 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:55:35,624 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] [2022-09-16 10:55:35,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:55:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:55:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2109387708, now seen corresponding path program 1 times [2022-09-16 10:55:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:55:35,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814297263] [2022-09-16 10:55:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:55:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:55:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:55:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:55:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:55:35,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814297263] [2022-09-16 10:55:35,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814297263] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:55:35,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:55:35,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 10:55:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798975384] [2022-09-16 10:55:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:55:35,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-16 10:55:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:55:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-16 10:55:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:55:36,246 INFO L87 Difference]: Start difference. First operand has 100952 states, 100220 states have (on average 4.529285571742167) internal successors, (453925), 100951 states have internal predecessors, (453925), 0 states have call successors, (0), 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 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:55:38,248 INFO L93 Difference]: Finished difference Result 58720 states and 253059 transitions. [2022-09-16 10:55:38,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:55:38,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-09-16 10:55:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:55:39,288 INFO L225 Difference]: With dead ends: 58720 [2022-09-16 10:55:39,288 INFO L226 Difference]: Without dead ends: 58717 [2022-09-16 10:55:39,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-09-16 10:55:39,294 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 297 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:55:39,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 207 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:55:39,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58717 states. [2022-09-16 10:55:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58717 to 58717. [2022-09-16 10:55:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58717 states, 58499 states have (on average 4.325817535342485) internal successors, (253056), 58716 states have internal predecessors, (253056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58717 states to 58717 states and 253056 transitions. [2022-09-16 10:55:43,426 INFO L78 Accepts]: Start accepts. Automaton has 58717 states and 253056 transitions. Word has length 54 [2022-09-16 10:55:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:55:43,427 INFO L495 AbstractCegarLoop]: Abstraction has 58717 states and 253056 transitions. [2022-09-16 10:55:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 58717 states and 253056 transitions. [2022-09-16 10:55:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-09-16 10:55:43,429 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:55:43,429 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] [2022-09-16 10:55:43,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 10:55:43,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:55:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:55:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 966510475, now seen corresponding path program 1 times [2022-09-16 10:55:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:55:43,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723967770] [2022-09-16 10:55:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:55:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:55:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:55:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:55:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:55:43,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723967770] [2022-09-16 10:55:43,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723967770] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:55:43,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:55:43,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:55:43,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219689108] [2022-09-16 10:55:43,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:55:43,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:55:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:55:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:55:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:55:43,541 INFO L87 Difference]: Start difference. First operand 58717 states and 253056 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:55:44,745 INFO L93 Difference]: Finished difference Result 58716 states and 253055 transitions. [2022-09-16 10:55:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:55:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-09-16 10:55:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:55:45,472 INFO L225 Difference]: With dead ends: 58716 [2022-09-16 10:55:45,473 INFO L226 Difference]: Without dead ends: 58716 [2022-09-16 10:55:45,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:55:45,484 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 141 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:55:45,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 288 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:55:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58716 states. [2022-09-16 10:55:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58716 to 58716. [2022-09-16 10:55:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58716 states, 58499 states have (on average 4.32580044103318) internal successors, (253055), 58715 states have internal predecessors, (253055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58716 states to 58716 states and 253055 transitions. [2022-09-16 10:55:48,547 INFO L78 Accepts]: Start accepts. Automaton has 58716 states and 253055 transitions. Word has length 55 [2022-09-16 10:55:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:55:48,547 INFO L495 AbstractCegarLoop]: Abstraction has 58716 states and 253055 transitions. [2022-09-16 10:55:48,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 58716 states and 253055 transitions. [2022-09-16 10:55:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-09-16 10:55:48,550 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:55:48,550 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] [2022-09-16 10:55:48,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 10:55:48,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:55:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:55:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1268055398, now seen corresponding path program 1 times [2022-09-16 10:55:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:55:48,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569691064] [2022-09-16 10:55:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:55:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:55:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:55:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:55:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:55:48,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569691064] [2022-09-16 10:55:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569691064] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:55:48,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:55:48,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 10:55:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390748760] [2022-09-16 10:55:48,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:55:48,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:55:48,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:55:48,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:55:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 10:55:48,669 INFO L87 Difference]: Start difference. First operand 58716 states and 253055 transitions. Second operand has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 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 10:55:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:55:50,579 INFO L93 Difference]: Finished difference Result 117354 states and 506032 transitions. [2022-09-16 10:55:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 10:55:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 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 82 [2022-09-16 10:55:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:55:52,082 INFO L225 Difference]: With dead ends: 117354 [2022-09-16 10:55:52,083 INFO L226 Difference]: Without dead ends: 117354 [2022-09-16 10:55:52,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 10:55:52,084 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 99 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 10:55:52,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 413 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 10:55:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117354 states. [2022-09-16 10:55:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117354 to 58723. [2022-09-16 10:55:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58723 states, 58506 states have (on average 4.325419615082214) internal successors, (253063), 58722 states have internal predecessors, (253063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:55:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58723 states to 58723 states and 253063 transitions. [2022-09-16 10:55:56,199 INFO L78 Accepts]: Start accepts. Automaton has 58723 states and 253063 transitions. Word has length 82 [2022-09-16 10:55:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:55:56,199 INFO L495 AbstractCegarLoop]: Abstraction has 58723 states and 253063 transitions. [2022-09-16 10:55:56,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 4 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 10:55:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 58723 states and 253063 transitions. [2022-09-16 10:55:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-09-16 10:55:56,201 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:55:56,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:55:56,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 10:55:56,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:55:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:55:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash 910809127, now seen corresponding path program 1 times [2022-09-16 10:55:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:55:56,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802048496] [2022-09-16 10:55:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:55:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:55:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:55:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:55:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:55:56,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802048496] [2022-09-16 10:55:56,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802048496] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:55:56,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886633550] [2022-09-16 10:55:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:55:56,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:55:56,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:55:56,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:55:56,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-16 10:55:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:55:56,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:55:56,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:55:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:55:56,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:55:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:55:56,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886633550] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:55:56,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:55:56,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 10:55:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049558860] [2022-09-16 10:55:56,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:55:56,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 10:55:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:55:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 10:55:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 10:55:56,647 INFO L87 Difference]: Start difference. First operand 58723 states and 253063 transitions. Second operand has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:01,874 INFO L93 Difference]: Finished difference Result 293270 states and 1264965 transitions. [2022-09-16 10:56:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 10:56:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 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 10:56:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:05,999 INFO L225 Difference]: With dead ends: 293270 [2022-09-16 10:56:06,000 INFO L226 Difference]: Without dead ends: 293270 [2022-09-16 10:56:06,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2022-09-16 10:56:06,001 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 599 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:06,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 878 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 10:56:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293270 states. [2022-09-16 10:56:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293270 to 58749. [2022-09-16 10:56:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58749 states, 58532 states have (on average 4.3240278821841045) internal successors, (253094), 58748 states have internal predecessors, (253094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58749 states to 58749 states and 253094 transitions. [2022-09-16 10:56:13,884 INFO L78 Accepts]: Start accepts. Automaton has 58749 states and 253094 transitions. Word has length 91 [2022-09-16 10:56:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:56:13,885 INFO L495 AbstractCegarLoop]: Abstraction has 58749 states and 253094 transitions. [2022-09-16 10:56:13,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 58749 states and 253094 transitions. [2022-09-16 10:56:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-09-16 10:56:13,887 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:56:13,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:56:13,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-16 10:56:14,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:56:14,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:56:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:56:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1829687088, now seen corresponding path program 1 times [2022-09-16 10:56:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:56:14,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933555927] [2022-09-16 10:56:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:56:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:56:14,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933555927] [2022-09-16 10:56:14,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933555927] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:56:14,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584665205] [2022-09-16 10:56:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:14,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:56:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:56:14,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:56:14,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-16 10:56:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:14,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 10:56:14,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:56:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:14,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:56:14,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584665205] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:56:14,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:56:14,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 10:56:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158999653] [2022-09-16 10:56:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:56:14,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 10:56:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:56:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 10:56:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 10:56:14,392 INFO L87 Difference]: Start difference. First operand 58749 states and 253094 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:16,655 INFO L93 Difference]: Finished difference Result 117377 states and 506058 transitions. [2022-09-16 10:56:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:56:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-09-16 10:56:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:18,090 INFO L225 Difference]: With dead ends: 117377 [2022-09-16 10:56:18,091 INFO L226 Difference]: Without dead ends: 117377 [2022-09-16 10:56:18,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-09-16 10:56:18,092 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 198 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:18,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 796 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:56:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117377 states. [2022-09-16 10:56:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117377 to 58748. [2022-09-16 10:56:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58748 states, 58532 states have (on average 4.3239766281692065) internal successors, (253091), 58747 states have internal predecessors, (253091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58748 states to 58748 states and 253091 transitions. [2022-09-16 10:56:22,089 INFO L78 Accepts]: Start accepts. Automaton has 58748 states and 253091 transitions. Word has length 92 [2022-09-16 10:56:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:56:22,089 INFO L495 AbstractCegarLoop]: Abstraction has 58748 states and 253091 transitions. [2022-09-16 10:56:22,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 58748 states and 253091 transitions. [2022-09-16 10:56:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 10:56:22,091 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:56:22,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:56:22,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-16 10:56:22,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:56:22,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:56:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:56:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash -510152212, now seen corresponding path program 1 times [2022-09-16 10:56:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:56:22,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480510858] [2022-09-16 10:56:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:56:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:22,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:56:22,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480510858] [2022-09-16 10:56:22,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480510858] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:56:22,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:56:22,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 10:56:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930520176] [2022-09-16 10:56:22,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:56:22,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:56:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:56:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:56:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:56:22,415 INFO L87 Difference]: Start difference. First operand 58748 states and 253091 transitions. Second operand has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:24,026 INFO L93 Difference]: Finished difference Result 85897 states and 372240 transitions. [2022-09-16 10:56:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:56:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-09-16 10:56:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:25,022 INFO L225 Difference]: With dead ends: 85897 [2022-09-16 10:56:25,023 INFO L226 Difference]: Without dead ends: 85897 [2022-09-16 10:56:25,023 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 10:56:25,027 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 94 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:25,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:56:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85897 states. [2022-09-16 10:56:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85897 to 69857. [2022-09-16 10:56:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69857 states, 69641 states have (on average 4.379575250211801) internal successors, (304998), 69856 states have internal predecessors, (304998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69857 states to 69857 states and 304998 transitions. [2022-09-16 10:56:29,428 INFO L78 Accepts]: Start accepts. Automaton has 69857 states and 304998 transitions. Word has length 96 [2022-09-16 10:56:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:56:29,429 INFO L495 AbstractCegarLoop]: Abstraction has 69857 states and 304998 transitions. [2022-09-16 10:56:29,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 69857 states and 304998 transitions. [2022-09-16 10:56:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-09-16 10:56:29,431 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:56:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:56:29,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 10:56:29,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:56:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:56:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1936803777, now seen corresponding path program 1 times [2022-09-16 10:56:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:56:29,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346849751] [2022-09-16 10:56:29,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:29,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:56:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:56:29,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346849751] [2022-09-16 10:56:29,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346849751] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:56:29,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:56:29,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 10:56:29,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920860738] [2022-09-16 10:56:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:56:29,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:56:29,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:56:29,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:56:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:56:29,529 INFO L87 Difference]: Start difference. First operand 69857 states and 304998 transitions. Second operand has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:30,917 INFO L93 Difference]: Finished difference Result 93644 states and 407065 transitions. [2022-09-16 10:56:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:56:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-09-16 10:56:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:31,605 INFO L225 Difference]: With dead ends: 93644 [2022-09-16 10:56:31,605 INFO L226 Difference]: Without dead ends: 93644 [2022-09-16 10:56:31,606 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 10:56:31,606 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 79 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:31,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 281 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:56:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93644 states. [2022-09-16 10:56:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93644 to 86471. [2022-09-16 10:56:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86471 states, 86255 states have (on average 4.394504666396151) internal successors, (379048), 86470 states have internal predecessors, (379048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86471 states to 86471 states and 379048 transitions. [2022-09-16 10:56:35,807 INFO L78 Accepts]: Start accepts. Automaton has 86471 states and 379048 transitions. Word has length 96 [2022-09-16 10:56:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:56:35,807 INFO L495 AbstractCegarLoop]: Abstraction has 86471 states and 379048 transitions. [2022-09-16 10:56:35,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 86471 states and 379048 transitions. [2022-09-16 10:56:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-09-16 10:56:35,809 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:56:35,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:56:35,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 10:56:35,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:56:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:56:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1365151751, now seen corresponding path program 1 times [2022-09-16 10:56:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:56:35,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210826312] [2022-09-16 10:56:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:56:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:56:35,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210826312] [2022-09-16 10:56:35,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210826312] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:56:35,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:56:35,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:56:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263374021] [2022-09-16 10:56:35,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:56:35,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 10:56:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:56:35,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 10:56:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 10:56:35,891 INFO L87 Difference]: Start difference. First operand 86471 states and 379048 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:38,066 INFO L93 Difference]: Finished difference Result 131828 states and 568637 transitions. [2022-09-16 10:56:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:56:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 10:56:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:39,573 INFO L225 Difference]: With dead ends: 131828 [2022-09-16 10:56:39,574 INFO L226 Difference]: Without dead ends: 129110 [2022-09-16 10:56:39,574 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 10:56:39,574 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 555 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:39,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 590 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-09-16 10:56:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129110 states. [2022-09-16 10:56:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129110 to 108810. [2022-09-16 10:56:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108810 states, 108559 states have (on average 4.349680818725301) internal successors, (472197), 108809 states have internal predecessors, (472197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108810 states to 108810 states and 472197 transitions. [2022-09-16 10:56:45,398 INFO L78 Accepts]: Start accepts. Automaton has 108810 states and 472197 transitions. Word has length 97 [2022-09-16 10:56:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:56:45,399 INFO L495 AbstractCegarLoop]: Abstraction has 108810 states and 472197 transitions. [2022-09-16 10:56:45,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 108810 states and 472197 transitions. [2022-09-16 10:56:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-09-16 10:56:45,400 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:56:45,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:56:45,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 10:56:45,401 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:56:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:56:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 88626162, now seen corresponding path program 1 times [2022-09-16 10:56:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:56:45,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621087128] [2022-09-16 10:56:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:56:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:56:45,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621087128] [2022-09-16 10:56:45,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621087128] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:56:45,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:56:45,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 10:56:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861005580] [2022-09-16 10:56:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:56:45,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 10:56:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:56:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 10:56:45,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-16 10:56:45,497 INFO L87 Difference]: Start difference. First operand 108810 states and 472197 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:47,217 INFO L93 Difference]: Finished difference Result 95720 states and 413517 transitions. [2022-09-16 10:56:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 10:56:47,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 10:56:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:48,373 INFO L225 Difference]: With dead ends: 95720 [2022-09-16 10:56:48,373 INFO L226 Difference]: Without dead ends: 86471 [2022-09-16 10:56:48,373 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 10:56:48,376 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 523 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:48,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 485 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:56:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86471 states. [2022-09-16 10:56:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86471 to 86471. [2022-09-16 10:56:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86471 states, 86255 states have (on average 4.394493072865341) internal successors, (379047), 86470 states have internal predecessors, (379047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86471 states to 86471 states and 379047 transitions. [2022-09-16 10:56:53,466 INFO L78 Accepts]: Start accepts. Automaton has 86471 states and 379047 transitions. Word has length 97 [2022-09-16 10:56:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:56:53,466 INFO L495 AbstractCegarLoop]: Abstraction has 86471 states and 379047 transitions. [2022-09-16 10:56:53,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 86471 states and 379047 transitions. [2022-09-16 10:56:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-09-16 10:56:53,467 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:56:53,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:56:53,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 10:56:53,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:56:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:56:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1296937254, now seen corresponding path program 1 times [2022-09-16 10:56:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:56:53,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625275709] [2022-09-16 10:56:53,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:56:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:56:53,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625275709] [2022-09-16 10:56:53,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625275709] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:56:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223010184] [2022-09-16 10:56:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:56:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:56:53,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:56:53,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:56:53,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-16 10:56:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:56:53,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-16 10:56:53,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:56:53,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 10:56:53,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:56:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:56:54,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223010184] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:56:54,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:56:54,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-09-16 10:56:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910501462] [2022-09-16 10:56:54,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:56:54,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:56:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:56:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:56:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:56:54,038 INFO L87 Difference]: Start difference. First operand 86471 states and 379047 transitions. Second operand has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:56:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:56:56,494 INFO L93 Difference]: Finished difference Result 131828 states and 568636 transitions. [2022-09-16 10:56:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 10:56:56,494 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-09-16 10:56:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:56:57,515 INFO L225 Difference]: With dead ends: 131828 [2022-09-16 10:56:57,515 INFO L226 Difference]: Without dead ends: 129110 [2022-09-16 10:56:57,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:56:57,516 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 990 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 10:56:57,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1477 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 10:56:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129110 states. [2022-09-16 10:57:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129110 to 108810. [2022-09-16 10:57:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108810 states, 108559 states have (on average 4.349671607144502) internal successors, (472196), 108809 states have internal predecessors, (472196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108810 states to 108810 states and 472196 transitions. [2022-09-16 10:57:03,237 INFO L78 Accepts]: Start accepts. Automaton has 108810 states and 472196 transitions. Word has length 106 [2022-09-16 10:57:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:57:03,237 INFO L495 AbstractCegarLoop]: Abstraction has 108810 states and 472196 transitions. [2022-09-16 10:57:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 108810 states and 472196 transitions. [2022-09-16 10:57:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-09-16 10:57:03,238 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:57:03,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:57:03,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 10:57:03,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:03,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:57:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:57:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1721504453, now seen corresponding path program 1 times [2022-09-16 10:57:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:57:03,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949671578] [2022-09-16 10:57:03,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:57:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:57:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:57:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949671578] [2022-09-16 10:57:03,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949671578] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:57:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394659839] [2022-09-16 10:57:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:03,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:03,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:57:03,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:57:03,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 10:57:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:04,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-16 10:57:04,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:57:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:57:04,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:57:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 10:57:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394659839] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:57:04,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:57:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-09-16 10:57:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723240860] [2022-09-16 10:57:04,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:57:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 10:57:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:57:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 10:57:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-09-16 10:57:04,487 INFO L87 Difference]: Start difference. First operand 108810 states and 472196 transitions. Second operand has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:57:06,065 INFO L93 Difference]: Finished difference Result 95720 states and 407198 transitions. [2022-09-16 10:57:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 10:57:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 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 106 [2022-09-16 10:57:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:57:06,687 INFO L225 Difference]: With dead ends: 95720 [2022-09-16 10:57:06,687 INFO L226 Difference]: Without dead ends: 82511 [2022-09-16 10:57:06,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-09-16 10:57:06,688 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 962 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 10:57:06,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1319 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 10:57:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82511 states. [2022-09-16 10:57:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82511 to 76769. [2022-09-16 10:57:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76769 states, 76543 states have (on average 4.346484982297532) internal successors, (332693), 76768 states have internal predecessors, (332693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76769 states to 76769 states and 332693 transitions. [2022-09-16 10:57:10,660 INFO L78 Accepts]: Start accepts. Automaton has 76769 states and 332693 transitions. Word has length 106 [2022-09-16 10:57:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:57:10,661 INFO L495 AbstractCegarLoop]: Abstraction has 76769 states and 332693 transitions. [2022-09-16 10:57:10,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 76769 states and 332693 transitions. [2022-09-16 10:57:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-09-16 10:57:10,662 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:57:10,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:57:10,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 10:57:10,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:10,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:57:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:57:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -113472153, now seen corresponding path program 2 times [2022-09-16 10:57:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:57:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235686294] [2022-09-16 10:57:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:57:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:11,283 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 10:57:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:57:11,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235686294] [2022-09-16 10:57:11,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235686294] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:57:11,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539604015] [2022-09-16 10:57:11,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:57:11,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:11,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:57:11,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:57:11,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 10:57:11,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:57:11,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:57:11,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 41 conjunts are in the unsatisfiable core [2022-09-16 10:57:11,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:57:11,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:57:11,653 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:57:11,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:57:11,855 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 10:57:12,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:57:12,039 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 10:57:12,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:57:12,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 10:57:12,160 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 10:57:12,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:57:12,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_193) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 10:57:12,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_193) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 10:57:12,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456))) is different from false [2022-09-16 10:57:12,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_193) |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 10:57:12,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_193) |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 10:57:12,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:57:12,340 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 10:57:12,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:57:12,351 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 10:57:12,359 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 134 treesize of output 126 [2022-09-16 10:57:12,366 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 10:57:13,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-09-16 10:57:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 10:57:13,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539604015] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:57:13,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:57:13,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 10:57:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621839864] [2022-09-16 10:57:13,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:57:13,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:57:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:57:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:57:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1733, Unknown=5, NotChecked=440, Total=2352 [2022-09-16 10:57:13,440 INFO L87 Difference]: Start difference. First operand 76769 states and 332693 transitions. Second operand has 49 states, 48 states have (on average 6.270833333333333) internal successors, (301), 49 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:57:17,253 INFO L93 Difference]: Finished difference Result 135000 states and 589550 transitions. [2022-09-16 10:57:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 10:57:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.270833333333333) internal successors, (301), 49 states have internal predecessors, (301), 0 states have call successors, (0), 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 115 [2022-09-16 10:57:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:57:18,344 INFO L225 Difference]: With dead ends: 135000 [2022-09-16 10:57:18,344 INFO L226 Difference]: Without dead ends: 135000 [2022-09-16 10:57:18,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=459, Invalid=3846, Unknown=5, NotChecked=660, Total=4970 [2022-09-16 10:57:18,346 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 678 mSDsluCounter, 4822 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 3803 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1420 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:57:18,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 3803 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1934 Invalid, 0 Unknown, 1420 Unchecked, 1.0s Time] [2022-09-16 10:57:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135000 states. [2022-09-16 10:57:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135000 to 81069. [2022-09-16 10:57:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81069 states, 80843 states have (on average 4.498868176589191) internal successors, (363702), 81068 states have internal predecessors, (363702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81069 states to 81069 states and 363702 transitions. [2022-09-16 10:57:24,115 INFO L78 Accepts]: Start accepts. Automaton has 81069 states and 363702 transitions. Word has length 115 [2022-09-16 10:57:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:57:24,115 INFO L495 AbstractCegarLoop]: Abstraction has 81069 states and 363702 transitions. [2022-09-16 10:57:24,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.270833333333333) internal successors, (301), 49 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 81069 states and 363702 transitions. [2022-09-16 10:57:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-09-16 10:57:24,118 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:57:24,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:57:24,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 10:57:24,335 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,SelfDestructingSolverStorable11 [2022-09-16 10:57:24,336 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:57:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:57:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -113472150, now seen corresponding path program 1 times [2022-09-16 10:57:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:57:24,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689269983] [2022-09-16 10:57:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:57:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:24,880 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 10:57:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:57:24,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689269983] [2022-09-16 10:57:24,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689269983] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:57:24,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093627814] [2022-09-16 10:57:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:24,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:24,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:57:24,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:57:24,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 10:57:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:25,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 42 conjunts are in the unsatisfiable core [2022-09-16 10:57:25,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:57:25,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:57:25,106 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 10:57:25,106 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 10:57:25,996 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:57:25,997 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 10:57:26,192 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 10:57:26,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:57:26,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:57:26,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:57:26,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 10:57:26,471 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 10:57:26,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:57:26,570 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_227) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 10:57:26,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_227) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 10:57:26,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 4294967296)) is different from false [2022-09-16 10:57:26,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967296)) is different from false [2022-09-16 10:57:26,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-09-16 10:57:26,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:57:26,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 10:57:26,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:57:26,652 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 10:57:26,655 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 10:57:26,660 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 10:57:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 10:57:27,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093627814] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:57:27,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:57:27,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 49 [2022-09-16 10:57:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801092469] [2022-09-16 10:57:27,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:57:27,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 10:57:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:57:27,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 10:57:27,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1824, Unknown=5, NotChecked=450, Total=2450 [2022-09-16 10:57:27,364 INFO L87 Difference]: Start difference. First operand 81069 states and 363702 transitions. Second operand has 50 states, 49 states have (on average 6.163265306122449) internal successors, (302), 50 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:57:30,957 INFO L93 Difference]: Finished difference Result 135000 states and 585391 transitions. [2022-09-16 10:57:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 10:57:30,958 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 6.163265306122449) internal successors, (302), 50 states have internal predecessors, (302), 0 states have call successors, (0), 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 115 [2022-09-16 10:57:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:57:32,546 INFO L225 Difference]: With dead ends: 135000 [2022-09-16 10:57:32,546 INFO L226 Difference]: Without dead ends: 135000 [2022-09-16 10:57:32,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=447, Invalid=3989, Unknown=6, NotChecked=670, Total=5112 [2022-09-16 10:57:32,548 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 755 mSDsluCounter, 5370 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1669 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:57:32,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 4200 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2100 Invalid, 0 Unknown, 1669 Unchecked, 1.0s Time] [2022-09-16 10:57:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135000 states. [2022-09-16 10:57:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135000 to 81069. [2022-09-16 10:57:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81069 states, 80843 states have (on average 4.447422782430142) internal successors, (359543), 81068 states have internal predecessors, (359543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81069 states to 81069 states and 359543 transitions. [2022-09-16 10:57:37,296 INFO L78 Accepts]: Start accepts. Automaton has 81069 states and 359543 transitions. Word has length 115 [2022-09-16 10:57:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:57:37,297 INFO L495 AbstractCegarLoop]: Abstraction has 81069 states and 359543 transitions. [2022-09-16 10:57:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 6.163265306122449) internal successors, (302), 50 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81069 states and 359543 transitions. [2022-09-16 10:57:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-09-16 10:57:37,298 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:57:37,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:57:37,321 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 10:57:37,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:37,509 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:57:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:57:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -113472149, now seen corresponding path program 1 times [2022-09-16 10:57:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:57:37,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967754295] [2022-09-16 10:57:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:57:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 10:57:37,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:57:37,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967754295] [2022-09-16 10:57:37,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967754295] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:57:37,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:57:37,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 10:57:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076963904] [2022-09-16 10:57:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:57:37,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:57:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:57:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:57:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:57:37,553 INFO L87 Difference]: Start difference. First operand 81069 states and 359543 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:57:39,473 INFO L93 Difference]: Finished difference Result 109886 states and 473061 transitions. [2022-09-16 10:57:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:57:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 [2022-09-16 10:57:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:57:40,331 INFO L225 Difference]: With dead ends: 109886 [2022-09-16 10:57:40,331 INFO L226 Difference]: Without dead ends: 109886 [2022-09-16 10:57:40,331 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 10:57:40,332 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 94 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:57:40,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 303 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:57:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109886 states. [2022-09-16 10:57:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109886 to 85228. [2022-09-16 10:57:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85228 states, 85002 states have (on average 4.443495447165949) internal successors, (377706), 85227 states have internal predecessors, (377706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85228 states to 85228 states and 377706 transitions. [2022-09-16 10:57:44,920 INFO L78 Accepts]: Start accepts. Automaton has 85228 states and 377706 transitions. Word has length 115 [2022-09-16 10:57:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:57:44,921 INFO L495 AbstractCegarLoop]: Abstraction has 85228 states and 377706 transitions. [2022-09-16 10:57:44,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 85228 states and 377706 transitions. [2022-09-16 10:57:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-09-16 10:57:44,922 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:57:44,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:57:44,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-16 10:57:44,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:57:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:57:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1389997742, now seen corresponding path program 2 times [2022-09-16 10:57:44,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:57:44,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423852754] [2022-09-16 10:57:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:57:44,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:57:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:57:45,329 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 10:57:45,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:57:45,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423852754] [2022-09-16 10:57:45,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423852754] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:57:45,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994597008] [2022-09-16 10:57:45,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 10:57:45,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:57:45,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:57:45,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:57:45,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-16 10:57:45,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 10:57:45,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 10:57:45,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 42 conjunts are in the unsatisfiable core [2022-09-16 10:57:45,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:57:45,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 10:57:45,719 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 10:57:45,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:57:45,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:57:45,924 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 10:57:45,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 10:57:45,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 10:57:46,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 10:57:46,031 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 10:57:46,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:57:46,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_282) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 10:57:46,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_282) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 10:57:46,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:57:46,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-16 10:57:46,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:57:46,771 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 10:57:46,776 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 10:57:46,780 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 10:57:47,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-09-16 10:57:47,311 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 10:57:47,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994597008] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:57:47,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:57:47,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 10:57:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955036030] [2022-09-16 10:57:47,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:57:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:57:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:57:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:57:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1984, Unknown=13, NotChecked=182, Total=2352 [2022-09-16 10:57:47,314 INFO L87 Difference]: Start difference. First operand 85228 states and 377706 transitions. Second operand has 49 states, 48 states have (on average 5.229166666666667) internal successors, (251), 49 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:57:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:57:51,547 INFO L93 Difference]: Finished difference Result 185868 states and 830098 transitions. [2022-09-16 10:57:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 10:57:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.229166666666667) internal successors, (251), 49 states have internal predecessors, (251), 0 states have call successors, (0), 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 115 [2022-09-16 10:57:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:57:53,691 INFO L225 Difference]: With dead ends: 185868 [2022-09-16 10:57:53,692 INFO L226 Difference]: Without dead ends: 185868 [2022-09-16 10:57:53,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=498, Invalid=4053, Unknown=13, NotChecked=266, Total=4830 [2022-09-16 10:57:53,693 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 651 mSDsluCounter, 5832 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1714 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 10:57:53,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 4573 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1591 Invalid, 0 Unknown, 1714 Unchecked, 0.7s Time] [2022-09-16 10:57:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185868 states. [2022-09-16 10:57:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185868 to 90392. [2022-09-16 10:58:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90392 states, 90166 states have (on average 4.613180134418739) internal successors, (415952), 90391 states have internal predecessors, (415952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90392 states to 90392 states and 415952 transitions. [2022-09-16 10:58:01,802 INFO L78 Accepts]: Start accepts. Automaton has 90392 states and 415952 transitions. Word has length 115 [2022-09-16 10:58:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:58:01,802 INFO L495 AbstractCegarLoop]: Abstraction has 90392 states and 415952 transitions. [2022-09-16 10:58:01,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.229166666666667) internal successors, (251), 49 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 90392 states and 415952 transitions. [2022-09-16 10:58:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-09-16 10:58:01,828 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:58:01,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:58:01,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-16 10:58:02,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:58:02,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:58:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:58:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1389997741, now seen corresponding path program 1 times [2022-09-16 10:58:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:58:02,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148776637] [2022-09-16 10:58:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:02,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:58:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 10:58:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:58:02,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148776637] [2022-09-16 10:58:02,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148776637] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:58:02,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:58:02,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 10:58:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693950955] [2022-09-16 10:58:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:58:02,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:58:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:58:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:58:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:58:02,172 INFO L87 Difference]: Start difference. First operand 90392 states and 415952 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:58:04,346 INFO L93 Difference]: Finished difference Result 133019 states and 604358 transitions. [2022-09-16 10:58:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 10:58:04,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 115 [2022-09-16 10:58:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:58:05,405 INFO L225 Difference]: With dead ends: 133019 [2022-09-16 10:58:05,405 INFO L226 Difference]: Without dead ends: 133019 [2022-09-16 10:58:05,405 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 10:58:05,406 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 84 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:58:05,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 283 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:58:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133019 states. [2022-09-16 10:58:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133019 to 108174. [2022-09-16 10:58:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108174 states, 107948 states have (on average 4.749675769815096) internal successors, (512718), 108173 states have internal predecessors, (512718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108174 states to 108174 states and 512718 transitions. [2022-09-16 10:58:11,235 INFO L78 Accepts]: Start accepts. Automaton has 108174 states and 512718 transitions. Word has length 115 [2022-09-16 10:58:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:58:11,236 INFO L495 AbstractCegarLoop]: Abstraction has 108174 states and 512718 transitions. [2022-09-16 10:58:11,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 108174 states and 512718 transitions. [2022-09-16 10:58:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-09-16 10:58:11,237 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:58:11,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:58:11,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-16 10:58:11,237 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:58:11,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:58:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1389997745, now seen corresponding path program 1 times [2022-09-16 10:58:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:58:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967153765] [2022-09-16 10:58:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:58:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:11,998 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 10:58:11,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:58:11,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967153765] [2022-09-16 10:58:11,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967153765] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:58:11,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769114828] [2022-09-16 10:58:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:11,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:58:11,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:58:12,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:58:12,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-16 10:58:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:12,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 10:58:12,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:58:12,351 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 10:58:12,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:58:12,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:58:12,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:58:12,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:58:12,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 10:58:12,650 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 10:58:12,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:58:12,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_340) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 10:58:12,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_340) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 10:58:14,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int)) (or (forall ((v_ArrVal_340 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) is different from false [2022-09-16 10:58:14,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int) (v_ArrVal_340 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339) |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) is different from false [2022-09-16 10:58:14,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int) (v_ArrVal_340 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339) |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) is different from false [2022-09-16 10:58:14,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int) (v_ArrVal_340 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339) |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) is different from false [2022-09-16 10:58:14,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int) (v_ArrVal_340 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_339) |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) is different from false [2022-09-16 10:58:14,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:58:14,833 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 10:58:14,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:58:14,842 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 10:58:14,847 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 134 treesize of output 118 [2022-09-16 10:58:14,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 118 treesize of output 110 [2022-09-16 10:58:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 10:58:15,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769114828] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:58:15,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:58:15,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 10:58:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167989798] [2022-09-16 10:58:15,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:58:15,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:58:15,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:58:15,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:58:15,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1566, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 10:58:15,192 INFO L87 Difference]: Start difference. First operand 108174 states and 512718 transitions. Second operand has 49 states, 48 states have (on average 5.229166666666667) internal successors, (251), 49 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:18,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse1 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int)) (or (forall ((v_ArrVal_340 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse2 4) 2147483648)) (<= 0 (+ (select .cse1 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 10:58:20,176 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_20| Int)) (or (forall ((v_ArrVal_340 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_20| v_ArrVal_340) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_20|)))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 10:58:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:58:24,145 INFO L93 Difference]: Finished difference Result 212546 states and 976014 transitions. [2022-09-16 10:58:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 10:58:24,145 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.229166666666667) internal successors, (251), 49 states have internal predecessors, (251), 0 states have call successors, (0), 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 115 [2022-09-16 10:58:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:58:26,549 INFO L225 Difference]: With dead ends: 212546 [2022-09-16 10:58:26,549 INFO L226 Difference]: Without dead ends: 212306 [2022-09-16 10:58:26,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=424, Invalid=3385, Unknown=9, NotChecked=1152, Total=4970 [2022-09-16 10:58:26,550 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 617 mSDsluCounter, 5899 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 4802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2263 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:58:26,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 4608 Invalid, 4802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2494 Invalid, 0 Unknown, 2263 Unchecked, 1.1s Time] [2022-09-16 10:58:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212306 states. [2022-09-16 10:58:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212306 to 116928. [2022-09-16 10:58:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116928 states, 116702 states have (on average 4.808812188308684) internal successors, (561198), 116927 states have internal predecessors, (561198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116928 states to 116928 states and 561198 transitions. [2022-09-16 10:58:35,396 INFO L78 Accepts]: Start accepts. Automaton has 116928 states and 561198 transitions. Word has length 115 [2022-09-16 10:58:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:58:35,397 INFO L495 AbstractCegarLoop]: Abstraction has 116928 states and 561198 transitions. [2022-09-16 10:58:35,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.229166666666667) internal successors, (251), 49 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 116928 states and 561198 transitions. [2022-09-16 10:58:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-09-16 10:58:35,399 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:58:35,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:58:35,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-16 10:58:35,615 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,SelfDestructingSolverStorable16 [2022-09-16 10:58:35,616 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:58:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:58:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1547569797, now seen corresponding path program 1 times [2022-09-16 10:58:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:58:35,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614784623] [2022-09-16 10:58:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:58:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:36,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 10:58:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:58:36,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614784623] [2022-09-16 10:58:36,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614784623] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:58:36,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179419970] [2022-09-16 10:58:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:36,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:58:36,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:58:36,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:58:36,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-16 10:58:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:36,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 10:58:36,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:58:37,166 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 10:58:37,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:58:37,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 18 treesize of output 20 [2022-09-16 10:58:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:58:37,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:58:37,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 10:58:37,594 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 10:58:37,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:58:37,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_380) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 10:58:37,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_380) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 10:58:39,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)) (forall ((v_ArrVal_380 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2022-09-16 10:58:39,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))) is different from false [2022-09-16 10:58:39,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))) is different from false [2022-09-16 10:58:39,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))) is different from false [2022-09-16 10:58:39,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))) is different from false [2022-09-16 10:58:39,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:58:39,859 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 10:58:39,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:58:39,867 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 10:58:39,871 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 32 treesize of output 28 [2022-09-16 10:58:39,875 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 58 treesize of output 50 [2022-09-16 10:58:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 10:58:40,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179419970] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:58:40,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:58:40,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 10:58:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380610743] [2022-09-16 10:58:40,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:58:40,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:58:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:58:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:58:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1566, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 10:58:40,223 INFO L87 Difference]: Start difference. First operand 116928 states and 561198 transitions. Second operand has 49 states, 48 states have (on average 5.291666666666667) internal successors, (254), 49 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 10:58:40,660 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))))) is different from false [2022-09-16 10:58:40,664 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))))) is different from false [2022-09-16 10:58:40,668 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))))) is different from false [2022-09-16 10:58:40,672 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (and (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 4) 2147483648)) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))))) is different from false [2022-09-16 10:58:40,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))) (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 2147483648)) (<= (+ |c_ULTIMATE.start_main_#t~ret27#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 10:58:40,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int) (v_ArrVal_379 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_379) |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)))) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 10:58:42,684 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_22| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_22|)) (forall ((v_ArrVal_380 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_22| v_ArrVal_380) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 10:58:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:58:46,818 INFO L93 Difference]: Finished difference Result 221113 states and 1023758 transitions. [2022-09-16 10:58:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 10:58:46,818 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.291666666666667) internal successors, (254), 49 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 116 [2022-09-16 10:58:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:58:49,219 INFO L225 Difference]: With dead ends: 221113 [2022-09-16 10:58:49,219 INFO L226 Difference]: Without dead ends: 220873 [2022-09-16 10:58:49,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=318, Invalid=2694, Unknown=14, NotChecked=1666, Total=4692 [2022-09-16 10:58:49,221 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 341 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 3798 SdHoareTripleChecker+Invalid, 3707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1754 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-09-16 10:58:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 3798 Invalid, 3707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1929 Invalid, 0 Unknown, 1754 Unchecked, 0.8s Time] [2022-09-16 10:58:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220873 states. [2022-09-16 10:58:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220873 to 116797. [2022-09-16 10:58:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116797 states, 116571 states have (on average 4.808279932401712) internal successors, (560506), 116796 states have internal predecessors, (560506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:58:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116797 states to 116797 states and 560506 transitions. [2022-09-16 10:58:57,893 INFO L78 Accepts]: Start accepts. Automaton has 116797 states and 560506 transitions. Word has length 116 [2022-09-16 10:58:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:58:57,893 INFO L495 AbstractCegarLoop]: Abstraction has 116797 states and 560506 transitions. [2022-09-16 10:58:57,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.291666666666667) internal successors, (254), 49 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 10:58:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 116797 states and 560506 transitions. [2022-09-16 10:58:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-09-16 10:58:57,905 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:58:57,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:58:57,946 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 10:58:58,131 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,SelfDestructingSolverStorable17 [2022-09-16 10:58:58,132 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:58:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:58:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1924889519, now seen corresponding path program 1 times [2022-09-16 10:58:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:58:58,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790079448] [2022-09-16 10:58:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:58:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:58,489 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 10:58:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:58:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790079448] [2022-09-16 10:58:58,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790079448] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:58:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105426918] [2022-09-16 10:58:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:58:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:58:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:58:58,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:58:58,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-16 10:58:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:58:58,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 10:58:58,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:58:58,826 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 10:58:58,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:58:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:58:59,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:58:59,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:58:59,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 10:58:59,117 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 10:58:59,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:58:59,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_420) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 10:58:59,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_420) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 10:59:01,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (forall ((v_ArrVal_420 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2022-09-16 10:59:01,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int) (v_ArrVal_420 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_419) |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-09-16 10:59:01,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int) (v_ArrVal_420 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_419) |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)))) is different from false [2022-09-16 10:59:01,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int) (v_ArrVal_420 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_419) |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) |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 10:59:01,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int) (v_ArrVal_420 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_419) |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) |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 10:59:01,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:59:01,324 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 10:59:01,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:59:01,334 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 10:59:01,339 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 134 treesize of output 126 [2022-09-16 10:59:01,344 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 10:59:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 10:59:01,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105426918] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:59:01,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:59:01,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 10:59:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449913121] [2022-09-16 10:59:01,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:59:01,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:59:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:59:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:59:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1566, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 10:59:01,664 INFO L87 Difference]: Start difference. First operand 116797 states and 560506 transitions. Second operand has 49 states, 48 states have (on average 5.354166666666667) internal successors, (257), 49 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:04,729 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse1 4) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (forall ((v_ArrVal_420 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse2 4) 2147483648)) (<= 0 (+ (select .cse1 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 10:59:06,732 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_24| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_24|)) (forall ((v_ArrVal_420 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_24| v_ArrVal_420) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 10:59:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:59:11,683 INFO L93 Difference]: Finished difference Result 220907 states and 1022638 transitions. [2022-09-16 10:59:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 10:59:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.354166666666667) internal successors, (257), 49 states have internal predecessors, (257), 0 states have call successors, (0), 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 117 [2022-09-16 10:59:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:59:15,738 INFO L225 Difference]: With dead ends: 220907 [2022-09-16 10:59:15,738 INFO L226 Difference]: Without dead ends: 220667 [2022-09-16 10:59:15,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=424, Invalid=3385, Unknown=9, NotChecked=1152, Total=4970 [2022-09-16 10:59:15,740 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 508 mSDsluCounter, 5938 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2374 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 10:59:15,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 4531 Invalid, 4921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2510 Invalid, 0 Unknown, 2374 Unchecked, 1.0s Time] [2022-09-16 10:59:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220667 states. [2022-09-16 10:59:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220667 to 116666. [2022-09-16 10:59:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116666 states, 116440 states have (on average 4.80774647887324) internal successors, (559814), 116665 states have internal predecessors, (559814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116666 states to 116666 states and 559814 transitions. [2022-09-16 10:59:24,792 INFO L78 Accepts]: Start accepts. Automaton has 116666 states and 559814 transitions. Word has length 117 [2022-09-16 10:59:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:59:24,792 INFO L495 AbstractCegarLoop]: Abstraction has 116666 states and 559814 transitions. [2022-09-16 10:59:24,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.354166666666667) internal successors, (257), 49 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 116666 states and 559814 transitions. [2022-09-16 10:59:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-09-16 10:59:24,795 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:59:24,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:59:24,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-09-16 10:59:24,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:59:24,996 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:59:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:59:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -308377919, now seen corresponding path program 1 times [2022-09-16 10:59:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:59:24,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315193035] [2022-09-16 10:59:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:59:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:59:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:59:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 10:59:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:59:25,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315193035] [2022-09-16 10:59:25,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315193035] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:59:25,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94362154] [2022-09-16 10:59:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:59:25,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:59:25,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:59:25,035 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:59:25,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-09-16 10:59:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:59:25,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-16 10:59:25,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:59:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 10:59:25,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 10:59:25,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94362154] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:59:25,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 10:59:25,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-09-16 10:59:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317205880] [2022-09-16 10:59:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:59:25,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 10:59:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:59:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 10:59:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:59:25,185 INFO L87 Difference]: Start difference. First operand 116666 states and 559814 transitions. Second operand has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:59:27,417 INFO L93 Difference]: Finished difference Result 134703 states and 640234 transitions. [2022-09-16 10:59:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 10:59:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-09-16 10:59:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:59:28,587 INFO L225 Difference]: With dead ends: 134703 [2022-09-16 10:59:28,588 INFO L226 Difference]: Without dead ends: 134703 [2022-09-16 10:59:28,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-16 10:59:28,588 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 167 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-09-16 10:59:28,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 522 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-09-16 10:59:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134703 states. [2022-09-16 10:59:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134703 to 110983. [2022-09-16 10:59:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110983 states, 110795 states have (on average 4.809675526873956) internal successors, (532888), 110982 states have internal predecessors, (532888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110983 states to 110983 states and 532888 transitions. [2022-09-16 10:59:34,804 INFO L78 Accepts]: Start accepts. Automaton has 110983 states and 532888 transitions. Word has length 118 [2022-09-16 10:59:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:59:34,805 INFO L495 AbstractCegarLoop]: Abstraction has 110983 states and 532888 transitions. [2022-09-16 10:59:34,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 110983 states and 532888 transitions. [2022-09-16 10:59:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-09-16 10:59:34,807 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:59:34,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:59:34,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-09-16 10:59:35,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:59:35,016 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:59:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:59:35,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1739042660, now seen corresponding path program 1 times [2022-09-16 10:59:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:59:35,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578248157] [2022-09-16 10:59:35,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:59:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:59:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:59:35,323 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 10:59:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:59:35,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578248157] [2022-09-16 10:59:35,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578248157] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 10:59:35,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79712567] [2022-09-16 10:59:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:59:35,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 10:59:35,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 10:59:35,326 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 10:59:35,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-09-16 10:59:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:59:35,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 10:59:35,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 10:59:35,660 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 10:59:35,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:59:35,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:59:35,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 10:59:35,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 10:59:35,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 10:59:35,928 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 10:59:35,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 10:59:35,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_488 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_488) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))))) is different from false [2022-09-16 10:59:35,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_488 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_488) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 10:59:37,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (forall ((v_ArrVal_488 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-09-16 10:59:38,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) is different from false [2022-09-16 10:59:38,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)))) is different from false [2022-09-16 10:59:38,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |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 10:59:38,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |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 10:59:38,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:59:38,109 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 10:59:38,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 10:59:38,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 80 treesize of output 76 [2022-09-16 10:59:38,119 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 10:59:38,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 28 treesize of output 24 [2022-09-16 10:59:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 10:59:38,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79712567] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 10:59:38,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 10:59:38,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 10:59:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407670652] [2022-09-16 10:59:38,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 10:59:38,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 10:59:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:59:38,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 10:59:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1582, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 10:59:38,413 INFO L87 Difference]: Start difference. First operand 110983 states and 532888 transitions. Second operand has 49 states, 48 states have (on average 5.416666666666667) internal successors, (260), 49 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 10:59:38,804 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 10:59:38,807 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 10:59:38,810 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 10:59:38,813 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)))) (<= 0 (+ (select .cse0 4) 2147483648)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1))) is different from false [2022-09-16 10:59:38,816 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret27#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 10:59:38,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_487) |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))))) (<= 0 (+ (select .cse0 4) 2147483648)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 10:59:40,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_26|)) (forall ((v_ArrVal_488 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_26| v_ArrVal_488) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 10:59:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 10:59:45,214 INFO L93 Difference]: Finished difference Result 209516 states and 970754 transitions. [2022-09-16 10:59:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 10:59:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.416666666666667) internal successors, (260), 49 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 118 [2022-09-16 10:59:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 10:59:48,814 INFO L225 Difference]: With dead ends: 209516 [2022-09-16 10:59:48,814 INFO L226 Difference]: Without dead ends: 209276 [2022-09-16 10:59:48,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=302, Invalid=2710, Unknown=14, NotChecked=1666, Total=4692 [2022-09-16 10:59:48,821 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 354 mSDsluCounter, 5212 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 4080 SdHoareTripleChecker+Invalid, 4394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2236 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-09-16 10:59:48,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 4080 Invalid, 4394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2133 Invalid, 0 Unknown, 2236 Unchecked, 0.9s Time] [2022-09-16 10:59:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209276 states. [2022-09-16 10:59:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209276 to 110852. [2022-09-16 10:59:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110852 states, 110664 states have (on average 4.809115882310417) internal successors, (532196), 110851 states have internal predecessors, (532196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 10:59:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110852 states to 110852 states and 532196 transitions. [2022-09-16 10:59:58,414 INFO L78 Accepts]: Start accepts. Automaton has 110852 states and 532196 transitions. Word has length 118 [2022-09-16 10:59:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 10:59:58,414 INFO L495 AbstractCegarLoop]: Abstraction has 110852 states and 532196 transitions. [2022-09-16 10:59:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.416666666666667) internal successors, (260), 49 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 10:59:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 110852 states and 532196 transitions. [2022-09-16 10:59:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-09-16 10:59:58,416 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 10:59:58,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 10:59:58,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-09-16 10:59:58,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-09-16 10:59:58,617 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 10:59:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 10:59:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1641887148, now seen corresponding path program 1 times [2022-09-16 10:59:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 10:59:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41859054] [2022-09-16 10:59:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 10:59:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 10:59:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 10:59:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 10:59:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 10:59:58,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41859054] [2022-09-16 10:59:58,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41859054] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 10:59:58,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 10:59:58,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 10:59:58,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690696132] [2022-09-16 10:59:58,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 10:59:58,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 10:59:58,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 10:59:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 10:59:58,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 10:59:58,653 INFO L87 Difference]: Start difference. First operand 110852 states and 532196 transitions. Second operand has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:00:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:00:00,078 INFO L93 Difference]: Finished difference Result 99386 states and 477771 transitions. [2022-09-16 11:00:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:00:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-09-16 11:00:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:00:00,929 INFO L225 Difference]: With dead ends: 99386 [2022-09-16 11:00:00,929 INFO L226 Difference]: Without dead ends: 99386 [2022-09-16 11:00:00,929 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:00:00,930 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 91 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:00:00,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 250 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-09-16 11:00:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99386 states. [2022-09-16 11:00:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99386 to 99386. [2022-09-16 11:00:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99386 states, 99253 states have (on average 4.813668100712321) internal successors, (477771), 99385 states have internal predecessors, (477771), 0 states have call successors, (0), 0 states have 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:00:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99386 states to 99386 states and 477771 transitions. [2022-09-16 11:00:06,120 INFO L78 Accepts]: Start accepts. Automaton has 99386 states and 477771 transitions. Word has length 118 [2022-09-16 11:00:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:00:06,120 INFO L495 AbstractCegarLoop]: Abstraction has 99386 states and 477771 transitions. [2022-09-16 11:00:06,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:00:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 99386 states and 477771 transitions. [2022-09-16 11:00:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-09-16 11:00:06,123 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:00:06,123 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, 1, 1, 1, 1, 1, 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:00:06,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-16 11:00:06,123 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:00:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:00:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2012116954, now seen corresponding path program 2 times [2022-09-16 11:00:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:00:06,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392635622] [2022-09-16 11:00:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:00:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:00:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:00:06,203 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:00:06,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:00:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392635622] [2022-09-16 11:00:06,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392635622] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:00:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304898295] [2022-09-16 11:00:06,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:00:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:00:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:00:06,208 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:00:06,212 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:00:06,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:00:06,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:00:06,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-16 11:00:06,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:00:06,439 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:00:06,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:00:06,522 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:00:06,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304898295] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:00:06,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:00:06,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 16 [2022-09-16 11:00:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358687912] [2022-09-16 11:00:06,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:00:06,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 11:00:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:00:06,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 11:00:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-09-16 11:00:06,524 INFO L87 Difference]: Start difference. First operand 99386 states and 477771 transitions. Second operand has 17 states, 16 states have (on average 9.75) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:00:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:00:14,412 INFO L93 Difference]: Finished difference Result 416915 states and 1937271 transitions. [2022-09-16 11:00:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 11:00:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 9.75) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 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 118 [2022-09-16 11:00:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:00:22,171 INFO L225 Difference]: With dead ends: 416915 [2022-09-16 11:00:22,171 INFO L226 Difference]: Without dead ends: 416915 [2022-09-16 11:00:22,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 227 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=413, Invalid=919, Unknown=0, NotChecked=0, Total=1332 [2022-09-16 11:00:22,172 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 2023 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-09-16 11:00:22,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 1104 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-09-16 11:00:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416915 states. [2022-09-16 11:00:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416915 to 99371. [2022-09-16 11:00:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99371 states, 99239 states have (on average 4.814185955118451) internal successors, (477755), 99370 states have internal predecessors, (477755), 0 states have call successors, (0), 0 states have 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:00:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99371 states to 99371 states and 477755 transitions. [2022-09-16 11:00:35,908 INFO L78 Accepts]: Start accepts. Automaton has 99371 states and 477755 transitions. Word has length 118 [2022-09-16 11:00:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:00:35,909 INFO L495 AbstractCegarLoop]: Abstraction has 99371 states and 477755 transitions. [2022-09-16 11:00:35,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 9.75) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:00:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 99371 states and 477755 transitions. [2022-09-16 11:00:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-09-16 11:00:35,924 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:00:35,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:00:35,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-09-16 11:00:36,140 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,SelfDestructingSolverStorable22 [2022-09-16 11:00:36,140 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:00:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:00:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 408381357, now seen corresponding path program 1 times [2022-09-16 11:00:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:00:36,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846391097] [2022-09-16 11:00:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:00:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:00:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:00:36,500 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:00:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:00:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846391097] [2022-09-16 11:00:36,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846391097] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:00:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558839465] [2022-09-16 11:00:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:00:36,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:00:36,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:00:36,501 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:00:36,502 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:00:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:00:36,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 37 conjunts are in the unsatisfiable core [2022-09-16 11:00:36,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:00:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:00:36,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:00:36,997 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:00:37,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:00:37,090 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:00:37,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 11:00:37,125 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:00:37,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:00:37,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:00:37,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:00:39,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int)) (or (forall ((v_ArrVal_578 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) is different from false [2022-09-16 11:00:39,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) is different from false [2022-09-16 11:00:39,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) is different from false [2022-09-16 11:00:39,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) is different from false [2022-09-16 11:00:39,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) is different from false [2022-09-16 11:00:39,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:00:39,314 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:00:39,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:00:39,322 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:00:39,326 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:00:39,331 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:00:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:00:39,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558839465] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:00:39,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:00:39,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2022-09-16 11:00:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344124588] [2022-09-16 11:00:39,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:00:39,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-09-16 11:00:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:00:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-09-16 11:00:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1582, Unknown=7, NotChecked=602, Total=2352 [2022-09-16 11:00:39,621 INFO L87 Difference]: Start difference. First operand 99371 states and 477755 transitions. Second operand has 49 states, 48 states have (on average 5.479166666666667) internal successors, (263), 49 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:00:40,091 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))))) is different from false [2022-09-16 11:00:40,094 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))))) is different from false [2022-09-16 11:00:40,097 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))))) is different from false [2022-09-16 11:00:40,102 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 4) 2147483648)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))))) is different from false [2022-09-16 11:00:40,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret27#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0) (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))))) is different from false [2022-09-16 11:00:40,110 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (forall ((v_ArrVal_578 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int) (v_ArrVal_577 (Array Int Int))) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_577) |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:00:42,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_28| Int)) (or (forall ((v_ArrVal_578 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_28| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_28|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:00:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:00:45,784 INFO L93 Difference]: Finished difference Result 174378 states and 797499 transitions. [2022-09-16 11:00:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 11:00:45,784 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 5.479166666666667) internal successors, (263), 49 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-09-16 11:00:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:00:47,877 INFO L225 Difference]: With dead ends: 174378 [2022-09-16 11:00:47,878 INFO L226 Difference]: Without dead ends: 174138 [2022-09-16 11:00:47,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=302, Invalid=2710, Unknown=14, NotChecked=1666, Total=4692 [2022-09-16 11:00:47,879 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 368 mSDsluCounter, 5361 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 4215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1967 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:00:47,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 4213 Invalid, 4215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2221 Invalid, 0 Unknown, 1967 Unchecked, 1.1s Time] [2022-09-16 11:00:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174138 states. [2022-09-16 11:00:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174138 to 91802. [2022-09-16 11:00:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91802 states, 91670 states have (on average 4.6713755863423145) internal successors, (428225), 91801 states have internal predecessors, (428225), 0 states have call successors, (0), 0 states have 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:00:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91802 states to 91802 states and 428225 transitions. [2022-09-16 11:00:53,848 INFO L78 Accepts]: Start accepts. Automaton has 91802 states and 428225 transitions. Word has length 119 [2022-09-16 11:00:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:00:53,849 INFO L495 AbstractCegarLoop]: Abstraction has 91802 states and 428225 transitions. [2022-09-16 11:00:53,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 5.479166666666667) internal successors, (263), 49 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:00:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 91802 states and 428225 transitions. [2022-09-16 11:00:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-09-16 11:00:53,851 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:00:53,851 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, 1, 1, 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:00:53,871 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:00:54,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:00:54,060 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:00:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:00:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash -969779758, now seen corresponding path program 1 times [2022-09-16 11:00:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:00:54,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439636552] [2022-09-16 11:00:54,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:00:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:00:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:00:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:00:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:00:54,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439636552] [2022-09-16 11:00:54,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439636552] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:00:54,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753140941] [2022-09-16 11:00:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:00:54,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:00:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:00:54,205 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:00:54,210 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:00:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:00:54,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 11:00:54,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:00:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:00:54,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:00:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:00:54,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753140941] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:00:54,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:00:54,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-09-16 11:00:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110275299] [2022-09-16 11:00:54,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:00:54,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 11:00:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:00:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 11:00:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-09-16 11:00:54,681 INFO L87 Difference]: Start difference. First operand 91802 states and 428225 transitions. Second operand has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:00:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:00:58,546 INFO L93 Difference]: Finished difference Result 175626 states and 795632 transitions. [2022-09-16 11:00:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:00:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 0 states have call successors, (0), 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 119 [2022-09-16 11:00:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:01:00,793 INFO L225 Difference]: With dead ends: 175626 [2022-09-16 11:01:00,794 INFO L226 Difference]: Without dead ends: 171918 [2022-09-16 11:01:00,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=1252, Unknown=0, NotChecked=0, Total=1640 [2022-09-16 11:01:00,794 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 1419 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-09-16 11:01:00,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 2417 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-09-16 11:01:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171918 states. [2022-09-16 11:01:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171918 to 127433. [2022-09-16 11:01:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127433 states, 127277 states have (on average 4.656905803876584) internal successors, (592717), 127432 states have internal predecessors, (592717), 0 states have call successors, (0), 0 states have 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:01:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127433 states to 127433 states and 592717 transitions. [2022-09-16 11:01:08,286 INFO L78 Accepts]: Start accepts. Automaton has 127433 states and 592717 transitions. Word has length 119 [2022-09-16 11:01:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:01:08,287 INFO L495 AbstractCegarLoop]: Abstraction has 127433 states and 592717 transitions. [2022-09-16 11:01:08,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.037037037037037) internal successors, (190), 27 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:01:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 127433 states and 592717 transitions. [2022-09-16 11:01:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-09-16 11:01:08,289 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:01:08,290 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, 1, 1, 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:01:08,309 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:01:08,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:01:08,490 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:01:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:01:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 641107069, now seen corresponding path program 1 times [2022-09-16 11:01:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:01:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962576231] [2022-09-16 11:01:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:01:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:01:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:01:08,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962576231] [2022-09-16 11:01:08,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962576231] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:01:08,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008297958] [2022-09-16 11:01:08,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:01:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:01:08,613 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:01:08,615 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:01:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:08,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 11:01:08,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:01:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:01:08,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:01:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:01:09,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008297958] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:01:09,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:01:09,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-09-16 11:01:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110500286] [2022-09-16 11:01:09,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:01:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 11:01:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:01:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 11:01:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-09-16 11:01:09,475 INFO L87 Difference]: Start difference. First operand 127433 states and 592717 transitions. Second operand has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 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:01:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:01:11,479 INFO L93 Difference]: Finished difference Result 128473 states and 563386 transitions. [2022-09-16 11:01:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:01:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 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 119 [2022-09-16 11:01:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:01:12,920 INFO L225 Difference]: With dead ends: 128473 [2022-09-16 11:01:12,920 INFO L226 Difference]: Without dead ends: 123537 [2022-09-16 11:01:12,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=1252, Unknown=0, NotChecked=0, Total=1640 [2022-09-16 11:01:12,920 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 1070 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-09-16 11:01:12,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 2167 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-09-16 11:01:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123537 states. [2022-09-16 11:01:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123537 to 111015. [2022-09-16 11:01:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111015 states, 110861 states have (on average 4.485608103841748) internal successors, (497279), 111014 states have internal predecessors, (497279), 0 states have call successors, (0), 0 states have 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:01:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111015 states to 111015 states and 497279 transitions. [2022-09-16 11:01:18,592 INFO L78 Accepts]: Start accepts. Automaton has 111015 states and 497279 transitions. Word has length 119 [2022-09-16 11:01:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:01:18,592 INFO L495 AbstractCegarLoop]: Abstraction has 111015 states and 497279 transitions. [2022-09-16 11:01:18,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 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:01:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 111015 states and 497279 transitions. [2022-09-16 11:01:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:01:18,595 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:01:18,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:01:18,630 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:01:18,815 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,SelfDestructingSolverStorable25 [2022-09-16 11:01:18,815 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:01:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:01:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -225199895, now seen corresponding path program 1 times [2022-09-16 11:01:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:01:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116770819] [2022-09-16 11:01:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:01:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:19,246 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:01:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:01:19,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116770819] [2022-09-16 11:01:19,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116770819] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:01:19,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11024369] [2022-09-16 11:01:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:19,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:01:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:01:19,247 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:01:19,248 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:01:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:19,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-16 11:01:19,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:01:19,740 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:01:19,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:01:19,950 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:01:20,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:01:20,093 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:01:20,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:01:20,141 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:01:20,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 11:01:20,149 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:01:20,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:01:20,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 11:01:20,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 11:01:20,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 11:01:20,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)) (forall ((v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) is different from false [2022-09-16 11:01:20,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_685) |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296))) is different from false [2022-09-16 11:01:20,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_685) |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 4294967296))) is different from false [2022-09-16 11:01:20,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_685) |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)))) is different from false [2022-09-16 11:01:20,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_685) |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-09-16 11:01:20,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:01:20,632 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:01:20,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:01:20,640 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 140 treesize of output 136 [2022-09-16 11:01:20,644 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 106 [2022-09-16 11:01:20,650 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:01:20,654 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:01:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:01:21,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11024369] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:01:21,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:01:21,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 52 [2022-09-16 11:01:21,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613658566] [2022-09-16 11:01:21,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:01:21,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-09-16 11:01:21,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:01:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-09-16 11:01:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1771, Unknown=8, NotChecked=744, Total=2756 [2022-09-16 11:01:21,144 INFO L87 Difference]: Start difference. First operand 111015 states and 497279 transitions. Second operand has 53 states, 52 states have (on average 5.096153846153846) internal successors, (265), 53 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:01:23,761 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)) (forall ((v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:01:25,765 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_33| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_33|)) (forall ((v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_33| v_ArrVal_686) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_687) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 11:01:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:01:29,172 INFO L93 Difference]: Finished difference Result 169207 states and 743896 transitions. [2022-09-16 11:01:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 11:01:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 5.096153846153846) internal successors, (265), 53 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:01:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:01:30,599 INFO L225 Difference]: With dead ends: 169207 [2022-09-16 11:01:30,599 INFO L226 Difference]: Without dead ends: 169207 [2022-09-16 11:01:30,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 205 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=403, Invalid=2819, Unknown=10, NotChecked=1190, Total=4422 [2022-09-16 11:01:30,600 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 650 mSDsluCounter, 5485 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 5140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2686 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:01:30,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 4200 Invalid, 5140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2423 Invalid, 0 Unknown, 2686 Unchecked, 1.0s Time] [2022-09-16 11:01:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169207 states. [2022-09-16 11:01:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169207 to 114790. [2022-09-16 11:01:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114790 states, 114636 states have (on average 4.481907952126732) internal successors, (513788), 114789 states have internal predecessors, (513788), 0 states have call successors, (0), 0 states have 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:01:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114790 states to 114790 states and 513788 transitions. [2022-09-16 11:01:38,254 INFO L78 Accepts]: Start accepts. Automaton has 114790 states and 513788 transitions. Word has length 120 [2022-09-16 11:01:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:01:38,254 INFO L495 AbstractCegarLoop]: Abstraction has 114790 states and 513788 transitions. [2022-09-16 11:01:38,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 5.096153846153846) internal successors, (265), 53 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:01:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 114790 states and 513788 transitions. [2022-09-16 11:01:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:01:38,258 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:01:38,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:01:38,286 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:01:38,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-09-16 11:01:38,483 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:01:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:01:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -225199898, now seen corresponding path program 1 times [2022-09-16 11:01:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:01:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141854027] [2022-09-16 11:01:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:01:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:39,092 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:01:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:01:39,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141854027] [2022-09-16 11:01:39,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141854027] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:01:39,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478564602] [2022-09-16 11:01:39,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:39,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:01:39,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:01:39,094 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:01:39,095 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:01:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:39,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 11:01:39,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:01:39,266 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:01:39,437 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:01:39,438 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:01:39,687 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:01:39,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:01:39,925 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:01:40,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:01:40,100 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:01:40,149 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:01:40,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 11:01:40,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:01:40,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:01:40,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:01:40,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:01:40,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:01:40,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2022-09-16 11:01:40,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_731 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_731) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-09-16 11:01:40,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_731 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_731) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)))) is different from false [2022-09-16 11:01:40,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_731 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_731) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) |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:01:40,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_731 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_731) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) |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:01:40,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:01:40,408 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:01:40,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:01:40,418 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 300 [2022-09-16 11:01:40,425 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 146 treesize of output 138 [2022-09-16 11:01:40,444 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 278 treesize of output 262 [2022-09-16 11:01:40,450 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 262 treesize of output 230 [2022-09-16 11:01:41,636 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:01:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:01:41,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478564602] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:01:41,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:01:41,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-09-16 11:01:41,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301205186] [2022-09-16 11:01:41,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:01:41,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-16 11:01:41,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:01:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-16 11:01:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1982, Unknown=8, NotChecked=776, Total=2970 [2022-09-16 11:01:41,665 INFO L87 Difference]: Start difference. First operand 114790 states and 513788 transitions. Second operand has 55 states, 54 states have (on average 5.851851851851852) internal successors, (316), 55 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:01:45,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse2 (select |c_#memory_int| c_~X_0~0.base))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse1 4) 2147483648)) (<= 0 (+ (select .cse2 4) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= 0 (+ (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse3 4) 2147483648)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 1) (<= 0 (+ (select .cse2 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:01:47,035 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_732) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_733) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 11:01:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:01:50,546 INFO L93 Difference]: Finished difference Result 191128 states and 824851 transitions. [2022-09-16 11:01:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 11:01:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 5.851851851851852) internal successors, (316), 55 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:01:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:01:52,548 INFO L225 Difference]: With dead ends: 191128 [2022-09-16 11:01:52,548 INFO L226 Difference]: Without dead ends: 189912 [2022-09-16 11:01:52,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=547, Invalid=4313, Unknown=10, NotChecked=1450, Total=6320 [2022-09-16 11:01:52,549 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 888 mSDsluCounter, 5538 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 5098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2916 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:01:52,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 4301 Invalid, 5098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2140 Invalid, 0 Unknown, 2916 Unchecked, 1.0s Time] [2022-09-16 11:01:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189912 states. [2022-09-16 11:01:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189912 to 115766. [2022-09-16 11:01:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115766 states, 115612 states have (on average 4.476351935785212) internal successors, (517520), 115765 states have internal predecessors, (517520), 0 states have call successors, (0), 0 states have 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:01:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115766 states to 115766 states and 517520 transitions. [2022-09-16 11:01:59,331 INFO L78 Accepts]: Start accepts. Automaton has 115766 states and 517520 transitions. Word has length 120 [2022-09-16 11:01:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:01:59,332 INFO L495 AbstractCegarLoop]: Abstraction has 115766 states and 517520 transitions. [2022-09-16 11:01:59,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 5.851851851851852) internal successors, (316), 55 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have 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:01:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 115766 states and 517520 transitions. [2022-09-16 11:01:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:01:59,335 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:01:59,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:01:59,352 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:01:59,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-09-16 11:01:59,536 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:01:59,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:01:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1043524488, now seen corresponding path program 2 times [2022-09-16 11:01:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:01:59,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118899924] [2022-09-16 11:01:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:01:59,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:01:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:01:59,987 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:01:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:01:59,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118899924] [2022-09-16 11:01:59,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118899924] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:01:59,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108547924] [2022-09-16 11:01:59,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:01:59,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:01:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:01:59,989 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:01:59,990 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:02:00,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:02:00,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:02:00,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 11:02:00,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:02:00,271 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:02:00,460 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:02:00,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:02:00,643 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:02:00,712 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:02:00,713 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:02:00,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:02:00,809 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:02:00,850 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:02:00,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 11:02:00,895 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:02:00,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:02:00,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_779) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:02:00,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_778) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_779) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:02:00,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_778 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_778) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_779) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:02:01,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:01,310 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:02:01,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:01,317 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 300 [2022-09-16 11:02:01,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 127 [2022-09-16 11:02:01,326 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 270 treesize of output 238 [2022-09-16 11:02:01,331 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:02:02,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:02,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-16 11:02:02,286 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:02:02,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108547924] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:02:02,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:02:02,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 11:02:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227790198] [2022-09-16 11:02:02,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:02:02,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:02:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:02:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:02:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2378, Unknown=14, NotChecked=300, Total=2862 [2022-09-16 11:02:02,288 INFO L87 Difference]: Start difference. First operand 115766 states and 517520 transitions. Second operand has 54 states, 53 states have (on average 5.018867924528302) internal successors, (266), 54 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:02:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:02:07,406 INFO L93 Difference]: Finished difference Result 179897 states and 785786 transitions. [2022-09-16 11:02:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 11:02:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 5.018867924528302) internal successors, (266), 54 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:02:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:02:09,345 INFO L225 Difference]: With dead ends: 179897 [2022-09-16 11:02:09,346 INFO L226 Difference]: Without dead ends: 178529 [2022-09-16 11:02:09,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 207 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=561, Invalid=5137, Unknown=14, NotChecked=450, Total=6162 [2022-09-16 11:02:09,348 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1038 mSDsluCounter, 7988 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 5072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2536 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:02:09,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 6010 Invalid, 5072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2474 Invalid, 0 Unknown, 2536 Unchecked, 1.0s Time] [2022-09-16 11:02:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178529 states. [2022-09-16 11:02:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178529 to 118134. [2022-09-16 11:02:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118134 states, 117980 states have (on average 4.476538396338363) internal successors, (528142), 118133 states have internal predecessors, (528142), 0 states have call successors, (0), 0 states have 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:02:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118134 states to 118134 states and 528142 transitions. [2022-09-16 11:02:17,603 INFO L78 Accepts]: Start accepts. Automaton has 118134 states and 528142 transitions. Word has length 120 [2022-09-16 11:02:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:02:17,603 INFO L495 AbstractCegarLoop]: Abstraction has 118134 states and 528142 transitions. [2022-09-16 11:02:17,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 5.018867924528302) internal successors, (266), 54 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:02:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 118134 states and 528142 transitions. [2022-09-16 11:02:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:02:17,609 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:02:17,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:02:17,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-09-16 11:02:17,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-09-16 11:02:17,832 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:02:17,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:02:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1741460306, now seen corresponding path program 3 times [2022-09-16 11:02:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:02:17,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090989358] [2022-09-16 11:02:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:02:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:18,705 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:02:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:02:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090989358] [2022-09-16 11:02:18,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090989358] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:02:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352478292] [2022-09-16 11:02:18,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 11:02:18,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:02:18,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:02:18,707 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:02:18,711 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:02:18,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-09-16 11:02:18,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:02:18,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 49 conjunts are in the unsatisfiable core [2022-09-16 11:02:18,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:02:19,125 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:02:19,410 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:02:19,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:02:19,891 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:02:19,993 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:02:19,993 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:02:20,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:02:20,044 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 20 treesize of output 22 [2022-09-16 11:02:20,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:02:20,228 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 11:02:20,229 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 25 treesize of output 12 [2022-09-16 11:02:20,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:02:20,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:02:20,316 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 c_~i_3~0) (forall ((v_ArrVal_825 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_825) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456)))) is different from false [2022-09-16 11:02:21,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:21,154 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 35 treesize of output 36 [2022-09-16 11:02:21,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:21,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 180 treesize of output 177 [2022-09-16 11:02:21,168 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 82 treesize of output 75 [2022-09-16 11:02:21,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 124 [2022-09-16 11:02:21,177 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 124 treesize of output 110 [2022-09-16 11:02:22,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:22,201 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 60 treesize of output 79 [2022-09-16 11:02:22,742 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:02:22,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352478292] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:02:22,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:02:22,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 63 [2022-09-16 11:02:22,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101062543] [2022-09-16 11:02:22,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:02:22,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-09-16 11:02:22,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:02:22,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-09-16 11:02:22,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3654, Unknown=34, NotChecked=122, Total=4032 [2022-09-16 11:02:22,745 INFO L87 Difference]: Start difference. First operand 118134 states and 528142 transitions. Second operand has 64 states, 63 states have (on average 4.476190476190476) internal successors, (282), 64 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:02:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:02:27,191 INFO L93 Difference]: Finished difference Result 181682 states and 788609 transitions. [2022-09-16 11:02:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 11:02:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 4.476190476190476) internal successors, (282), 64 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:02:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:02:29,058 INFO L225 Difference]: With dead ends: 181682 [2022-09-16 11:02:29,059 INFO L226 Difference]: Without dead ends: 181682 [2022-09-16 11:02:29,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2156 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=658, Invalid=8053, Unknown=35, NotChecked=184, Total=8930 [2022-09-16 11:02:29,060 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 636 mSDsluCounter, 7808 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 6607 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1674 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:02:29,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 6607 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1378 Invalid, 0 Unknown, 1674 Unchecked, 0.6s Time] [2022-09-16 11:02:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181682 states. [2022-09-16 11:02:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181682 to 117889. [2022-09-16 11:02:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117889 states, 117735 states have (on average 4.47740264152546) internal successors, (527147), 117888 states have internal predecessors, (527147), 0 states have call successors, (0), 0 states have 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:02:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117889 states to 117889 states and 527147 transitions. [2022-09-16 11:02:36,243 INFO L78 Accepts]: Start accepts. Automaton has 117889 states and 527147 transitions. Word has length 120 [2022-09-16 11:02:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:02:36,243 INFO L495 AbstractCegarLoop]: Abstraction has 117889 states and 527147 transitions. [2022-09-16 11:02:36,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 4.476190476190476) internal successors, (282), 64 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have 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:02:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 117889 states and 527147 transitions. [2022-09-16 11:02:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:02:36,247 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:02:36,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:02:36,265 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:02:36,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:02:36,448 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:02:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:02:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash -191958221, now seen corresponding path program 2 times [2022-09-16 11:02:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:02:36,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18759485] [2022-09-16 11:02:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:02:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:02:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:02:36,855 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:02:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:02:36,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18759485] [2022-09-16 11:02:36,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18759485] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:02:36,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663803721] [2022-09-16 11:02:36,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:02:36,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:02:36,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:02:36,857 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:02:36,858 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:02:36,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:02:36,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:02:36,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-16 11:02:36,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:02:36,999 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:02:37,020 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 11:02:37,021 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:02:37,231 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:02:37,232 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:02:37,690 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:02: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, 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:02:37,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:02:37,933 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:02:38,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:02:38,030 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:02:38,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 11:02:38,066 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:02:38,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:02:38,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_872) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 11:02:38,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_872) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 11:02:40,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int)) (or (forall ((v_ArrVal_872 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)))) is different from false [2022-09-16 11:02:40,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_871) |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)))) is different from false [2022-09-16 11:02:40,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_871) |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)))) is different from false [2022-09-16 11:02:40,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_871) |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)))) is different from false [2022-09-16 11:02:40,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_871) |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967296))) is different from false [2022-09-16 11:02:40,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_871) |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)))) is different from false [2022-09-16 11:02:40,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:40,286 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:02:40,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:02:40,296 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 1060 [2022-09-16 11:02:40,310 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 982 [2022-09-16 11:02:40,321 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 982 treesize of output 950 [2022-09-16 11:02:40,331 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 950 treesize of output 822 [2022-09-16 11:02:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:02:41,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663803721] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:02:41,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:02:41,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 55 [2022-09-16 11:02:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875033520] [2022-09-16 11:02:41,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:02:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-16 11:02:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:02:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-16 11:02:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2101, Unknown=8, NotChecked=792, Total=3080 [2022-09-16 11:02:41,308 INFO L87 Difference]: Start difference. First operand 117889 states and 527147 transitions. Second operand has 56 states, 55 states have (on average 5.763636363636364) internal successors, (317), 56 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:02:44,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse3 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) .cse1 (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= (select .cse2 4) 2147483647) (<= (select .cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483647) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select .cse3 (+ c_~X_0~0.offset 4)) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= (select .cse3 4) 2147483647) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (or .cse1 (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (<= (select .cse4 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= (select .cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_41| Int)) (or (forall ((v_ArrVal_872 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_41| v_ArrVal_872) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_41|)))) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:02:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:02:50,009 INFO L93 Difference]: Finished difference Result 222827 states and 963089 transitions. [2022-09-16 11:02:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 11:02:50,010 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 5.763636363636364) internal successors, (317), 56 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:02:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:02:53,877 INFO L225 Difference]: With dead ends: 222827 [2022-09-16 11:02:53,877 INFO L226 Difference]: Without dead ends: 221459 [2022-09-16 11:02:53,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=727, Invalid=5306, Unknown=9, NotChecked=1440, Total=7482 [2022-09-16 11:02:53,878 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 2252 mSDsluCounter, 7602 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 5708 SdHoareTripleChecker+Invalid, 6910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3366 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-09-16 11:02:53,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 5708 Invalid, 6910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 3389 Invalid, 0 Unknown, 3366 Unchecked, 1.6s Time] [2022-09-16 11:02:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221459 states. [2022-09-16 11:03:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221459 to 117931. [2022-09-16 11:03:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117931 states, 117777 states have (on average 4.4761965409205535) internal successors, (527193), 117930 states have internal predecessors, (527193), 0 states have call successors, (0), 0 states have 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:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117931 states to 117931 states and 527193 transitions. [2022-09-16 11:03:01,639 INFO L78 Accepts]: Start accepts. Automaton has 117931 states and 527193 transitions. Word has length 120 [2022-09-16 11:03:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:01,639 INFO L495 AbstractCegarLoop]: Abstraction has 117931 states and 527193 transitions. [2022-09-16 11:03:01,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 5.763636363636364) internal successors, (317), 56 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 117931 states and 527193 transitions. [2022-09-16 11:03:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:03:01,643 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:01,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:03:01,662 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:03:01,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:01,844 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:03:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1448097680, now seen corresponding path program 1 times [2022-09-16 11:03:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:01,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835370514] [2022-09-16 11:03:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:02,219 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:03:02,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:02,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835370514] [2022-09-16 11:03:02,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835370514] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:02,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584717013] [2022-09-16 11:03:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:02,221 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:03:02,222 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:03:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:02,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 11:03:02,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:02,662 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:03:02,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:02,859 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:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:03,278 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:03,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:03,330 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:03,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 11:03:03,347 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:03:03,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:03,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 11:03:03,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_916) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 11:03:03,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_916) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 11:03:03,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) is different from false [2022-09-16 11:03:05,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)))) is different from false [2022-09-16 11:03:05,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_915) |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)))) is different from false [2022-09-16 11:03:05,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_915) |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)))) is different from false [2022-09-16 11:03:05,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_915) |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967296))) is different from false [2022-09-16 11:03:05,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_915) |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)))) is different from false [2022-09-16 11:03:05,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-09-16 11:03:05,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:05,611 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 268 [2022-09-16 11:03:05,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 222 [2022-09-16 11:03:05,623 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 111 treesize of output 103 [2022-09-16 11:03:05,628 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 214 treesize of output 198 [2022-09-16 11:03:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:03:05,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584717013] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:05,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:05,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 52 [2022-09-16 11:03:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672964466] [2022-09-16 11:03:05,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:05,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-09-16 11:03:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:05,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-09-16 11:03:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1709, Unknown=9, NotChecked=828, Total=2756 [2022-09-16 11:03:05,958 INFO L87 Difference]: Start difference. First operand 117931 states and 527193 transitions. Second operand has 53 states, 52 states have (on average 5.038461538461538) internal successors, (262), 53 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:03:08,535 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483647) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 11:03:10,538 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_43| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_43| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_43|)) (forall ((v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_43| v_ArrVal_916) |v_thread1Thread1of1ForFork2_~#t3~0.base_43| v_ArrVal_917) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_43|)))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 11:03:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:03:46,027 INFO L93 Difference]: Finished difference Result 177444 states and 778686 transitions. [2022-09-16 11:03:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 11:03:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 5.038461538461538) internal successors, (262), 53 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:03:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:03:47,821 INFO L225 Difference]: With dead ends: 177444 [2022-09-16 11:03:47,821 INFO L226 Difference]: Without dead ends: 177444 [2022-09-16 11:03:47,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 205 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=397, Invalid=3176, Unknown=11, NotChecked=1386, Total=4970 [2022-09-16 11:03:47,839 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 695 mSDsluCounter, 5937 mSDsCounter, 0 mSdLazyCounter, 2619 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 4681 SdHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3187 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-09-16 11:03:47,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 4681 Invalid, 5843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2619 Invalid, 0 Unknown, 3187 Unchecked, 1.1s Time] [2022-09-16 11:03:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177444 states. [2022-09-16 11:03:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177444 to 118366. [2022-09-16 11:03:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118366 states, 118212 states have (on average 4.474994078435353) internal successors, (528998), 118365 states have internal predecessors, (528998), 0 states have call successors, (0), 0 states have 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,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118366 states to 118366 states and 528998 transitions. [2022-09-16 11:03:54,158 INFO L78 Accepts]: Start accepts. Automaton has 118366 states and 528998 transitions. Word has length 120 [2022-09-16 11:03:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:03:54,158 INFO L495 AbstractCegarLoop]: Abstraction has 118366 states and 528998 transitions. [2022-09-16 11:03:54,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 5.038461538461538) internal successors, (262), 53 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:03:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 118366 states and 528998 transitions. [2022-09-16 11:03:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-09-16 11:03:54,162 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:03:54,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:03:54,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-09-16 11:03:54,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:54,363 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:03:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:03:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1448097677, now seen corresponding path program 1 times [2022-09-16 11:03:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:03:54,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297419270] [2022-09-16 11:03:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:03:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:54,770 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:03:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:03:54,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297419270] [2022-09-16 11:03:54,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297419270] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:03:54,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285414083] [2022-09-16 11:03:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:03:54,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:03:54,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:03:54,780 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:03:55,170 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:03:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:03:55,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 39 conjunts are in the unsatisfiable core [2022-09-16 11:03:55,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:03:55,508 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:03:55,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:55,658 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:03:55,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:55,778 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:03:55,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:03:55,827 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:03:55,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 11:03:55,861 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:03:55,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:03:55,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:03:55,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_961) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 11:03:55,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_961) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:03:55,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2022-09-16 11:03:57,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))))) is different from false [2022-09-16 11:03:57,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-09-16 11:03:57,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 11:03:58,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 11:03:58,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 11:03:58,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:58,074 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:03:58,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:03:58,084 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 618 treesize of output 596 [2022-09-16 11:03:58,093 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 582 treesize of output 518 [2022-09-16 11:03:58,101 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 518 treesize of output 486 [2022-09-16 11:03:58,108 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 486 treesize of output 470 [2022-09-16 11:03:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:03:58,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285414083] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:03:58,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:03:58,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-09-16 11:03:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659002744] [2022-09-16 11:03:58,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:03:58,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-16 11:03:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:03:58,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-16 11:03:58,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1898, Unknown=9, NotChecked=864, Total=2970 [2022-09-16 11:03:58,853 INFO L87 Difference]: Start difference. First operand 118366 states and 528998 transitions. Second operand has 55 states, 54 states have (on average 4.925925925925926) internal successors, (266), 55 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:59,242 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))))) is different from false [2022-09-16 11:03:59,245 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 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))))) is different from false [2022-09-16 11:03:59,248 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))))) is different from false [2022-09-16 11:03:59,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (and (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 4) 2147483648)))) is different from false [2022-09-16 11:03:59,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 2147483648)) (<= (+ |c_ULTIMATE.start_main_#t~ret27#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 11:03:59,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_960 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:04:01,262 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_45| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_45|)) (forall ((v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_961) |v_thread1Thread1of1ForFork2_~#t3~0.base_45| v_ArrVal_962) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 11:05:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:02,479 INFO L93 Difference]: Finished difference Result 177277 states and 776076 transitions. [2022-09-16 11:05:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 11:05:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 4.925925925925926) internal successors, (266), 55 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-09-16 11:05:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:05,076 INFO L225 Difference]: With dead ends: 177277 [2022-09-16 11:05:05,077 INFO L226 Difference]: Without dead ends: 176221 [2022-09-16 11:05:05,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=382, Invalid=3419, Unknown=45, NotChecked=2160, Total=6006 [2022-09-16 11:05:05,078 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 819 mSDsluCounter, 5511 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 4776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2348 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:05,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 4352 Invalid, 4776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2386 Invalid, 0 Unknown, 2348 Unchecked, 1.0s Time] [2022-09-16 11:05:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176221 states. [2022-09-16 11:05:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176221 to 118168. [2022-09-16 11:05:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118168 states, 118014 states have (on average 4.475333435016185) internal successors, (528152), 118167 states have internal predecessors, (528152), 0 states have call successors, (0), 0 states have 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:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118168 states to 118168 states and 528152 transitions. [2022-09-16 11:05:13,175 INFO L78 Accepts]: Start accepts. Automaton has 118168 states and 528152 transitions. Word has length 120 [2022-09-16 11:05:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-09-16 11:05:13,175 INFO L495 AbstractCegarLoop]: Abstraction has 118168 states and 528152 transitions. [2022-09-16 11:05:13,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 4.925925925925926) internal successors, (266), 55 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 118168 states and 528152 transitions. [2022-09-16 11:05:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-09-16 11:05:13,180 INFO L187 NwaCegarLoop]: Found error trace [2022-09-16 11:05:13,180 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:05:13,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-09-16 11:05:13,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:13,381 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-09-16 11:05:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:05:13,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1463646052, now seen corresponding path program 1 times [2022-09-16 11:05:13,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:05:13,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099107467] [2022-09-16 11:05:13,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:05:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:13,780 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:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:05:13,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099107467] [2022-09-16 11:05:13,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099107467] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:05:13,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562168562] [2022-09-16 11:05:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:05:13,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:13,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:05:13,782 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:05:13,783 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:05:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:05:13,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 11:05:13,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:05:13,932 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:14,046 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:05:14,046 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:05:14,233 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:05:14,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:14,406 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:05:14,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:05:14,493 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:05:14,520 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:05:14,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-09-16 11:05:14,573 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:14,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:05:14,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:05:14,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 11:05:14,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2022-09-16 11:05:14,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-09-16 11:05:14,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)))) is different from false [2022-09-16 11:05:14,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) |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:05:14,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1006) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) |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:05:14,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:14,783 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:14,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:05:14,793 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 300 [2022-09-16 11:05:14,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2022-09-16 11:05:14,805 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 270 treesize of output 238 [2022-09-16 11:05:14,811 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 114 [2022-09-16 11:05:15,557 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:05:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 11:05:15,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562168562] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:05:15,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:05:15,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 11:05:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501082210] [2022-09-16 11:05:15,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:05:15,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 11:05:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:05:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 11:05:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1962, Unknown=7, NotChecked=672, Total=2862 [2022-09-16 11:05:15,579 INFO L87 Difference]: Start difference. First operand 118168 states and 528152 transitions. Second operand has 54 states, 53 states have (on average 5.0754716981132075) internal successors, (269), 54 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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,453 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 4)) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 11:05:20,456 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1008) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 11:05:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-16 11:05:23,558 INFO L93 Difference]: Finished difference Result 189681 states and 824099 transitions. [2022-09-16 11:05:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 11:05:23,559 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 5.0754716981132075) internal successors, (269), 54 states have internal predecessors, (269), 0 states have call successors, (0), 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 121 [2022-09-16 11:05:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-09-16 11:05:25,545 INFO L225 Difference]: With dead ends: 189681 [2022-09-16 11:05:25,545 INFO L226 Difference]: Without dead ends: 189681 [2022-09-16 11:05:25,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=482, Invalid=3835, Unknown=9, NotChecked=1224, Total=5550 [2022-09-16 11:05:25,546 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 649 mSDsluCounter, 4093 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 3855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-09-16 11:05:25,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 3293 Invalid, 3855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1692 Invalid, 0 Unknown, 2129 Unchecked, 0.7s Time] Received shutdown request... [2022-09-16 11:05:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189681 states. [2022-09-16 11:05:26,478 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 58 remaining) [2022-09-16 11:05:26,484 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 11:05:26,484 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 11:05:26,507 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:05:26,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:05:26,685 WARN L619 AbstractCegarLoop]: Verification canceled: while executing MinimizeSevpa. [2022-09-16 11:05:26,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 58 remaining) [2022-09-16 11:05:26,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 58 remaining) [2022-09-16 11:05:26,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 58 remaining) [2022-09-16 11:05:26,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 58 remaining) [2022-09-16 11:05:26,689 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 58 remaining) [2022-09-16 11:05:26,690 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork2Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork2Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 58 remaining) [2022-09-16 11:05:26,691 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 58 remaining) [2022-09-16 11:05:26,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 58 remaining) [2022-09-16 11:05:26,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 58 remaining) [2022-09-16 11:05:26,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 58 remaining) [2022-09-16 11:05:26,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 58 remaining) [2022-09-16 11:05:26,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 58 remaining) [2022-09-16 11:05:26,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 58 remaining) [2022-09-16 11:05:26,693 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 58 remaining) [2022-09-16 11:05:26,699 INFO L444 BasicCegarLoop]: Path program histogram: [3, 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] [2022-09-16 11:05:26,704 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 11:05:26,704 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 11:05:26,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 11:05:26 BasicIcfg [2022-09-16 11:05:26,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 11:05:26,714 INFO L158 Benchmark]: Toolchain (without parser) took 596719.84ms. Allocated memory was 179.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 123.0MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-09-16 11:05:26,714 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 179.3MB. Free memory was 139.9MB in the beginning and 139.8MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 11:05:26,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.85ms. Allocated memory is still 179.3MB. Free memory was 122.8MB in the beginning and 153.4MB in the end (delta: -30.6MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-09-16 11:05:26,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.66ms. Allocated memory is still 179.3MB. Free memory was 153.4MB in the beginning and 150.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 11:05:26,714 INFO L158 Benchmark]: Boogie Preprocessor took 45.52ms. Allocated memory is still 179.3MB. Free memory was 150.8MB in the beginning and 149.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-16 11:05:26,714 INFO L158 Benchmark]: RCFGBuilder took 1036.35ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 149.0MB in the beginning and 169.0MB in the end (delta: -20.0MB). Peak memory consumption was 62.3MB. Max. memory is 8.0GB. [2022-09-16 11:05:26,715 INFO L158 Benchmark]: TraceAbstraction took 595171.45ms. Allocated memory was 216.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 168.5MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-09-16 11:05:26,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 179.3MB. Free memory was 139.9MB in the beginning and 139.8MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 413.85ms. Allocated memory is still 179.3MB. Free memory was 122.8MB in the beginning and 153.4MB in the end (delta: -30.6MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.66ms. Allocated memory is still 179.3MB. Free memory was 153.4MB in the beginning and 150.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.52ms. Allocated memory is still 179.3MB. Free memory was 150.8MB in the beginning and 149.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1036.35ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 149.0MB in the beginning and 169.0MB in the end (delta: -20.0MB). Peak memory consumption was 62.3MB. Max. memory is 8.0GB. * TraceAbstraction took 595171.45ms. Allocated memory was 216.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 168.5MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 298 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 594.9s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 309.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21384 SdHoareTripleChecker+Valid, 19.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21384 mSDsluCounter, 87039 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36239 IncrementalHoareTripleChecker+Unchecked, 107104 mSDsCounter, 907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40952 IncrementalHoareTripleChecker+Invalid, 78098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 907 mSolverCounterUnsat, 6258 mSDtfsCounter, 40952 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6179 GetRequests, 4718 SyntacticMatches, 69 SemanticMatches, 1392 ConstructedPredicates, 141 IntricatePredicates, 6 DeprecatedPredicates, 18624 ImplicationChecksByTransitivity, 171.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127433occurred in iteration=25, InterpolantAutomatonStates: 618, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 214.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 2030073 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 55.8s InterpolantComputationTime, 6445 NumberOfCodeBlocks, 6409 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8915 ConstructedInterpolants, 484 QuantifiedInterpolants, 73606 SizeOfPredicates, 409 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 732 ConjunctsInUnsatCore, 80 InterpolantComputations, 12 PerfectInterpolantSequences, 202/954 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown