/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf -i ../sv-benchmarks/c/weaver/chl-time-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-07 15:38:08,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-07 15:38:08,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-07 15:38:08,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-07 15:38:08,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-07 15:38:08,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-07 15:38:08,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-07 15:38:08,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-07 15:38:08,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-07 15:38:08,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-07 15:38:08,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-07 15:38:08,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-07 15:38:08,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-07 15:38:08,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-07 15:38:08,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-07 15:38:08,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-07 15:38:08,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-07 15:38:08,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-07 15:38:08,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-07 15:38:08,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-07 15:38:08,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-07 15:38:08,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-07 15:38:08,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-07 15:38:08,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-07 15:38:08,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-07 15:38:08,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-07 15:38:08,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-07 15:38:08,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-07 15:38:08,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-07 15:38:08,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-07 15:38:08,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-07 15:38:08,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-07 15:38:08,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-07 15:38:08,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-07 15:38:08,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-07 15:38:08,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-07 15:38:08,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-07 15:38:08,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-07 15:38:08,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-07 15:38:08,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-07 15:38:08,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-07 15:38:08,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-10-07 15:38:08,149 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-07 15:38:08,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-07 15:38:08,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-07 15:38:08,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-07 15:38:08,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-07 15:38:08,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-07 15:38:08,152 INFO L138 SettingsManager]: * Use SBE=true [2021-10-07 15:38:08,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-07 15:38:08,152 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-07 15:38:08,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-07 15:38:08,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-07 15:38:08,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-07 15:38:08,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-07 15:38:08,154 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-07 15:38:08,154 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-07 15:38:08,154 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-07 15:38:08,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-07 15:38:08,155 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-07 15:38:08,155 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-07 15:38:08,155 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-07 15:38:08,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-07 15:38:08,156 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-07 15:38:08,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-07 15:38:08,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-07 15:38:08,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-07 15:38:08,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 15:38:08,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-07 15:38:08,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-07 15:38:08,158 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-07 15:38:08,158 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-07 15:38:08,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-07 15:38:08,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-07 15:38:08,159 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-07 15:38:08,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-07 15:38:08,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-07 15:38:08,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-07 15:38:08,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-07 15:38:08,658 INFO L275 PluginConnector]: CDTParser initialized [2021-10-07 15:38:08,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-symm.wvr.c [2021-10-07 15:38:08,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/26c8b62a0/f3d6795133c54ef69f15fb19a82c7371/FLAG680488f9d [2021-10-07 15:38:09,407 INFO L306 CDTParser]: Found 1 translation units. [2021-10-07 15:38:09,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-symm.wvr.c [2021-10-07 15:38:09,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/26c8b62a0/f3d6795133c54ef69f15fb19a82c7371/FLAG680488f9d [2021-10-07 15:38:09,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/26c8b62a0/f3d6795133c54ef69f15fb19a82c7371 [2021-10-07 15:38:09,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-07 15:38:09,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-07 15:38:09,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-07 15:38:09,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-07 15:38:09,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-07 15:38:09,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:38:09" (1/1) ... [2021-10-07 15:38:09,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f31eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:09, skipping insertion in model container [2021-10-07 15:38:09,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:38:09" (1/1) ... [2021-10-07 15:38:09,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-07 15:38:09,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-07 15:38:09,999 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-time-symm.wvr.c[2457,2470] [2021-10-07 15:38:10,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 15:38:10,019 INFO L203 MainTranslator]: Completed pre-run [2021-10-07 15:38:10,043 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-time-symm.wvr.c[2457,2470] [2021-10-07 15:38:10,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 15:38:10,064 INFO L208 MainTranslator]: Completed translation [2021-10-07 15:38:10,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10 WrapperNode [2021-10-07 15:38:10,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-07 15:38:10,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-07 15:38:10,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-07 15:38:10,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-07 15:38:10,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-07 15:38:10,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-07 15:38:10,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-07 15:38:10,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-07 15:38:10,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-07 15:38:10,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-07 15:38:10,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-07 15:38:10,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-07 15:38:10,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (1/1) ... [2021-10-07 15:38:10,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 15:38:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 15:38:10,202 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-07 15:38:10,222 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-07 15:38:10,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-07 15:38:10,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-07 15:38:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-07 15:38:10,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-07 15:38:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-07 15:38:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-07 15:38:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-07 15:38:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-07 15:38:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-07 15:38:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-07 15:38:10,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-07 15:38:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-07 15:38:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-07 15:38:10,282 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-07 15:38:10,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-07 15:38:10,907 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-07 15:38:10,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:38:10 BoogieIcfgContainer [2021-10-07 15:38:10,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-07 15:38:10,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-07 15:38:10,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-07 15:38:10,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-07 15:38:10,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:38:09" (1/3) ... [2021-10-07 15:38:10,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d40e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:38:10, skipping insertion in model container [2021-10-07 15:38:10,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:38:10" (2/3) ... [2021-10-07 15:38:10,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d40e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:38:10, skipping insertion in model container [2021-10-07 15:38:10,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:38:10" (3/3) ... [2021-10-07 15:38:10,930 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-time-symm.wvr.c [2021-10-07 15:38:10,937 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-07 15:38:10,938 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-10-07 15:38:10,938 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-07 15:38:11,004 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,005 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,005 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,005 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,006 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,006 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,007 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,008 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,009 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,009 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,009 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,024 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,025 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,025 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 15:38:11,036 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-07 15:38:11,109 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-07 15:38:11,138 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-07 15:38:11,138 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-10-07 15:38:11,167 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-07 15:38:11,187 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 102 transitions, 220 flow [2021-10-07 15:38:11,192 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 102 transitions, 220 flow [2021-10-07 15:38:11,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 102 transitions, 220 flow [2021-10-07 15:38:11,291 INFO L129 PetriNetUnfolder]: 5/100 cut-off events. [2021-10-07 15:38:11,292 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-07 15:38:11,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 5/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-10-07 15:38:11,301 INFO L116 LiptonReduction]: Number of co-enabled transitions 156 [2021-10-07 15:38:21,256 INFO L131 LiptonReduction]: Checked pairs total: 282 [2021-10-07 15:38:21,257 INFO L133 LiptonReduction]: Total number of compositions: 120 [2021-10-07 15:38:21,277 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 62 flow [2021-10-07 15:38:21,289 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 39 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 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-07 15:38:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 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-07 15:38:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-07 15:38:21,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 15:38:21,298 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-07 15:38:21,298 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2021-10-07 15:38:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 15:38:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash 410, now seen corresponding path program 1 times [2021-10-07 15:38:21,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 15:38:21,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377978391] [2021-10-07 15:38:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 15:38:21,320 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 15:38:21,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 15:38:21,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 15:38:21,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-07 15:38:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 15:38:21,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-07 15:38:21,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 15:38:21,402 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-07 15:38:21,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 15:38:21,403 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-07 15:38:21,404 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 15:38:21,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377978391] [2021-10-07 15:38:21,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377978391] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 15:38:21,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 15:38:21,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0, 0] imperfect sequences [] total 0 [2021-10-07 15:38:21,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336219263] [2021-10-07 15:38:21,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-07 15:38:21,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 15:38:21,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-07 15:38:21,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-07 15:38:21,431 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 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-07 15:38:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 15:38:21,445 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2021-10-07 15:38:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-07 15:38:21,447 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-07 15:38:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 15:38:21,457 INFO L225 Difference]: With dead ends: 36 [2021-10-07 15:38:21,457 INFO L226 Difference]: Without dead ends: 36 [2021-10-07 15:38:21,459 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-07 15:38:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-10-07 15:38:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-10-07 15:38:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 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-07 15:38:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2021-10-07 15:38:21,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 56 transitions. Word has length 1 [2021-10-07 15:38:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 15:38:21,497 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 56 transitions. [2021-10-07 15:38:21,497 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-07 15:38:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. [2021-10-07 15:38:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-07 15:38:21,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 15:38:21,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-07 15:38:21,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-10-07 15:38:21,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 15:38:21,709 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2021-10-07 15:38:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 15:38:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 403476, now seen corresponding path program 1 times [2021-10-07 15:38:21,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 15:38:21,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560909325] [2021-10-07 15:38:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 15:38:21,713 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 15:38:21,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 15:38:21,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 15:38:21,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-07 15:38:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 15:38:21,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-07 15:38:21,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 15:38:21,921 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-07 15:38:21,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2021-10-07 15:38:21,971 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-07 15:38:21,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 15:38:21,987 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-07 15:38:21,988 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 15:38:21,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560909325] [2021-10-07 15:38:21,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560909325] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 15:38:21,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 15:38:21,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-07 15:38:21,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64360771] [2021-10-07 15:38:21,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 15:38:21,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 15:38:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 15:38:21,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 15:38:21,992 INFO L87 Difference]: Start difference. First operand 36 states and 56 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-07 15:38:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 15:38:22,024 INFO L93 Difference]: Finished difference Result 32 states and 50 transitions. [2021-10-07 15:38:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 15:38:22,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-07 15:38:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 15:38:22,026 INFO L225 Difference]: With dead ends: 32 [2021-10-07 15:38:22,026 INFO L226 Difference]: Without dead ends: 32 [2021-10-07 15:38:22,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 15:38:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-07 15:38:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-07 15:38:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 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-07 15:38:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. [2021-10-07 15:38:22,034 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 50 transitions. Word has length 3 [2021-10-07 15:38:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 15:38:22,034 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 50 transitions. [2021-10-07 15:38:22,034 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-07 15:38:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2021-10-07 15:38:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-07 15:38:22,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 15:38:22,035 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-07 15:38:22,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-07 15:38:22,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 15:38:22,236 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2021-10-07 15:38:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 15:38:22,238 INFO L82 PathProgramCache]: Analyzing trace with hash 403478, now seen corresponding path program 1 times [2021-10-07 15:38:22,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 15:38:22,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563462406] [2021-10-07 15:38:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 15:38:22,240 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 15:38:22,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 15:38:22,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 15:38:22,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-07 15:38:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 15:38:22,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-07 15:38:22,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 15:38:22,401 INFO L354 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2021-10-07 15:38:22,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2021-10-07 15:38:22,477 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-07 15:38:22,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 15:38:22,530 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-07 15:38:22,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 15:38:22,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563462406] [2021-10-07 15:38:22,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563462406] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 15:38:22,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 15:38:22,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 15:38:22,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318118352] [2021-10-07 15:38:22,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 15:38:22,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 15:38:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 15:38:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 15:38:22,534 INFO L87 Difference]: Start difference. First operand 32 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 15:38:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 15:38:22,557 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2021-10-07 15:38:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 15:38:22,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-07 15:38:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 15:38:22,559 INFO L225 Difference]: With dead ends: 28 [2021-10-07 15:38:22,559 INFO L226 Difference]: Without dead ends: 28 [2021-10-07 15:38:22,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 15:38:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-07 15:38:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-10-07 15:38:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.76) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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-07 15:38:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2021-10-07 15:38:22,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 3 [2021-10-07 15:38:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 15:38:22,565 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 44 transitions. [2021-10-07 15:38:22,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 15:38:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2021-10-07 15:38:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-07 15:38:22,567 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 15:38:22,567 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-07 15:38:22,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-07 15:38:22,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 15:38:22,780 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2021-10-07 15:38:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 15:38:22,781 INFO L82 PathProgramCache]: Analyzing trace with hash 387749829, now seen corresponding path program 1 times [2021-10-07 15:38:22,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 15:38:22,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808212457] [2021-10-07 15:38:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 15:38:22,783 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 15:38:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 15:38:22,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 15:38:22,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-07 15:38:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 15:38:22,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-07 15:38:22,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 15:38:22,854 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-07 15:38:22,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2021-10-07 15:38:22,888 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-07 15:38:22,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 15:38:22,906 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-07 15:38:22,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 15:38:22,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808212457] [2021-10-07 15:38:22,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808212457] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 15:38:22,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 15:38:22,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-07 15:38:22,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660834654] [2021-10-07 15:38:22,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 15:38:22,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 15:38:22,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 15:38:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 15:38:22,910 INFO L87 Difference]: Start difference. First operand 28 states and 44 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-07 15:38:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 15:38:22,926 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2021-10-07 15:38:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 15:38:22,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-07 15:38:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 15:38:22,928 INFO L225 Difference]: With dead ends: 24 [2021-10-07 15:38:22,929 INFO L226 Difference]: Without dead ends: 24 [2021-10-07 15:38:22,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 15:38:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-07 15:38:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-07 15:38:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 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-07 15:38:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2021-10-07 15:38:22,933 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 5 [2021-10-07 15:38:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 15:38:22,935 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-10-07 15:38:22,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-07 15:38:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2021-10-07 15:38:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-07 15:38:22,936 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 15:38:22,936 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-07 15:38:22,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-07 15:38:23,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 15:38:23,149 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2021-10-07 15:38:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 15:38:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash 387749830, now seen corresponding path program 1 times [2021-10-07 15:38:23,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 15:38:23,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597317189] [2021-10-07 15:38:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 15:38:23,152 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 15:38:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 15:38:23,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 15:38:23,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-07 15:38:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 15:38:23,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-07 15:38:23,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 15:38:23,321 INFO L354 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2021-10-07 15:38:23,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2021-10-07 15:38:23,423 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-07 15:38:23,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 15:38:23,516 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-07 15:38:23,518 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 15:38:23,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597317189] [2021-10-07 15:38:23,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597317189] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 15:38:23,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 15:38:23,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 15:38:23,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270649785] [2021-10-07 15:38:23,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 15:38:23,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 15:38:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 15:38:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 15:38:23,522 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-07 15:38:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 15:38:23,537 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2021-10-07 15:38:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 15:38:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-07 15:38:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 15:38:23,541 INFO L225 Difference]: With dead ends: 20 [2021-10-07 15:38:23,541 INFO L226 Difference]: Without dead ends: 20 [2021-10-07 15:38:23,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 15:38:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-07 15:38:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-07 15:38:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 15:38:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2021-10-07 15:38:23,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 5 [2021-10-07 15:38:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 15:38:23,551 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2021-10-07 15:38:23,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-07 15:38:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2021-10-07 15:38:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-07 15:38:23,552 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 15:38:23,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 15:38:23,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-10-07 15:38:23,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 15:38:23,764 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2021-10-07 15:38:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 15:38:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1339552370, now seen corresponding path program 1 times [2021-10-07 15:38:23,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 15:38:23,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927920867] [2021-10-07 15:38:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 15:38:23,766 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 15:38:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 15:38:23,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 15:38:23,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-07 15:38:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-07 15:38:23,857 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-07 15:38:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-07 15:38:23,958 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-10-07 15:38:23,958 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-07 15:38:23,959 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK [2021-10-07 15:38:23,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-07 15:38:23,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-07 15:38:23,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-07 15:38:23,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-07 15:38:23,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-07 15:38:23,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-07 15:38:23,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-07 15:38:23,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-07 15:38:23,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK [2021-10-07 15:38:23,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-07 15:38:23,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-07 15:38:23,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-07 15:38:24,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 15:38:24,182 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-07 15:38:24,182 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-07 15:38:24,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 03:38:24 BasicIcfg [2021-10-07 15:38:24,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-07 15:38:24,218 INFO L168 Benchmark]: Toolchain (without parser) took 14455.94 ms. Allocated memory was 151.0 MB in the beginning and 189.8 MB in the end (delta: 38.8 MB). Free memory was 126.5 MB in the beginning and 89.2 MB in the end (delta: 37.3 MB). Peak memory consumption was 77.7 MB. Max. memory is 8.0 GB. [2021-10-07 15:38:24,219 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-07 15:38:24,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.63 ms. Allocated memory is still 151.0 MB. Free memory was 125.9 MB in the beginning and 115.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-10-07 15:38:24,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.65 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 113.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-07 15:38:24,221 INFO L168 Benchmark]: Boogie Preprocessor took 32.26 ms. Allocated memory is still 151.0 MB. Free memory was 113.6 MB in the beginning and 112.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-07 15:38:24,221 INFO L168 Benchmark]: RCFGBuilder took 758.17 ms. Allocated memory is still 151.0 MB. Free memory was 112.3 MB in the beginning and 96.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-10-07 15:38:24,222 INFO L168 Benchmark]: TraceAbstraction took 13301.44 ms. Allocated memory was 151.0 MB in the beginning and 189.8 MB in the end (delta: 38.8 MB). Free memory was 95.8 MB in the beginning and 89.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 46.2 MB. Max. memory is 8.0 GB. [2021-10-07 15:38:24,226 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 289.63 ms. Allocated memory is still 151.0 MB. Free memory was 125.9 MB in the beginning and 115.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.65 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 113.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.26 ms. Allocated memory is still 151.0 MB. Free memory was 113.6 MB in the beginning and 112.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 758.17 ms. Allocated memory is still 151.0 MB. Free memory was 112.3 MB in the beginning and 96.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13301.44 ms. Allocated memory was 151.0 MB in the beginning and 189.8 MB in the end (delta: 38.8 MB). Free memory was 95.8 MB in the beginning and 89.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 46.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10064.7ms, 104 PlacesBefore, 30 PlacesAfterwards, 102 TransitionsBefore, 23 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 7 FixpointIterations, 80 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 0 ConcurrentYvCompositions, 5 ChoiceCompositions, 120 TotalNumberOfCompositions, 282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 282, positive: 282, positive conditional: 0, positive unconditional: 282, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 107, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 107, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 107, unknown conditional: 0, unknown unconditional: 107] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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 - UnprovableResult [Line: 79]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 79. Possible FailurePath: [L38] 0 int ora_0, ora_2; [L39] 0 int volume_totale_1, volume_totale_3; [L40] 0 int cmp_4, cmp_5; [L62] 0 pthread_t t1, t2; [L65] 0 ora_0 = __VERIFIER_nondet_int() [L66] 0 ora_2 = __VERIFIER_nondet_int() [L67] 0 volume_totale_1 = __VERIFIER_nondet_int() [L68] 0 volume_totale_3 = __VERIFIER_nondet_int() [L69] 0 cmp_4 = __VERIFIER_nondet_int() [L70] 0 cmp_5 = __VERIFIER_nondet_int() [L73] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) [L44] 1 cmp_4 = ( ora_0 - ora_2 ) [L45] EXPR 1 ( cmp_4 == 0 ) ? ( volume_totale_1 - volume_totale_3 ) : cmp_4 [L45] 1 cmp_4 = ( ( cmp_4 == 0 ) ? ( volume_totale_1 - volume_totale_3 ) : cmp_4 ) [L48] 1 return 0; [L74] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, cmp_4=-2147483648, ora_0=-2147483648, ora_2=0, volume_totale_1=0, volume_totale_3=0] [L75] 0 \read(t1) VAL [\result={0:0}, cmp_4=-2147483648, ora_0=-2147483648, ora_2=0, volume_totale_1=0, volume_totale_3=0] [L75] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, cmp_4=-2147483648, ora_0=-2147483648, ora_2=0, volume_totale_1=0, volume_totale_3=0] [L76] 0 \read(t2) VAL [\result={0:0}, cmp_4=-2147483648, ora_0=-2147483648, ora_2=0, volume_totale_1=0, volume_totale_3=0] [L53] 2 cmp_5 = ( ora_2 - ora_0 ) [L54] EXPR 2 ( cmp_5 == 0 ) ? ( volume_totale_3 - volume_totale_1 ) : cmp_5 [L54] 2 cmp_5 = ( ( cmp_5 == 0 ) ? ( volume_totale_3 - volume_totale_1 ) : cmp_5 ) [L57] 2 return 0; [L76] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, cmp_4=-2147483648, cmp_5=-2147483648, ora_0=-2147483648, ora_2=0, volume_totale_1=0, volume_totale_3=0] [L78] 0 ( cmp_4 < 0 ) ? ( - 1 ) : ( ( cmp_4 > 0 ) ? 1 : 0 ) [L78] 0 ( cmp_5 < 0 ) ? ( - 1 ) : ( ( cmp_5 > 0 ) ? 1 : 0 ) [L35] COND FALSE 0 !(!cond) [L79] 0 reach_error() VAL [\result={0:0}, \result={0:0}, cmp_4=-2147483648, cmp_5=-2147483648, ora_0=-2147483648, ora_2=0, volume_totale_1=0, volume_totale_3=0] - UnprovableResult [Line: 73]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 73]: 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: 74]: 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 5 procedures, 108 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 13073.1ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 10.6ms, AutomataDifference: 150.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10150.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 50 SDslu, 0 SDs, 0 SdLazy, 17 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 43.8ms AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 71.5ms SsaConstructionTime, 146.6ms SatisfiabilityAnalysisTime, 825.3ms InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 10 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-07 15:38:24,268 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...