/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-08 15:46:13,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-08 15:46:13,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-08 15:46:13,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-08 15:46:13,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-08 15:46:13,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-08 15:46:13,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-08 15:46:13,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-08 15:46:13,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-08 15:46:13,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-08 15:46:13,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-08 15:46:13,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-08 15:46:13,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-08 15:46:13,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-08 15:46:13,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-08 15:46:13,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-08 15:46:13,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-08 15:46:13,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-08 15:46:13,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-08 15:46:13,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-08 15:46:13,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-08 15:46:13,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-08 15:46:13,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-08 15:46:13,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-08 15:46:13,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-08 15:46:13,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-08 15:46:13,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-08 15:46:13,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-08 15:46:13,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-08 15:46:13,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-08 15:46:13,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-08 15:46:13,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-08 15:46:13,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-08 15:46:13,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-08 15:46:13,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-08 15:46:13,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-08 15:46:13,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-08 15:46:13,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-08 15:46:13,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-08 15:46:13,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-08 15:46:13,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-08 15:46:13,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-08 15:46:13,979 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-08 15:46:13,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-08 15:46:13,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-08 15:46:13,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-08 15:46:13,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-08 15:46:13,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-08 15:46:13,985 INFO L138 SettingsManager]: * Use SBE=true [2021-10-08 15:46:13,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-08 15:46:13,986 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-08 15:46:13,986 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-08 15:46:13,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-08 15:46:13,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-08 15:46:13,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-08 15:46:13,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-08 15:46:13,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-08 15:46:13,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-08 15:46:13,988 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-08 15:46:13,989 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-08 15:46:13,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-08 15:46:13,989 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-08 15:46:13,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-08 15:46:13,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-08 15:46:13,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-08 15:46:13,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-08 15:46:13,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 15:46:13,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-08 15:46:13,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-08 15:46:13,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-08 15:46:13,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-08 15:46:13,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-08 15:46:13,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-08 15:46:13,992 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-08 15:46:13,993 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-2/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 [2021-10-08 15:46:14,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-08 15:46:14,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-08 15:46:14,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-08 15:46:14,427 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-08 15:46:14,428 INFO L275 PluginConnector]: CDTParser initialized [2021-10-08 15:46:14,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2021-10-08 15:46:14,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bb4dbb41e/0be133e0da7c4bcb915794702f36a925/FLAG6d78501df [2021-10-08 15:46:15,145 INFO L306 CDTParser]: Found 1 translation units. [2021-10-08 15:46:15,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2021-10-08 15:46:15,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bb4dbb41e/0be133e0da7c4bcb915794702f36a925/FLAG6d78501df [2021-10-08 15:46:15,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bb4dbb41e/0be133e0da7c4bcb915794702f36a925 [2021-10-08 15:46:15,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-08 15:46:15,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-08 15:46:15,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-08 15:46:15,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-08 15:46:15,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-08 15:46:15,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:15,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f024db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15, skipping insertion in model container [2021-10-08 15:46:15,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:15,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-08 15:46:15,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-08 15:46:15,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3997,4010] [2021-10-08 15:46:15,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 15:46:15,836 INFO L203 MainTranslator]: Completed pre-run [2021-10-08 15:46:15,878 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3997,4010] [2021-10-08 15:46:15,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 15:46:15,919 INFO L208 MainTranslator]: Completed translation [2021-10-08 15:46:15,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15 WrapperNode [2021-10-08 15:46:15,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-08 15:46:15,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-08 15:46:15,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-08 15:46:15,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-08 15:46:15,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:15,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-08 15:46:16,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-08 15:46:16,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-08 15:46:16,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-08 15:46:16,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-08 15:46:16,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-08 15:46:16,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-08 15:46:16,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-08 15:46:16,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (1/1) ... [2021-10-08 15:46:16,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 15:46:16,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:16,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-08 15:46:16,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-08 15:46:16,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-08 15:46:16,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-08 15:46:16,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-08 15:46:16,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-08 15:46:16,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-08 15:46:16,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-08 15:46:16,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-08 15:46:16,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-08 15:46:16,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-08 15:46:16,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-08 15:46:16,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-08 15:46:16,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-08 15:46:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-08 15:46:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-08 15:46:16,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-08 15:46:16,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-08 15:46:16,211 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-08 15:46:17,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-08 15:46:17,686 INFO L299 CfgBuilder]: Removed 50 assume(true) statements. [2021-10-08 15:46:17,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 03:46:17 BoogieIcfgContainer [2021-10-08 15:46:17,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-08 15:46:17,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-08 15:46:17,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-08 15:46:17,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-08 15:46:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.10 03:46:15" (1/3) ... [2021-10-08 15:46:17,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2132d15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 03:46:17, skipping insertion in model container [2021-10-08 15:46:17,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:15" (2/3) ... [2021-10-08 15:46:17,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2132d15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 03:46:17, skipping insertion in model container [2021-10-08 15:46:17,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 03:46:17" (3/3) ... [2021-10-08 15:46:17,699 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2021-10-08 15:46:17,705 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-08 15:46:17,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-08 15:46:17,705 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-10-08 15:46:17,706 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-08 15:46:17,757 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,757 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,757 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,757 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,758 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,758 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,758 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,758 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,759 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,759 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,759 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,759 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,760 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,760 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,760 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,760 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,761 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,761 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,761 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,762 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,762 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,762 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,762 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,762 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,763 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,763 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,763 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,764 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,764 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,764 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,764 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,764 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,765 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,765 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,765 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,767 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,767 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,767 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,767 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,768 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,768 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,771 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,772 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,772 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,772 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,773 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,773 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,773 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,773 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,773 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,773 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,774 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,774 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,774 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,776 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,776 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,776 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,778 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,778 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,778 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,779 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,779 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,779 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,779 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,780 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,780 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,780 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,780 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,781 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,781 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,781 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,781 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,782 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,782 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,782 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,782 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,782 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,783 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,783 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,784 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,784 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,784 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,785 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,785 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,785 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,785 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,785 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,787 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,787 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,788 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,788 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,788 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,789 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,789 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,789 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,789 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,789 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,790 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,790 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,790 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,791 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,791 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,791 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,791 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,791 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,791 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,792 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,792 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,792 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,793 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,793 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,793 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,793 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,793 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,794 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,794 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,794 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,794 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,795 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,795 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,795 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,795 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,795 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,796 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,796 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,796 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,796 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,796 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,797 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,797 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,797 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,797 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,797 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,798 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,798 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,798 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,798 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,798 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,799 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,800 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,800 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,800 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,800 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,800 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,800 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,801 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,801 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,801 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,801 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,801 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,802 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,802 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,802 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,803 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,803 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,804 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,804 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,807 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,808 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,808 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,808 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,808 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,809 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,809 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,809 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,809 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,810 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,810 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,810 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,812 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,813 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,813 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,813 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,813 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,814 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,814 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,814 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,814 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,814 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,815 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,815 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,816 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,817 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,817 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,817 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,817 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,819 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,819 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,819 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:17,829 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-08 15:46:17,881 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-08 15:46:17,890 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-08 15:46:17,890 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-10-08 15:46:17,917 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-08 15:46:17,934 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 360 places, 376 transitions, 776 flow [2021-10-08 15:46:17,937 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 360 places, 376 transitions, 776 flow [2021-10-08 15:46:17,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 360 places, 376 transitions, 776 flow [2021-10-08 15:46:18,091 INFO L129 PetriNetUnfolder]: 26/373 cut-off events. [2021-10-08 15:46:18,092 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-08 15:46:18,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 373 events. 26/373 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 248 event pairs, 0 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 344. Up to 2 conditions per place. [2021-10-08 15:46:18,104 INFO L116 LiptonReduction]: Number of co-enabled transitions 510 [2021-10-08 15:46:39,895 INFO L131 LiptonReduction]: Checked pairs total: 1215 [2021-10-08 15:46:39,895 INFO L133 LiptonReduction]: Total number of compositions: 444 [2021-10-08 15:46:39,904 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 61 transitions, 146 flow [2021-10-08 15:46:39,933 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 234 states, 184 states have (on average 3.0489130434782608) internal successors, (561), 233 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 184 states have (on average 3.0489130434782608) internal successors, (561), 233 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-08 15:46:39,942 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:39,943 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-08 15:46:39,943 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 1 times [2021-10-08 15:46:39,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:39,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144511716] [2021-10-08 15:46:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:39,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:40,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:40,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144511716] [2021-10-08 15:46:40,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144511716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:40,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:40,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-08 15:46:40,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3805517] [2021-10-08 15:46:40,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-08 15:46:40,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-08 15:46:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 15:46:40,110 INFO L87 Difference]: Start difference. First operand has 234 states, 184 states have (on average 3.0489130434782608) internal successors, (561), 233 states have internal predecessors, (561), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:40,140 INFO L93 Difference]: Finished difference Result 232 states and 559 transitions. [2021-10-08 15:46:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-08 15:46:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-10-08 15:46:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:40,157 INFO L225 Difference]: With dead ends: 232 [2021-10-08 15:46:40,157 INFO L226 Difference]: Without dead ends: 232 [2021-10-08 15:46:40,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 15:46:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-08 15:46:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-10-08 15:46:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 184 states have (on average 3.0380434782608696) internal successors, (559), 231 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 559 transitions. [2021-10-08 15:46:40,229 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 559 transitions. Word has length 1 [2021-10-08 15:46:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:40,230 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 559 transitions. [2021-10-08 15:46:40,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 559 transitions. [2021-10-08 15:46:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 15:46:40,231 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:40,231 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 15:46:40,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-08 15:46:40,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash 52296, now seen corresponding path program 1 times [2021-10-08 15:46:40,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:40,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333159686] [2021-10-08 15:46:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:40,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:40,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:40,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333159686] [2021-10-08 15:46:40,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333159686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:40,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:40,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:40,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288234998] [2021-10-08 15:46:40,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:40,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:40,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:40,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:40,424 INFO L87 Difference]: Start difference. First operand 232 states and 559 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:40,502 INFO L93 Difference]: Finished difference Result 230 states and 557 transitions. [2021-10-08 15:46:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:40,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-10-08 15:46:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:40,512 INFO L225 Difference]: With dead ends: 230 [2021-10-08 15:46:40,513 INFO L226 Difference]: Without dead ends: 230 [2021-10-08 15:46:40,516 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-08 15:46:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-08 15:46:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 3.027173913043478) internal successors, (557), 229 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 557 transitions. [2021-10-08 15:46:40,562 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 557 transitions. Word has length 2 [2021-10-08 15:46:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:40,563 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 557 transitions. [2021-10-08 15:46:40,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 557 transitions. [2021-10-08 15:46:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 15:46:40,567 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:40,567 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 15:46:40,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-08 15:46:40,568 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash 52314, now seen corresponding path program 1 times [2021-10-08 15:46:40,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:40,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521531634] [2021-10-08 15:46:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:40,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:40,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:40,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521531634] [2021-10-08 15:46:40,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521531634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:40,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:40,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:40,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295984688] [2021-10-08 15:46:40,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:40,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:40,673 INFO L87 Difference]: Start difference. First operand 230 states and 557 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:40,753 INFO L93 Difference]: Finished difference Result 453 states and 1107 transitions. [2021-10-08 15:46:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-10-08 15:46:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:40,759 INFO L225 Difference]: With dead ends: 453 [2021-10-08 15:46:40,766 INFO L226 Difference]: Without dead ends: 453 [2021-10-08 15:46:40,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-08 15:46:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 233. [2021-10-08 15:46:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 187 states have (on average 3.037433155080214) internal successors, (568), 232 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 568 transitions. [2021-10-08 15:46:40,798 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 568 transitions. Word has length 2 [2021-10-08 15:46:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:40,799 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 568 transitions. [2021-10-08 15:46:40,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 568 transitions. [2021-10-08 15:46:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 15:46:40,800 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:40,800 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 15:46:40,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-08 15:46:40,802 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 52295, now seen corresponding path program 1 times [2021-10-08 15:46:40,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:40,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092435791] [2021-10-08 15:46:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:40,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:40,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:40,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092435791] [2021-10-08 15:46:40,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092435791] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:40,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:40,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:40,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497486284] [2021-10-08 15:46:40,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:40,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:40,884 INFO L87 Difference]: Start difference. First operand 233 states and 568 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:40,910 INFO L93 Difference]: Finished difference Result 231 states and 565 transitions. [2021-10-08 15:46:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:40,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-10-08 15:46:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:40,914 INFO L225 Difference]: With dead ends: 231 [2021-10-08 15:46:40,914 INFO L226 Difference]: Without dead ends: 231 [2021-10-08 15:46:40,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-08 15:46:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-10-08 15:46:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 3.021390374331551) internal successors, (565), 230 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 565 transitions. [2021-10-08 15:46:40,924 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 565 transitions. Word has length 2 [2021-10-08 15:46:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:40,925 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 565 transitions. [2021-10-08 15:46:40,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 565 transitions. [2021-10-08 15:46:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:40,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:40,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:40,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-08 15:46:40,926 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1625130, now seen corresponding path program 1 times [2021-10-08 15:46:40,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:40,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047287691] [2021-10-08 15:46:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:40,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:40,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:40,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047287691] [2021-10-08 15:46:40,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047287691] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:40,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795914350] [2021-10-08 15:46:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:40,977 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:40,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:40,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:41,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-08 15:46:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:41,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 15:46:41,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:41,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795914350] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:41,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:41,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2021-10-08 15:46:41,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429496214] [2021-10-08 15:46:41,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:41,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:41,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:41,191 INFO L87 Difference]: Start difference. First operand 231 states and 565 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:41,276 INFO L93 Difference]: Finished difference Result 446 states and 1100 transitions. [2021-10-08 15:46:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-08 15:46:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:41,281 INFO L225 Difference]: With dead ends: 446 [2021-10-08 15:46:41,282 INFO L226 Difference]: Without dead ends: 446 [2021-10-08 15:46:41,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-10-08 15:46:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 228. [2021-10-08 15:46:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 187 states have (on average 3.0053475935828877) internal successors, (562), 227 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 562 transitions. [2021-10-08 15:46:41,295 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 562 transitions. Word has length 3 [2021-10-08 15:46:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:41,295 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 562 transitions. [2021-10-08 15:46:41,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 562 transitions. [2021-10-08 15:46:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:41,296 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:41,296 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:41,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:41,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:41,511 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1625131, now seen corresponding path program 1 times [2021-10-08 15:46:41,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:41,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840588782] [2021-10-08 15:46:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:41,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:41,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:41,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840588782] [2021-10-08 15:46:41,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840588782] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:41,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096828460] [2021-10-08 15:46:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:41,557 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:41,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:41,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-08 15:46:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:41,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 15:46:41,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:41,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096828460] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:41,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 15:46:41,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-08 15:46:41,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814076574] [2021-10-08 15:46:41,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 15:46:41,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:41,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 15:46:41,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:41,705 INFO L87 Difference]: Start difference. First operand 228 states and 562 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:41,774 INFO L93 Difference]: Finished difference Result 667 states and 1648 transitions. [2021-10-08 15:46:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 3 [2021-10-08 15:46:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:41,781 INFO L225 Difference]: With dead ends: 667 [2021-10-08 15:46:41,781 INFO L226 Difference]: Without dead ends: 667 [2021-10-08 15:46:41,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-10-08 15:46:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 231. [2021-10-08 15:46:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 190 states have (on average 3.0105263157894737) internal successors, (572), 230 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 572 transitions. [2021-10-08 15:46:41,795 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 572 transitions. Word has length 3 [2021-10-08 15:46:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:41,796 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 572 transitions. [2021-10-08 15:46:41,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 572 transitions. [2021-10-08 15:46:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:41,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:41,797 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:41,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:42,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-08 15:46:42,012 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1627069, now seen corresponding path program 1 times [2021-10-08 15:46:42,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156008367] [2021-10-08 15:46:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156008367] [2021-10-08 15:46:42,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156008367] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:42,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:42,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:42,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26433450] [2021-10-08 15:46:42,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:42,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:42,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:42,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,058 INFO L87 Difference]: Start difference. First operand 231 states and 572 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:42,081 INFO L93 Difference]: Finished difference Result 229 states and 568 transitions. [2021-10-08 15:46:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-08 15:46:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:42,084 INFO L225 Difference]: With dead ends: 229 [2021-10-08 15:46:42,085 INFO L226 Difference]: Without dead ends: 229 [2021-10-08 15:46:42,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-10-08 15:46:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-10-08 15:46:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 2.9894736842105263) internal successors, (568), 228 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 568 transitions. [2021-10-08 15:46:42,094 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 568 transitions. Word has length 3 [2021-10-08 15:46:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:42,094 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 568 transitions. [2021-10-08 15:46:42,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 568 transitions. [2021-10-08 15:46:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:42,095 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:42,095 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:42,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-08 15:46:42,095 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1627027, now seen corresponding path program 1 times [2021-10-08 15:46:42,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83101397] [2021-10-08 15:46:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83101397] [2021-10-08 15:46:42,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83101397] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:42,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:42,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:42,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384662944] [2021-10-08 15:46:42,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:42,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,126 INFO L87 Difference]: Start difference. First operand 229 states and 568 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:42,146 INFO L93 Difference]: Finished difference Result 227 states and 564 transitions. [2021-10-08 15:46:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:42,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-08 15:46:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:42,149 INFO L225 Difference]: With dead ends: 227 [2021-10-08 15:46:42,149 INFO L226 Difference]: Without dead ends: 227 [2021-10-08 15:46:42,149 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-10-08 15:46:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-10-08 15:46:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 2.968421052631579) internal successors, (564), 226 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 564 transitions. [2021-10-08 15:46:42,158 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 564 transitions. Word has length 3 [2021-10-08 15:46:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:42,158 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 564 transitions. [2021-10-08 15:46:42,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 564 transitions. [2021-10-08 15:46:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 15:46:42,159 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:42,159 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-08 15:46:42,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-08 15:46:42,160 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash 50382427, now seen corresponding path program 2 times [2021-10-08 15:46:42,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877049543] [2021-10-08 15:46:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877049543] [2021-10-08 15:46:42,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877049543] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:42,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507898369] [2021-10-08 15:46:42,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 15:46:42,198 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:42,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:42,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-08 15:46:42,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 15:46:42,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 15:46:42,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 15:46:42,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:42,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507898369] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:42,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:42,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-08 15:46:42,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946740789] [2021-10-08 15:46:42,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:42,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 15:46:42,314 INFO L87 Difference]: Start difference. First operand 227 states and 564 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:42,332 INFO L93 Difference]: Finished difference Result 224 states and 561 transitions. [2021-10-08 15:46:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 4 [2021-10-08 15:46:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:42,335 INFO L225 Difference]: With dead ends: 224 [2021-10-08 15:46:42,335 INFO L226 Difference]: Without dead ends: 224 [2021-10-08 15:46:42,335 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 15:46:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-08 15:46:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-10-08 15:46:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 184 states have (on average 2.9619565217391304) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 545 transitions. [2021-10-08 15:46:42,344 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 545 transitions. Word has length 4 [2021-10-08 15:46:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:42,344 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 545 transitions. [2021-10-08 15:46:42,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 545 transitions. [2021-10-08 15:46:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 15:46:42,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:42,345 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-08 15:46:42,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:42,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:42,561 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 50442308, now seen corresponding path program 1 times [2021-10-08 15:46:42,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782849568] [2021-10-08 15:46:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782849568] [2021-10-08 15:46:42,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782849568] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:42,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:42,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:42,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992057045] [2021-10-08 15:46:42,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:42,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,597 INFO L87 Difference]: Start difference. First operand 218 states and 545 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:42,617 INFO L93 Difference]: Finished difference Result 217 states and 544 transitions. [2021-10-08 15:46:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-08 15:46:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:42,620 INFO L225 Difference]: With dead ends: 217 [2021-10-08 15:46:42,620 INFO L226 Difference]: Without dead ends: 217 [2021-10-08 15:46:42,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-08 15:46:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-10-08 15:46:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 184 states have (on average 2.9565217391304346) internal successors, (544), 216 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 544 transitions. [2021-10-08 15:46:42,629 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 544 transitions. Word has length 4 [2021-10-08 15:46:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:42,629 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 544 transitions. [2021-10-08 15:46:42,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 544 transitions. [2021-10-08 15:46:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 15:46:42,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:42,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-08 15:46:42,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-08 15:46:42,630 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 50442269, now seen corresponding path program 1 times [2021-10-08 15:46:42,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137850136] [2021-10-08 15:46:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137850136] [2021-10-08 15:46:42,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137850136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:42,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:42,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:42,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539105858] [2021-10-08 15:46:42,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:42,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:42,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,676 INFO L87 Difference]: Start difference. First operand 217 states and 544 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:42,695 INFO L93 Difference]: Finished difference Result 216 states and 543 transitions. [2021-10-08 15:46:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-08 15:46:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:42,697 INFO L225 Difference]: With dead ends: 216 [2021-10-08 15:46:42,697 INFO L226 Difference]: Without dead ends: 216 [2021-10-08 15:46:42,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-10-08 15:46:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-10-08 15:46:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 2.9510869565217392) internal successors, (543), 215 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 543 transitions. [2021-10-08 15:46:42,706 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 543 transitions. Word has length 4 [2021-10-08 15:46:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:42,706 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 543 transitions. [2021-10-08 15:46:42,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 543 transitions. [2021-10-08 15:46:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-08 15:46:42,707 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:42,707 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-08 15:46:42,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-08 15:46:42,708 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1563714513, now seen corresponding path program 1 times [2021-10-08 15:46:42,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782356477] [2021-10-08 15:46:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782356477] [2021-10-08 15:46:42,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782356477] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:42,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:42,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 15:46:42,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317511565] [2021-10-08 15:46:42,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:42,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:42,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,763 INFO L87 Difference]: Start difference. First operand 216 states and 543 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:42,799 INFO L93 Difference]: Finished difference Result 422 states and 1073 transitions. [2021-10-08 15:46:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-08 15:46:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:42,803 INFO L225 Difference]: With dead ends: 422 [2021-10-08 15:46:42,803 INFO L226 Difference]: Without dead ends: 422 [2021-10-08 15:46:42,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-08 15:46:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 219. [2021-10-08 15:46:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 187 states have (on average 2.935828877005348) internal successors, (549), 218 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 549 transitions. [2021-10-08 15:46:42,813 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 549 transitions. Word has length 5 [2021-10-08 15:46:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:42,813 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 549 transitions. [2021-10-08 15:46:42,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 549 transitions. [2021-10-08 15:46:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-08 15:46:42,814 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:42,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-08 15:46:42,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-08 15:46:42,815 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1230512457, now seen corresponding path program 1 times [2021-10-08 15:46:42,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:42,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298991744] [2021-10-08 15:46:42,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:42,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:42,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298991744] [2021-10-08 15:46:42,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298991744] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:42,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852040869] [2021-10-08 15:46:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:42,863 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:42,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:42,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:42,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-08 15:46:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:42,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-08 15:46:42,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:43,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852040869] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:43,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:43,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2021-10-08 15:46:43,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81561114] [2021-10-08 15:46:43,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 15:46:43,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:43,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 15:46:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-08 15:46:43,072 INFO L87 Difference]: Start difference. First operand 219 states and 549 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:43,221 INFO L93 Difference]: Finished difference Result 648 states and 1633 transitions. [2021-10-08 15:46:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-08 15:46:43,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-08 15:46:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:43,227 INFO L225 Difference]: With dead ends: 648 [2021-10-08 15:46:43,227 INFO L226 Difference]: Without dead ends: 648 [2021-10-08 15:46:43,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.5ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-08 15:46:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-10-08 15:46:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 223. [2021-10-08 15:46:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 2.910994764397906) internal successors, (556), 222 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 556 transitions. [2021-10-08 15:46:43,240 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 556 transitions. Word has length 6 [2021-10-08 15:46:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:43,240 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 556 transitions. [2021-10-08 15:46:43,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 556 transitions. [2021-10-08 15:46:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 15:46:43,241 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:43,241 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:43,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:43,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-08 15:46:43,455 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2060171545, now seen corresponding path program 1 times [2021-10-08 15:46:43,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:43,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329017215] [2021-10-08 15:46:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:43,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 15:46:43,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:43,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329017215] [2021-10-08 15:46:43,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329017215] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:43,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003328364] [2021-10-08 15:46:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:43,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:43,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:43,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-08 15:46:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:43,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-08 15:46:43,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:43,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003328364] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:43,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 15:46:43,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 8 [2021-10-08 15:46:43,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118135699] [2021-10-08 15:46:43,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-08 15:46:43,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-08 15:46:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-08 15:46:43,672 INFO L87 Difference]: Start difference. First operand 223 states and 556 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:44,166 INFO L93 Difference]: Finished difference Result 2500 states and 6402 transitions. [2021-10-08 15:46:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-08 15:46:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 7 [2021-10-08 15:46:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:44,210 INFO L225 Difference]: With dead ends: 2500 [2021-10-08 15:46:44,210 INFO L226 Difference]: Without dead ends: 2500 [2021-10-08 15:46:44,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 165.9ms TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2021-10-08 15:46:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2021-10-08 15:46:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 230. [2021-10-08 15:46:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 198 states have (on average 2.893939393939394) internal successors, (573), 229 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 573 transitions. [2021-10-08 15:46:44,254 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 573 transitions. Word has length 7 [2021-10-08 15:46:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:44,255 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 573 transitions. [2021-10-08 15:46:44,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 573 transitions. [2021-10-08 15:46:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 15:46:44,256 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:44,256 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:44,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:44,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:44,473 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash -508774202, now seen corresponding path program 1 times [2021-10-08 15:46:44,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:44,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515760682] [2021-10-08 15:46:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:44,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:44,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:44,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515760682] [2021-10-08 15:46:44,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515760682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:44,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:44,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 15:46:44,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937643719] [2021-10-08 15:46:44,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:44,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:44,512 INFO L87 Difference]: Start difference. First operand 230 states and 573 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:44,530 INFO L93 Difference]: Finished difference Result 227 states and 567 transitions. [2021-10-08 15:46:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-08 15:46:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:44,533 INFO L225 Difference]: With dead ends: 227 [2021-10-08 15:46:44,533 INFO L226 Difference]: Without dead ends: 227 [2021-10-08 15:46:44,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-10-08 15:46:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-10-08 15:46:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 198 states have (on average 2.8636363636363638) internal successors, (567), 226 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 567 transitions. [2021-10-08 15:46:44,541 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 567 transitions. Word has length 7 [2021-10-08 15:46:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:44,541 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 567 transitions. [2021-10-08 15:46:44,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 567 transitions. [2021-10-08 15:46:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-08 15:46:44,542 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:44,542 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:44,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-08 15:46:44,543 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1407870466, now seen corresponding path program 1 times [2021-10-08 15:46:44,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:44,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212383810] [2021-10-08 15:46:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:44,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 15:46:44,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:44,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212383810] [2021-10-08 15:46:44,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212383810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:44,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:44,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-08 15:46:44,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121487700] [2021-10-08 15:46:44,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 15:46:44,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 15:46:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:44,597 INFO L87 Difference]: Start difference. First operand 227 states and 567 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:44,719 INFO L93 Difference]: Finished difference Result 664 states and 1669 transitions. [2021-10-08 15:46:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-08 15:46:44,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-10-08 15:46:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:44,726 INFO L225 Difference]: With dead ends: 664 [2021-10-08 15:46:44,726 INFO L226 Difference]: Without dead ends: 664 [2021-10-08 15:46:44,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-08 15:46:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-10-08 15:46:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 239. [2021-10-08 15:46:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 210 states have (on average 2.8095238095238093) internal successors, (590), 238 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 590 transitions. [2021-10-08 15:46:44,742 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 590 transitions. Word has length 8 [2021-10-08 15:46:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:44,742 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 590 transitions. [2021-10-08 15:46:44,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 590 transitions. [2021-10-08 15:46:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 15:46:44,743 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:44,743 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2021-10-08 15:46:44,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-08 15:46:44,744 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:44,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2120722223, now seen corresponding path program 2 times [2021-10-08 15:46:44,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:44,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862539958] [2021-10-08 15:46:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:44,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:44,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:44,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862539958] [2021-10-08 15:46:44,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862539958] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:44,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016051385] [2021-10-08 15:46:44,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 15:46:44,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:44,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:44,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:44,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-08 15:46:44,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 15:46:44,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 15:46:44,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 15:46:44,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-08 15:46:44,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016051385] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:44,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:44,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-10-08 15:46:44,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036519678] [2021-10-08 15:46:44,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:44,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:44,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:44,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 15:46:44,950 INFO L87 Difference]: Start difference. First operand 239 states and 590 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:44,963 INFO L93 Difference]: Finished difference Result 236 states and 586 transitions. [2021-10-08 15:46:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 9 [2021-10-08 15:46:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:44,966 INFO L225 Difference]: With dead ends: 236 [2021-10-08 15:46:44,966 INFO L226 Difference]: Without dead ends: 236 [2021-10-08 15:46:44,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 15:46:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-08 15:46:44,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2021-10-08 15:46:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 202 states have (on average 2.8217821782178216) internal successors, (570), 227 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 570 transitions. [2021-10-08 15:46:44,975 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 570 transitions. Word has length 9 [2021-10-08 15:46:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:44,975 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 570 transitions. [2021-10-08 15:46:44,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-08 15:46:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 570 transitions. [2021-10-08 15:46:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 15:46:44,976 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:44,976 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:45,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:45,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-08 15:46:45,192 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 695664445, now seen corresponding path program 1 times [2021-10-08 15:46:45,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:45,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968581755] [2021-10-08 15:46:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:45,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-08 15:46:45,263 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-08 15:46:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-08 15:46:45,340 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-08 15:46:45,340 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-08 15:46:45,342 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:45,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-08 15:46:45,364 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-08 15:46:45,364 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-08 15:46:45,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.10 03:46:45 BasicIcfg [2021-10-08 15:46:45,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-08 15:46:45,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-08 15:46:45,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-08 15:46:45,473 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-08 15:46:45,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 03:46:17" (3/4) ... [2021-10-08 15:46:45,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-08 15:46:45,582 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/chl-node-trans.wvr.c-witness.graphml [2021-10-08 15:46:45,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-08 15:46:45,584 INFO L168 Benchmark]: Toolchain (without parser) took 30084.00 ms. Allocated memory was 152.0 MB in the beginning and 230.7 MB in the end (delta: 78.6 MB). Free memory was 125.9 MB in the beginning and 160.9 MB in the end (delta: -35.0 MB). Peak memory consumption was 44.3 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,585 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 80.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-08 15:46:45,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.68 ms. Allocated memory is still 152.0 MB. Free memory was 125.6 MB in the beginning and 113.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.14 ms. Allocated memory is still 152.0 MB. Free memory was 113.4 MB in the beginning and 110.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,586 INFO L168 Benchmark]: Boogie Preprocessor took 68.32 ms. Allocated memory is still 152.0 MB. Free memory was 110.7 MB in the beginning and 108.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,586 INFO L168 Benchmark]: RCFGBuilder took 1589.12 ms. Allocated memory is still 152.0 MB. Free memory was 108.4 MB in the beginning and 126.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 33.2 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,586 INFO L168 Benchmark]: TraceAbstraction took 27780.59 ms. Allocated memory was 152.0 MB in the beginning and 230.7 MB in the end (delta: 78.6 MB). Free memory was 125.4 MB in the beginning and 168.3 MB in the end (delta: -42.9 MB). Peak memory consumption was 35.3 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,587 INFO L168 Benchmark]: Witness Printer took 110.18 ms. Allocated memory is still 230.7 MB. Free memory was 167.8 MB in the beginning and 160.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:45,589 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.23 ms. Allocated memory is still 125.8 MB. Free memory is still 80.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 413.68 ms. Allocated memory is still 152.0 MB. Free memory was 125.6 MB in the beginning and 113.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 103.14 ms. Allocated memory is still 152.0 MB. Free memory was 113.4 MB in the beginning and 110.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.32 ms. Allocated memory is still 152.0 MB. Free memory was 110.7 MB in the beginning and 108.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1589.12 ms. Allocated memory is still 152.0 MB. Free memory was 108.4 MB in the beginning and 126.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 33.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27780.59 ms. Allocated memory was 152.0 MB in the beginning and 230.7 MB in the end (delta: 78.6 MB). Free memory was 125.4 MB in the beginning and 168.3 MB in the end (delta: -42.9 MB). Peak memory consumption was 35.3 MB. Max. memory is 8.0 GB. * Witness Printer took 110.18 ms. Allocated memory is still 230.7 MB. Free memory was 167.8 MB in the beginning and 160.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21958.1ms, 360 PlacesBefore, 65 PlacesAfterwards, 376 TransitionsBefore, 61 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 9 FixpointIterations, 344 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 0 ConcurrentYvCompositions, 20 ChoiceCompositions, 444 TotalNumberOfCompositions, 1215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 953, positive: 893, positive conditional: 0, positive unconditional: 893, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 353, positive: 337, positive conditional: 0, positive unconditional: 337, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 353, positive: 337, positive conditional: 0, positive unconditional: 337, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 953, positive: 556, positive conditional: 0, positive unconditional: 556, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 353, unknown conditional: 0, unknown unconditional: 353] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: integer overflow possible integer overflow possible We found a FailurePath: [L41] 0 int id_0, id_3, id_6, result_9, order1_10, order2_11, result_12, order1_13, order2_14, result_15, order1_16, order2_17; [L42] 0 int *get_2, *get_5, *get_8; [L43] 0 _Bool *contains_key_1, *contains_key_4, *contains_key_7; [L79] 0 pthread_t t1, t2, t3; [L82] 0 id_0 = __VERIFIER_nondet_int() [L83] 0 id_3 = __VERIFIER_nondet_int() [L84] 0 id_6 = __VERIFIER_nondet_int() [L85] 0 result_9 = __VERIFIER_nondet_int() [L86] 0 order1_10 = __VERIFIER_nondet_int() [L87] 0 order2_11 = __VERIFIER_nondet_int() [L88] 0 result_12 = __VERIFIER_nondet_int() [L89] 0 order1_13 = __VERIFIER_nondet_int() [L90] 0 order2_14 = __VERIFIER_nondet_int() [L91] 0 result_15 = __VERIFIER_nondet_int() [L92] 0 order1_16 = __VERIFIER_nondet_int() [L93] 0 order2_17 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L95] EXPR 0 id_0 + 1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L120] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L121] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={0:0}, get_5={0:0}, get_8={0:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L121] COND FALSE 0 !(i < size) [L124] 0 return arr; [L95] 0 get_2 = create_fresh_int_array(id_0 + 1) [L96] EXPR 0 id_3 + 1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L120] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L121] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={0:0}, get_8={0:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L121] COND FALSE 0 !(i < size) [L124] 0 return arr; [L96] 0 get_5 = create_fresh_int_array(id_3 + 1) [L97] EXPR 0 id_6 + 1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L120] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L121] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-3:0}, get_8={0:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L121] COND FALSE 0 !(i < size) [L124] 0 return arr; [L97] 0 get_8 = create_fresh_int_array(id_6 + 1) [L98] EXPR 0 id_0+1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L131] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L132] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-3:0}, get_8={-5:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L132] COND FALSE 0 !(i < size) [L135] 0 return arr; [L98] 0 contains_key_1 = create_fresh_bool_array(id_0+1) [L99] EXPR 0 id_3+1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L131] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L132] 0 int i = 0; VAL [contains_key_1={-6:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-3:0}, get_8={-5:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L132] COND FALSE 0 !(i < size) [L135] 0 return arr; [L99] 0 contains_key_4 = create_fresh_bool_array(id_3+1) [L100] EXPR 0 id_6+1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L131] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L132] 0 int i = 0; VAL [contains_key_1={-6:0}, contains_key_4={-7:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-3:0}, get_8={-5:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L132] COND FALSE 0 !(i < size) [L135] 0 return arr; [L100] 0 contains_key_7 = create_fresh_bool_array(id_6+1) [L103] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [contains_key_1={-6:0}, contains_key_4={-7:0}, contains_key_7={-8:0}, get_2={-2:0}, get_5={-3:0}, get_8={-5:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L50] EXPR 1 get_2[id_0] [L50] 1 order1_10 = get_2[id_0] [L51] EXPR 1 get_5[id_3] [L51] 1 order2_11 = get_5[id_3] [L52] EXPR 1 contains_key_1[id_0] [L52] EXPR 1 contains_key_1[id_0] && contains_key_4[id_3] [L52] EXPR 1 contains_key_4[id_3] [L52] EXPR 1 contains_key_1[id_0] && contains_key_4[id_3] [L52] 1 ( contains_key_1[id_0] && contains_key_4[id_3] ) ? ( ( order1_10 < order2_11 ) ? ( 0 - 1 ) : ( ( order1_10 > order2_11 ) ? 1 : 0 ) ) : ( get_2[id_0] - get_5[id_3] ) [L52] EXPR 1 get_2[id_0] [L52] EXPR 1 get_5[id_3] [L52] 1 get_2[id_0] - get_5[id_3] VAL [contains_key_1={-6:0}, contains_key_1[id_0]=257, contains_key_1[id_0] && contains_key_4[id_3]=0, contains_key_4={-7:0}, contains_key_4[id_3]=0, contains_key_7={-8:0}, get_2={-2:0}, get_2[id_0]=2147483657, get_5={-3:0}, get_5[id_3]=9, get_8={-5:0}, id_0=-1, id_3=-1, id_6=-1, order1_10=2147483657, order1_13=0, order1_16=0, order2_11=9, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 372 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 27479.4ms, OverallIterations: 18, TraceHistogramMax: 2, EmptinessCheckTime: 20.2ms, AutomataDifference: 1488.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22042.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 596 SDtfs, 1288 SDslu, 460 SDs, 0 SdLazy, 478 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 747.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 295.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=16, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 304.2ms AutomataMinimizationTime, 17 MinimizatonAttempts, 4211 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 118.6ms SsaConstructionTime, 493.5ms SatisfiabilityAnalysisTime, 857.3ms InterpolantComputationTime, 114 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 250 SizeOfPredicates, 12 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 20/32 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 proved your program to be incorrect! [2021-10-08 15:46:45,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...