/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/chromosome-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-06 16:17:07,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-06 16:17:07,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-06 16:17:07,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-06 16:17:07,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-06 16:17:07,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-06 16:17:07,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-06 16:17:07,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-06 16:17:07,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-06 16:17:07,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-06 16:17:07,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-06 16:17:07,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-06 16:17:07,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-06 16:17:07,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-06 16:17:07,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-06 16:17:07,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-06 16:17:07,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-06 16:17:07,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-06 16:17:07,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-06 16:17:07,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-06 16:17:07,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-06 16:17:07,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-06 16:17:07,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-06 16:17:07,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-06 16:17:07,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-06 16:17:07,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-06 16:17:07,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-06 16:17:07,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-06 16:17:07,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-06 16:17:07,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-06 16:17:07,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-06 16:17:07,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-06 16:17:07,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-06 16:17:07,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-06 16:17:07,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-06 16:17:07,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-06 16:17:07,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-06 16:17:07,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-06 16:17:07,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-06 16:17:07,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-06 16:17:07,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-06 16:17:07,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-06 16:17:07,940 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-06 16:17:07,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-06 16:17:07,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-06 16:17:07,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-06 16:17:07,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-06 16:17:07,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-06 16:17:07,943 INFO L138 SettingsManager]: * Use SBE=true [2021-10-06 16:17:07,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-06 16:17:07,943 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-06 16:17:07,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-06 16:17:07,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-06 16:17:07,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-06 16:17:07,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-06 16:17:07,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-06 16:17:07,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-06 16:17:07,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-06 16:17:07,945 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-06 16:17:07,945 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-06 16:17:07,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-06 16:17:07,945 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-06 16:17:07,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-06 16:17:07,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-06 16:17:07,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-06 16:17:07,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-06 16:17:07,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 16:17:07,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-06 16:17:07,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-06 16:17:07,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-06 16:17:07,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-06 16:17:07,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-06 16:17:07,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-06 16:17:07,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-06 16:17:07,948 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-06 16:17:08,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-06 16:17:08,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-06 16:17:08,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-06 16:17:08,388 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-06 16:17:08,389 INFO L275 PluginConnector]: CDTParser initialized [2021-10-06 16:17:08,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-06 16:17:08,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a1f214eb6/a42ce230f53947b28ee5d19dbadb6af5/FLAG818cbc2be [2021-10-06 16:17:09,127 INFO L306 CDTParser]: Found 1 translation units. [2021-10-06 16:17:09,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-06 16:17:09,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a1f214eb6/a42ce230f53947b28ee5d19dbadb6af5/FLAG818cbc2be [2021-10-06 16:17:09,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a1f214eb6/a42ce230f53947b28ee5d19dbadb6af5 [2021-10-06 16:17:09,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-06 16:17:09,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-06 16:17:09,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-06 16:17:09,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-06 16:17:09,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-06 16:17:09,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 04:17:09" (1/1) ... [2021-10-06 16:17:09,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d3820e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:09, skipping insertion in model container [2021-10-06 16:17:09,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 04:17:09" (1/1) ... [2021-10-06 16:17:09,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-06 16:17:09,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-06 16:17:09,885 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/chromosome-trans.wvr.c[2567,2580] [2021-10-06 16:17:09,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 16:17:09,914 INFO L203 MainTranslator]: Completed pre-run [2021-10-06 16:17:09,981 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/chromosome-trans.wvr.c[2567,2580] [2021-10-06 16:17:09,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 16:17:10,011 INFO L208 MainTranslator]: Completed translation [2021-10-06 16:17:10,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10 WrapperNode [2021-10-06 16:17:10,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-06 16:17:10,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-06 16:17:10,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-06 16:17:10,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-06 16:17:10,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-06 16:17:10,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-06 16:17:10,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-06 16:17:10,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-06 16:17:10,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-06 16:17:10,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-06 16:17:10,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-06 16:17:10,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-06 16:17:10,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (1/1) ... [2021-10-06 16:17:10,126 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 16:17:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:10,162 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-06 16:17:10,186 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-06 16:17:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-06 16:17:10,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-06 16:17:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-06 16:17:10,251 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-06 16:17:10,251 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-06 16:17:10,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-06 16:17:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-06 16:17:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-06 16:17:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-06 16:17:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-06 16:17:10,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-06 16:17:10,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-06 16:17:10,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-06 16:17:10,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-06 16:17:10,256 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-06 16:17:10,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-06 16:17:10,922 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-06 16:17:10,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:17:10 BoogieIcfgContainer [2021-10-06 16:17:10,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-06 16:17:10,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-06 16:17:10,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-06 16:17:10,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-06 16:17:10,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 04:17:09" (1/3) ... [2021-10-06 16:17:10,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff54b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 04:17:10, skipping insertion in model container [2021-10-06 16:17:10,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 04:17:10" (2/3) ... [2021-10-06 16:17:10,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff54b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 04:17:10, skipping insertion in model container [2021-10-06 16:17:10,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:17:10" (3/3) ... [2021-10-06 16:17:10,934 INFO L111 eAbstractionObserver]: Analyzing ICFG chromosome-trans.wvr.c [2021-10-06 16:17:10,940 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-06 16:17:10,941 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-06 16:17:10,941 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2021-10-06 16:17:10,941 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-06 16:17:10,988 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,988 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,989 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,989 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,989 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,989 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,990 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,990 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,990 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,990 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,990 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,991 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,991 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,991 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,992 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,992 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,992 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,992 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,993 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,993 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,993 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,993 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,994 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,994 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,994 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,994 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,994 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,995 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,995 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,995 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,995 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,995 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,996 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,996 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,996 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,996 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,997 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,997 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,997 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,997 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,997 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,998 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,998 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,998 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,998 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,999 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,999 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,999 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:10,999 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,000 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,000 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,000 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,000 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,001 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,001 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,001 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,001 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,002 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,002 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,002 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,002 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,002 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,003 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,003 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,003 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,003 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,004 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,004 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,005 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,005 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,005 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,006 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,006 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,006 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,006 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,006 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,007 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,007 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,007 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,007 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,008 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,008 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,008 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,008 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,009 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,009 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,009 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,009 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,010 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,010 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,011 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,017 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,017 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,020 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,020 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,020 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,021 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,022 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,022 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,022 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,022 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,023 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,023 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,023 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,023 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,023 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,024 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,024 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,024 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,024 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,025 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,025 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,025 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,025 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,025 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,026 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,026 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,026 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,026 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,026 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,027 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,027 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,027 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,027 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,027 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,028 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,028 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,028 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,028 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,028 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,029 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,029 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,029 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,029 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,029 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,030 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,030 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,030 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,030 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,030 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,030 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,031 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,031 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,031 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,031 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,031 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,032 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,032 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,032 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,032 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,032 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,033 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,033 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,033 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,033 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,033 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,034 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,034 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,034 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,034 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,034 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,035 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,035 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,035 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,038 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,039 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,039 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,039 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,039 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,040 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,040 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,040 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,045 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,045 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,046 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,046 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,046 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,046 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,046 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,047 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,049 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,049 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,049 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,049 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,049 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,050 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,050 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,050 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 16:17:11,061 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-06 16:17:11,113 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-06 16:17:11,121 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-06 16:17:11,121 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-10-06 16:17:11,145 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-06 16:17:11,158 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 263 transitions, 550 flow [2021-10-06 16:17:11,162 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 263 transitions, 550 flow [2021-10-06 16:17:11,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 251 places, 263 transitions, 550 flow [2021-10-06 16:17:11,288 INFO L129 PetriNetUnfolder]: 22/260 cut-off events. [2021-10-06 16:17:11,289 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-06 16:17:11,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 260 events. 22/260 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 209. Up to 3 conditions per place. [2021-10-06 16:17:11,310 INFO L116 LiptonReduction]: Number of co-enabled transitions 7280 [2021-10-06 16:17:21,161 INFO L131 LiptonReduction]: Checked pairs total: 11517 [2021-10-06 16:17:21,162 INFO L133 LiptonReduction]: Total number of compositions: 296 [2021-10-06 16:17:21,177 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 59 transitions, 142 flow [2021-10-06 16:17:21,288 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1177 states, 1041 states have (on average 4.020172910662824) internal successors, (4185), 1176 states have internal predecessors, (4185), 0 states have call successors, (0), 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-06 16:17:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 1177 states, 1041 states have (on average 4.020172910662824) internal successors, (4185), 1176 states have internal predecessors, (4185), 0 states have call successors, (0), 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-06 16:17:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-06 16:17:21,302 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:21,302 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-06 16:17:21,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:21,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1039, now seen corresponding path program 1 times [2021-10-06 16:17:21,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:21,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907674447] [2021-10-06 16:17:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:21,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:21,451 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-06 16:17:21,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:21,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907674447] [2021-10-06 16:17:21,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907674447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:21,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:21,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-06 16:17:21,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229662641] [2021-10-06 16:17:21,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-06 16:17:21,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-06 16:17:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-06 16:17:21,496 INFO L87 Difference]: Start difference. First operand has 1177 states, 1041 states have (on average 4.020172910662824) internal successors, (4185), 1176 states have internal predecessors, (4185), 0 states have call successors, (0), 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-06 16:17:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:21,575 INFO L93 Difference]: Finished difference Result 1025 states and 3645 transitions. [2021-10-06 16:17:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-06 16:17:21,577 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-06 16:17:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:21,621 INFO L225 Difference]: With dead ends: 1025 [2021-10-06 16:17:21,621 INFO L226 Difference]: Without dead ends: 1025 [2021-10-06 16:17:21,622 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-06 16:17:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-10-06 16:17:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2021-10-06 16:17:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 920 states have (on average 3.9619565217391304) internal successors, (3645), 1024 states have internal predecessors, (3645), 0 states have call successors, (0), 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-06 16:17:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 3645 transitions. [2021-10-06 16:17:21,770 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 3645 transitions. Word has length 1 [2021-10-06 16:17:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:21,771 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 3645 transitions. [2021-10-06 16:17:21,771 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-06 16:17:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 3645 transitions. [2021-10-06 16:17:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-06 16:17:21,772 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:21,772 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-06 16:17:21,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-06 16:17:21,773 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 33100, now seen corresponding path program 1 times [2021-10-06 16:17:21,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:21,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991863872] [2021-10-06 16:17:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:21,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:21,895 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-06 16:17:21,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:21,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991863872] [2021-10-06 16:17:21,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991863872] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:21,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:21,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-06 16:17:21,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178207823] [2021-10-06 16:17:21,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:21,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:21,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:21,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:21,901 INFO L87 Difference]: Start difference. First operand 1025 states and 3645 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-06 16:17:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:21,999 INFO L93 Difference]: Finished difference Result 2043 states and 7283 transitions. [2021-10-06 16:17:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:22,001 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-06 16:17:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:22,027 INFO L225 Difference]: With dead ends: 2043 [2021-10-06 16:17:22,027 INFO L226 Difference]: Without dead ends: 2043 [2021-10-06 16:17:22,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2021-10-06 16:17:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1028. [2021-10-06 16:17:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 923 states have (on average 3.9555796316359695) internal successors, (3651), 1027 states have internal predecessors, (3651), 0 states have call successors, (0), 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-06 16:17:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 3651 transitions. [2021-10-06 16:17:22,102 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 3651 transitions. Word has length 2 [2021-10-06 16:17:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:22,102 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 3651 transitions. [2021-10-06 16:17:22,105 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-06 16:17:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 3651 transitions. [2021-10-06 16:17:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 16:17:22,106 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:22,106 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 16:17:22,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-06 16:17:22,107 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1027022, now seen corresponding path program 1 times [2021-10-06 16:17:22,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:22,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213448248] [2021-10-06 16:17:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:22,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:22,164 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-06 16:17:22,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:22,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213448248] [2021-10-06 16:17:22,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213448248] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:22,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125093568] [2021-10-06 16:17:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:22,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:22,168 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-06 16:17:22,196 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-06 16:17:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:22,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 16:17:22,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:22,301 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-06 16:17:22,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125093568] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:22,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-06 16:17:22,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2021-10-06 16:17:22,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582738740] [2021-10-06 16:17:22,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 16:17:22,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 16:17:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:22,305 INFO L87 Difference]: Start difference. First operand 1028 states and 3651 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-06 16:17:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:22,380 INFO L93 Difference]: Finished difference Result 2040 states and 7280 transitions. [2021-10-06 16:17:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:22,381 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-06 16:17:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:22,406 INFO L225 Difference]: With dead ends: 2040 [2021-10-06 16:17:22,406 INFO L226 Difference]: Without dead ends: 2040 [2021-10-06 16:17:22,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2021-10-06 16:17:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1025. [2021-10-06 16:17:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 923 states have (on average 3.952329360780065) internal successors, (3648), 1024 states have internal predecessors, (3648), 0 states have call successors, (0), 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-06 16:17:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 3648 transitions. [2021-10-06 16:17:22,561 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 3648 transitions. Word has length 3 [2021-10-06 16:17:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:22,564 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 3648 transitions. [2021-10-06 16:17:22,565 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-06 16:17:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 3648 transitions. [2021-10-06 16:17:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 16:17:22,565 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:22,566 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 16:17:22,631 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-06 16:17:22,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:22,780 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1026991, now seen corresponding path program 1 times [2021-10-06 16:17:22,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:22,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564291940] [2021-10-06 16:17:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:22,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:22,868 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-06 16:17:22,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:22,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564291940] [2021-10-06 16:17:22,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564291940] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:22,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308073232] [2021-10-06 16:17:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:22,870 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:22,871 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-06 16:17:22,875 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-06 16:17:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:22,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 16:17:22,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:22,955 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-06 16:17:22,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308073232] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:22,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:22,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-06 16:17:22,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257223195] [2021-10-06 16:17:22,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 16:17:22,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:22,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 16:17:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:22,958 INFO L87 Difference]: Start difference. First operand 1025 states and 3648 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-06 16:17:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:23,050 INFO L93 Difference]: Finished difference Result 3058 states and 10918 transitions. [2021-10-06 16:17:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:23,051 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-06 16:17:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:23,089 INFO L225 Difference]: With dead ends: 3058 [2021-10-06 16:17:23,089 INFO L226 Difference]: Without dead ends: 3058 [2021-10-06 16:17:23,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 16:17:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2021-10-06 16:17:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 1028. [2021-10-06 16:17:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 926 states have (on average 3.9460043196544277) internal successors, (3654), 1027 states have internal predecessors, (3654), 0 states have call successors, (0), 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-06 16:17:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 3654 transitions. [2021-10-06 16:17:23,182 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 3654 transitions. Word has length 3 [2021-10-06 16:17:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:23,182 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 3654 transitions. [2021-10-06 16:17:23,183 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-06 16:17:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 3654 transitions. [2021-10-06 16:17:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-06 16:17:23,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:23,184 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-06 16:17:23,228 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-06 16:17:23,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:23,398 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 31838573, now seen corresponding path program 2 times [2021-10-06 16:17:23,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:23,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019206717] [2021-10-06 16:17:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:23,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:23,489 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-06 16:17:23,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:23,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019206717] [2021-10-06 16:17:23,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019206717] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:23,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310979677] [2021-10-06 16:17:23,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-06 16:17:23,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:23,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:23,493 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-06 16:17:23,525 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-06 16:17:23,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-06 16:17:23,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:23,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-06 16:17:23,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:23,590 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-06 16:17:23,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310979677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:23,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-06 16:17:23,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-06 16:17:23,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713821995] [2021-10-06 16:17:23,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:23,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:23,593 INFO L87 Difference]: Start difference. First operand 1028 states and 3654 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-06 16:17:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:23,625 INFO L93 Difference]: Finished difference Result 1025 states and 3651 transitions. [2021-10-06 16:17:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:23,625 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-06 16:17:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:23,636 INFO L225 Difference]: With dead ends: 1025 [2021-10-06 16:17:23,636 INFO L226 Difference]: Without dead ends: 1025 [2021-10-06 16:17:23,637 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-06 16:17:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-10-06 16:17:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1019. [2021-10-06 16:17:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 920 states have (on average 3.9554347826086955) internal successors, (3639), 1018 states have internal predecessors, (3639), 0 states have call successors, (0), 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-06 16:17:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 3639 transitions. [2021-10-06 16:17:23,694 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 3639 transitions. Word has length 4 [2021-10-06 16:17:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:23,695 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 3639 transitions. [2021-10-06 16:17:23,695 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-06 16:17:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 3639 transitions. [2021-10-06 16:17:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-06 16:17:23,696 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:23,696 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:23,737 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-06 16:17:23,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:23,910 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 982883530, now seen corresponding path program 1 times [2021-10-06 16:17:23,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:23,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299996710] [2021-10-06 16:17:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:23,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:23,955 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-06 16:17:23,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:23,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299996710] [2021-10-06 16:17:23,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299996710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:23,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:23,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-06 16:17:23,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591296899] [2021-10-06 16:17:23,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:23,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:23,958 INFO L87 Difference]: Start difference. First operand 1019 states and 3639 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-06 16:17:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:23,986 INFO L93 Difference]: Finished difference Result 1022 states and 3642 transitions. [2021-10-06 16:17:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:23,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-06 16:17:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:23,997 INFO L225 Difference]: With dead ends: 1022 [2021-10-06 16:17:23,997 INFO L226 Difference]: Without dead ends: 1022 [2021-10-06 16:17:23,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-10-06 16:17:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2021-10-06 16:17:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 923 states have (on average 3.9458288190682556) internal successors, (3642), 1021 states have internal predecessors, (3642), 0 states have call successors, (0), 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-06 16:17:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3642 transitions. [2021-10-06 16:17:24,044 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3642 transitions. Word has length 8 [2021-10-06 16:17:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:24,045 INFO L470 AbstractCegarLoop]: Abstraction has 1022 states and 3642 transitions. [2021-10-06 16:17:24,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-06 16:17:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3642 transitions. [2021-10-06 16:17:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-06 16:17:24,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:24,046 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:24,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-06 16:17:24,047 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:24,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:24,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1866934448, now seen corresponding path program 1 times [2021-10-06 16:17:24,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:24,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669320942] [2021-10-06 16:17:24,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:24,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:24,095 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-06 16:17:24,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:24,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669320942] [2021-10-06 16:17:24,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669320942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-06 16:17:24,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-06 16:17:24,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-06 16:17:24,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207163982] [2021-10-06 16:17:24,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 16:17:24,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 16:17:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 16:17:24,099 INFO L87 Difference]: Start difference. First operand 1022 states and 3642 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-06 16:17:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:24,172 INFO L93 Difference]: Finished difference Result 1694 states and 6067 transitions. [2021-10-06 16:17:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 16:17:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-10-06 16:17:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:24,198 INFO L225 Difference]: With dead ends: 1694 [2021-10-06 16:17:24,199 INFO L226 Difference]: Without dead ends: 1694 [2021-10-06 16:17:24,203 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-06 16:17:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2021-10-06 16:17:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1250. [2021-10-06 16:17:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1151 states have (on average 4.255430060816681) internal successors, (4898), 1249 states have internal predecessors, (4898), 0 states have call successors, (0), 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-06 16:17:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 4898 transitions. [2021-10-06 16:17:24,268 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 4898 transitions. Word has length 11 [2021-10-06 16:17:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:24,269 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 4898 transitions. [2021-10-06 16:17:24,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-06 16:17:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 4898 transitions. [2021-10-06 16:17:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-06 16:17:24,271 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:24,271 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:24,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-06 16:17:24,271 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1866934671, now seen corresponding path program 1 times [2021-10-06 16:17:24,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:24,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495900768] [2021-10-06 16:17:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:24,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-06 16:17:24,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:24,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495900768] [2021-10-06 16:17:24,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495900768] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:24,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057451067] [2021-10-06 16:17:24,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:24,389 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:24,396 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-06 16:17:24,417 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-06 16:17:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:24,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-06 16:17:24,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-06 16:17:24,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057451067] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:24,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:24,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2021-10-06 16:17:24,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119410267] [2021-10-06 16:17:24,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-06 16:17:24,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-06 16:17:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:24,540 INFO L87 Difference]: Start difference. First operand 1250 states and 4898 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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-06 16:17:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:24,581 INFO L93 Difference]: Finished difference Result 1253 states and 4901 transitions. [2021-10-06 16:17:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-06 16:17:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 11 [2021-10-06 16:17:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:24,592 INFO L225 Difference]: With dead ends: 1253 [2021-10-06 16:17:24,592 INFO L226 Difference]: Without dead ends: 1253 [2021-10-06 16:17:24,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-06 16:17:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2021-10-06 16:17:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1253. [2021-10-06 16:17:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1154 states have (on average 4.246967071057193) internal successors, (4901), 1252 states have internal predecessors, (4901), 0 states have call successors, (0), 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-06 16:17:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4901 transitions. [2021-10-06 16:17:24,645 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 4901 transitions. Word has length 11 [2021-10-06 16:17:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:24,645 INFO L470 AbstractCegarLoop]: Abstraction has 1253 states and 4901 transitions. [2021-10-06 16:17:24,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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-06 16:17:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 4901 transitions. [2021-10-06 16:17:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-06 16:17:24,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:24,647 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:24,698 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-06 16:17:24,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:24,861 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1018028843, now seen corresponding path program 2 times [2021-10-06 16:17:24,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:24,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208137687] [2021-10-06 16:17:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:24,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:24,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:24,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208137687] [2021-10-06 16:17:24,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208137687] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:24,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961051733] [2021-10-06 16:17:24,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-06 16:17:24,977 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:24,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:24,978 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-06 16:17:24,990 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-06 16:17:25,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-06 16:17:25,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:25,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-06 16:17:25,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-06 16:17:25,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961051733] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:25,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:25,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-10-06 16:17:25,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267605913] [2021-10-06 16:17:25,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-06 16:17:25,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-06 16:17:25,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-10-06 16:17:25,159 INFO L87 Difference]: Start difference. First operand 1253 states and 4901 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-06 16:17:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:25,201 INFO L93 Difference]: Finished difference Result 1256 states and 4904 transitions. [2021-10-06 16:17:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-06 16:17:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 14 [2021-10-06 16:17:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:25,213 INFO L225 Difference]: With dead ends: 1256 [2021-10-06 16:17:25,214 INFO L226 Difference]: Without dead ends: 1256 [2021-10-06 16:17:25,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-10-06 16:17:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2021-10-06 16:17:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2021-10-06 16:17:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1157 states have (on average 4.238547968885047) internal successors, (4904), 1255 states have internal predecessors, (4904), 0 states have call successors, (0), 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-06 16:17:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 4904 transitions. [2021-10-06 16:17:25,280 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 4904 transitions. Word has length 14 [2021-10-06 16:17:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:25,281 INFO L470 AbstractCegarLoop]: Abstraction has 1256 states and 4904 transitions. [2021-10-06 16:17:25,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-06 16:17:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 4904 transitions. [2021-10-06 16:17:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-06 16:17:25,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:25,282 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:25,329 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-06 16:17:25,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:25,492 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2095768369, now seen corresponding path program 3 times [2021-10-06 16:17:25,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:25,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205480432] [2021-10-06 16:17:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:25,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-06 16:17:25,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:25,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205480432] [2021-10-06 16:17:25,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205480432] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:25,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156941658] [2021-10-06 16:17:25,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-06 16:17:25,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:25,572 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-06 16:17:25,593 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-06 16:17:25,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-06 16:17:25,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:25,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-06 16:17:25,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-06 16:17:25,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156941658] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:25,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:25,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-10-06 16:17:25,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895519] [2021-10-06 16:17:25,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-06 16:17:25,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-06 16:17:25,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-10-06 16:17:25,798 INFO L87 Difference]: Start difference. First operand 1256 states and 4904 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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-06 16:17:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:25,854 INFO L93 Difference]: Finished difference Result 1259 states and 4907 transitions. [2021-10-06 16:17:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-06 16:17:25,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 17 [2021-10-06 16:17:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:25,863 INFO L225 Difference]: With dead ends: 1259 [2021-10-06 16:17:25,864 INFO L226 Difference]: Without dead ends: 1259 [2021-10-06 16:17:25,864 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-10-06 16:17:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2021-10-06 16:17:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2021-10-06 16:17:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1160 states have (on average 4.230172413793103) internal successors, (4907), 1258 states have internal predecessors, (4907), 0 states have call successors, (0), 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-06 16:17:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 4907 transitions. [2021-10-06 16:17:25,931 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 4907 transitions. Word has length 17 [2021-10-06 16:17:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:25,931 INFO L470 AbstractCegarLoop]: Abstraction has 1259 states and 4907 transitions. [2021-10-06 16:17:25,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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-06 16:17:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 4907 transitions. [2021-10-06 16:17:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-06 16:17:25,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:25,933 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:25,980 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-06 16:17:26,147 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,SelfDestructingSolverStorable9 [2021-10-06 16:17:26,148 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash 982219371, now seen corresponding path program 4 times [2021-10-06 16:17:26,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:26,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276042571] [2021-10-06 16:17:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:26,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 16:17:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-06 16:17:26,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-06 16:17:26,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276042571] [2021-10-06 16:17:26,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276042571] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:26,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528521898] [2021-10-06 16:17:26,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-06 16:17:26,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 16:17:26,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-06 16:17:26,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-06 16:17:26,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-06 16:17:26,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-06 16:17:26,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-06 16:17:26,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 16:17:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-06 16:17:26,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528521898] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-06 16:17:26,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-06 16:17:26,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2021-10-06 16:17:26,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132280426] [2021-10-06 16:17:26,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-06 16:17:26,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-06 16:17:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-06 16:17:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-06 16:17:26,504 INFO L87 Difference]: Start difference. First operand 1259 states and 4907 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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-06 16:17:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 16:17:26,568 INFO L93 Difference]: Finished difference Result 1262 states and 4910 transitions. [2021-10-06 16:17:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-06 16:17:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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 20 [2021-10-06 16:17:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 16:17:26,576 INFO L225 Difference]: With dead ends: 1262 [2021-10-06 16:17:26,577 INFO L226 Difference]: Without dead ends: 1262 [2021-10-06 16:17:26,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.1ms TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-06 16:17:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2021-10-06 16:17:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1262. [2021-10-06 16:17:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1163 states have (on average 4.2218400687876185) internal successors, (4910), 1261 states have internal predecessors, (4910), 0 states have call successors, (0), 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-06 16:17:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 4910 transitions. [2021-10-06 16:17:26,643 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 4910 transitions. Word has length 20 [2021-10-06 16:17:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 16:17:26,644 INFO L470 AbstractCegarLoop]: Abstraction has 1262 states and 4910 transitions. [2021-10-06 16:17:26,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 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-06 16:17:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 4910 transitions. [2021-10-06 16:17:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-06 16:17:26,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 16:17:26,647 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 16:17:26,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-06 16:17:26,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-06 16:17:26,863 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-06 16:17:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 16:17:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash -916480015, now seen corresponding path program 5 times [2021-10-06 16:17:26,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-06 16:17:26,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477913361] [2021-10-06 16:17:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 16:17:26,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-06 16:17:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 16:17:26,971 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-06 16:17:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 16:17:27,162 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-06 16:17:27,163 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-06 16:17:27,164 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,166 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,167 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,168 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,169 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,170 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,171 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-06 16:17:27,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-06 16:17:27,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-06 16:17:27,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-06 16:17:27,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-06 16:17:27,183 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-06 16:17:27,183 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-06 16:17:27,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 04:17:27 BasicIcfg [2021-10-06 16:17:27,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-06 16:17:27,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-06 16:17:27,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-06 16:17:27,255 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-06 16:17:27,256 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 04:17:10" (3/4) ... [2021-10-06 16:17:27,258 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-06 16:17:27,346 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/chl/chromosome-trans.wvr.c-witness.graphml [2021-10-06 16:17:27,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-06 16:17:27,348 INFO L168 Benchmark]: Toolchain (without parser) took 17846.32 ms. Allocated memory was 160.4 MB in the beginning and 238.0 MB in the end (delta: 77.6 MB). Free memory was 135.3 MB in the beginning and 72.5 MB in the end (delta: 62.8 MB). Peak memory consumption was 141.6 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,349 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 160.4 MB. Free memory is still 132.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-06 16:17:27,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.64 ms. Allocated memory is still 160.4 MB. Free memory was 135.0 MB in the beginning and 124.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.90 ms. Allocated memory is still 160.4 MB. Free memory was 124.0 MB in the beginning and 121.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,350 INFO L168 Benchmark]: Boogie Preprocessor took 42.96 ms. Allocated memory is still 160.4 MB. Free memory was 121.8 MB in the beginning and 120.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,350 INFO L168 Benchmark]: RCFGBuilder took 809.99 ms. Allocated memory is still 160.4 MB. Free memory was 120.0 MB in the beginning and 136.0 MB in the end (delta: -16.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,351 INFO L168 Benchmark]: TraceAbstraction took 16327.11 ms. Allocated memory was 160.4 MB in the beginning and 238.0 MB in the end (delta: 77.6 MB). Free memory was 135.2 MB in the beginning and 80.9 MB in the end (delta: 54.2 MB). Peak memory consumption was 132.9 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,351 INFO L168 Benchmark]: Witness Printer took 91.54 ms. Allocated memory is still 238.0 MB. Free memory was 80.9 MB in the beginning and 72.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-10-06 16:17:27,353 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.22 ms. Allocated memory is still 160.4 MB. Free memory is still 132.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 500.64 ms. Allocated memory is still 160.4 MB. Free memory was 135.0 MB in the beginning and 124.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.90 ms. Allocated memory is still 160.4 MB. Free memory was 124.0 MB in the beginning and 121.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.96 ms. Allocated memory is still 160.4 MB. Free memory was 121.8 MB in the beginning and 120.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 809.99 ms. Allocated memory is still 160.4 MB. Free memory was 120.0 MB in the beginning and 136.0 MB in the end (delta: -16.0 MB). Peak memory consumption was 17.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16327.11 ms. Allocated memory was 160.4 MB in the beginning and 238.0 MB in the end (delta: 77.6 MB). Free memory was 135.2 MB in the beginning and 80.9 MB in the end (delta: 54.2 MB). Peak memory consumption was 132.9 MB. Max. memory is 8.0 GB. * Witness Printer took 91.54 ms. Allocated memory is still 238.0 MB. Free memory was 80.9 MB in the beginning and 72.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10000.7ms, 251 PlacesBefore, 61 PlacesAfterwards, 263 TransitionsBefore, 59 TransitionsAfterwards, 7280 CoEnabledTransitionPairs, 8 FixpointIterations, 158 TrivialSequentialCompositions, 104 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 10 ConcurrentYvCompositions, 14 ChoiceCompositions, 296 TotalNumberOfCompositions, 11517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8727, positive: 8537, positive conditional: 0, positive unconditional: 8537, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4935, positive: 4899, positive conditional: 0, positive unconditional: 4899, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4935, positive: 4899, positive conditional: 0, positive unconditional: 4899, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8727, positive: 3638, positive conditional: 0, positive unconditional: 3638, negative: 154, negative conditional: 0, negative unconditional: 154, unknown: 4935, unknown conditional: 0, unknown unconditional: 4935] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 267, Positive conditional cache size: 0, Positive unconditional cache size: 267, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - 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: 49]: integer overflow possible integer overflow possible We found a FailurePath: [L38] 0 int *a1, *a2, *a3; [L39] 0 int res1, res2, res3; [L40] 0 _Bool isNull1, isNull2, isNull3; [L82] 0 pthread_t t1, t2, t3; [L35] COND FALSE 0 !(!cond) [L106] EXPR 0 sizeof(int) * size [L106] 0 int* arr = (int*)malloc(sizeof(int) * size); [L107] 0 int i = 0; VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND FALSE 0 !(i < size) [L110] 0 return arr; [L84] 0 a1 = create_fresh_int_array(5) [L35] COND FALSE 0 !(!cond) [L106] EXPR 0 sizeof(int) * size [L106] 0 int* arr = (int*)malloc(sizeof(int) * size); [L107] 0 int i = 0; VAL [a1={-2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND FALSE 0 !(i < size) [L110] 0 return arr; [L85] 0 a2 = create_fresh_int_array(5) [L35] COND FALSE 0 !(!cond) [L106] EXPR 0 sizeof(int) * size [L106] 0 int* arr = (int*)malloc(sizeof(int) * size); [L107] 0 int i = 0; VAL [a1={-2:0}, a2={19:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={19:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={19:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={19:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={19:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={-2:0}, a2={19:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND FALSE 0 !(i < size) [L110] 0 return arr; [L86] 0 a3 = create_fresh_int_array(5) [L87] 0 isNull1 = __VERIFIER_nondet_bool() [L88] 0 isNull2 = __VERIFIER_nondet_bool() [L89] 0 isNull3 = __VERIFIER_nondet_bool() [L92] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) VAL [a1={-2:0}, a2={19:0}, a3={-13:0}, isNull1=512, isNull2=256, isNull3=2147483633, res1=0, res2=0, res3=0] [L45] 1 int i = 0; [L35] COND FALSE 1 !(!cond) [L47] 1 res1 = 1 VAL [a1={-2:0}, a2={19:0}, a3={-13:0}, isNull1=512, isNull2=256, isNull3=2147483633, res1=1, res2=0, res3=0] [L48] COND TRUE 1 !isNull2 && i < 5 [L49] EXPR 1 a1[i] VAL [a1={-2:0}, a2={19:0}, a3={-13:0}, isNull1=512, isNull2=256, isNull3=2147483633, res1=1, res2=0, res3=0] [L49] EXPR 1 a2[i] [L49] 1 a1[i] - a2[i] VAL [a1={-2:0}, a2={19:0}, a3={-13:0}, isNull1=512, isNull2=256, isNull3=2147483633, res1=1, res2=0, res3=0] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: 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: 92]: 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: 93]: 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, 324 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 16067.3ms, OverallIterations: 12, TraceHistogramMax: 5, EmptinessCheckTime: 21.3ms, AutomataDifference: 958.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10167.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 475 SDtfs, 281 SDslu, 711 SDs, 0 SdLazy, 181 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 251.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 224.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1262occurred in iteration=11, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 871.2ms AutomataMinimizationTime, 11 MinimizatonAttempts, 4510 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 122.2ms SsaConstructionTime, 559.9ms SatisfiabilityAnalysisTime, 1012.1ms InterpolantComputationTime, 189 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 356 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 87/133 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-06 16:17:27,405 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...