/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/simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-06 21:10:32,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-06 21:10:32,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-06 21:10:32,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-06 21:10:32,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-06 21:10:32,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-06 21:10:32,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-06 21:10:32,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-06 21:10:32,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-06 21:10:32,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-06 21:10:32,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-06 21:10:32,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-06 21:10:32,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-06 21:10:32,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-06 21:10:32,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-06 21:10:32,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-06 21:10:32,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-06 21:10:32,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-06 21:10:32,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-06 21:10:32,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-06 21:10:32,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-06 21:10:32,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-06 21:10:32,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-06 21:10:32,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-06 21:10:32,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-06 21:10:32,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-06 21:10:32,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-06 21:10:32,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-06 21:10:32,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-06 21:10:32,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-06 21:10:32,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-06 21:10:32,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-06 21:10:32,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-06 21:10:32,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-06 21:10:32,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-06 21:10:32,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-06 21:10:32,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-06 21:10:32,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-06 21:10:32,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-06 21:10:32,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-06 21:10:32,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-06 21:10:32,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-10-06 21:10:32,875 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-06 21:10:32,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-06 21:10:32,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-06 21:10:32,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-06 21:10:32,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-06 21:10:32,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-06 21:10:32,878 INFO L138 SettingsManager]: * Use SBE=true [2021-10-06 21:10:32,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-06 21:10:32,878 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-06 21:10:32,879 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-06 21:10:32,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-06 21:10:32,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-06 21:10:32,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-06 21:10:32,879 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-06 21:10:32,880 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-06 21:10:32,880 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-06 21:10:32,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-06 21:10:32,880 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-06 21:10:32,880 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-06 21:10:32,881 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-06 21:10:32,881 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-06 21:10:32,881 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-06 21:10:32,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-06 21:10:32,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-06 21:10:32,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-06 21:10:32,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 21:10:32,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-06 21:10:32,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-06 21:10:32,883 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-06 21:10:32,883 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-06 21:10:32,883 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-06 21:10:32,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-06 21:10:32,884 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-06 21:10:33,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-06 21:10:33,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-06 21:10:33,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-06 21:10:33,356 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-06 21:10:33,357 INFO L275 PluginConnector]: CDTParser initialized [2021-10-06 21:10:33,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/simpl-str-trans.wvr.c [2021-10-06 21:10:33,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e63b48ee/c031377d5ffa442b8cee2ecc0f529d2e/FLAGf8cf76266 [2021-10-06 21:10:34,097 INFO L306 CDTParser]: Found 1 translation units. [2021-10-06 21:10:34,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/simpl-str-trans.wvr.c [2021-10-06 21:10:34,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e63b48ee/c031377d5ffa442b8cee2ecc0f529d2e/FLAGf8cf76266 [2021-10-06 21:10:34,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e63b48ee/c031377d5ffa442b8cee2ecc0f529d2e [2021-10-06 21:10:34,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-06 21:10:34,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-06 21:10:34,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-06 21:10:34,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-06 21:10:34,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-06 21:10:34,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bb9c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34, skipping insertion in model container [2021-10-06 21:10:34,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-06 21:10:34,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-06 21:10:34,723 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/simpl-str-trans.wvr.c[2414,2427] [2021-10-06 21:10:34,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 21:10:34,748 INFO L203 MainTranslator]: Completed pre-run [2021-10-06 21:10:34,804 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/simpl-str-trans.wvr.c[2414,2427] [2021-10-06 21:10:34,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-06 21:10:34,840 INFO L208 MainTranslator]: Completed translation [2021-10-06 21:10:34,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34 WrapperNode [2021-10-06 21:10:34,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-06 21:10:34,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-06 21:10:34,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-06 21:10:34,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-06 21:10:34,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-06 21:10:34,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-06 21:10:34,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-06 21:10:34,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-06 21:10:34,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-06 21:10:34,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-06 21:10:34,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-06 21:10:34,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-06 21:10:34,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (1/1) ... [2021-10-06 21:10:34,939 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-06 21:10:34,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-06 21:10:34,975 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 21:10:34,995 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 21:10:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-06 21:10:35,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-06 21:10:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-06 21:10:35,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-06 21:10:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-06 21:10:35,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-06 21:10:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-06 21:10:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-06 21:10:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-06 21:10:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-06 21:10:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-06 21:10:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-06 21:10:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-06 21:10:35,068 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 21:10:35,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-06 21:10:35,596 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-06 21:10:35,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 09:10:35 BoogieIcfgContainer [2021-10-06 21:10:35,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-06 21:10:35,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-06 21:10:35,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-06 21:10:35,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-06 21:10:35,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 09:10:34" (1/3) ... [2021-10-06 21:10:35,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc18f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 09:10:35, skipping insertion in model container [2021-10-06 21:10:35,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 09:10:34" (2/3) ... [2021-10-06 21:10:35,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc18f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 09:10:35, skipping insertion in model container [2021-10-06 21:10:35,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 09:10:35" (3/3) ... [2021-10-06 21:10:35,659 INFO L111 eAbstractionObserver]: Analyzing ICFG simpl-str-trans.wvr.c [2021-10-06 21:10:35,690 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-06 21:10:35,690 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-10-06 21:10:35,691 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-06 21:10:35,737 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,737 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,738 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,738 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,738 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,738 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,739 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,739 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,739 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,739 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,740 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,740 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,740 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,740 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,740 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,741 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,741 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,741 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,741 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,741 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,742 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,742 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,742 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,742 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,743 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,744 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,744 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,744 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,744 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,745 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,745 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,745 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,745 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,746 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,746 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,746 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,746 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,746 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,747 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,747 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,747 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,747 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,747 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,748 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,748 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,748 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,748 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,749 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,750 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,750 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,750 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,750 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,751 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,751 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,751 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,751 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,752 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,752 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,752 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,752 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,752 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,753 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,753 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,753 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,753 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,753 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,754 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,754 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,754 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,754 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,755 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,755 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,758 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,759 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,759 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,759 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,759 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,765 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,765 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,766 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,768 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,768 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,769 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,769 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,769 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-06 21:10:35,778 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-06 21:10:35,838 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-06 21:10:35,846 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-06 21:10:35,846 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-10-06 21:10:35,865 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-06 21:10:35,878 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 144 transitions, 312 flow [2021-10-06 21:10:35,881 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 144 transitions, 312 flow [2021-10-06 21:10:35,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 144 transitions, 312 flow [2021-10-06 21:10:35,957 INFO L129 PetriNetUnfolder]: 10/141 cut-off events. [2021-10-06 21:10:35,957 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-06 21:10:35,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 10/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 209 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2021-10-06 21:10:35,970 INFO L116 LiptonReduction]: Number of co-enabled transitions 3570 [2021-10-06 21:10:51,809 INFO L131 LiptonReduction]: Checked pairs total: 3507 [2021-10-06 21:10:51,809 INFO L133 LiptonReduction]: Total number of compositions: 159 [2021-10-06 21:10:51,819 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 33 transitions, 90 flow [2021-10-06 21:10:51,836 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 87 states, 73 states have (on average 2.287671232876712) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 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 21:10:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 2.287671232876712) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 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 21:10:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-06 21:10:51,844 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:51,845 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-06 21:10:51,845 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:51,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash 572, now seen corresponding path program 1 times [2021-10-06 21:10:51,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:51,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427028793] [2021-10-06 21:10:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:51,869 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:51,874 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-06 21:10:51,901 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-06 21:10:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:51,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-06 21:10:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:51,960 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 21:10:51,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:51,961 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 21:10:51,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:51,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427028793] [2021-10-06 21:10:51,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427028793] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:51,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:51,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0, 0] imperfect sequences [] total 0 [2021-10-06 21:10:51,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132486173] [2021-10-06 21:10:51,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-06 21:10:51,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-06 21:10:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-06 21:10:51,991 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 2.287671232876712) internal successors, (167), 86 states have internal predecessors, (167), 0 states have call successors, (0), 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 21:10:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:52,009 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2021-10-06 21:10:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-06 21:10:52,011 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 21:10:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:52,023 INFO L225 Difference]: With dead ends: 84 [2021-10-06 21:10:52,023 INFO L226 Difference]: Without dead ends: 84 [2021-10-06 21:10:52,024 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 21:10:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-10-06 21:10:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-10-06 21:10:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 2.2465753424657535) internal successors, (164), 83 states have internal predecessors, (164), 0 states have call successors, (0), 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 21:10:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 164 transitions. [2021-10-06 21:10:52,073 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 164 transitions. Word has length 1 [2021-10-06 21:10:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:52,073 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 164 transitions. [2021-10-06 21:10:52,074 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 21:10:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 164 transitions. [2021-10-06 21:10:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 21:10:52,074 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:52,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 21:10:52,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-06 21:10:52,287 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-06 21:10:52,288 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash 560936, now seen corresponding path program 1 times [2021-10-06 21:10:52,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:52,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035177859] [2021-10-06 21:10:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:52,291 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:52,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:52,293 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-06 21:10:52,294 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-06 21:10:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:52,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:10:52,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:52,736 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-06 21:10:52,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 125 treesize of output 160 [2021-10-06 21:10:55,996 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 21:10:55,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:56,014 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 21:10:56,015 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:56,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035177859] [2021-10-06 21:10:56,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035177859] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:56,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:56,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:10:56,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299739662] [2021-10-06 21:10:56,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:10:56,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:10:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:10:56,019 INFO L87 Difference]: Start difference. First operand 84 states and 164 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-06 21:10:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:56,088 INFO L93 Difference]: Finished difference Result 78 states and 153 transitions. [2021-10-06 21:10:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:10:56,089 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-06 21:10:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:56,090 INFO L225 Difference]: With dead ends: 78 [2021-10-06 21:10:56,091 INFO L226 Difference]: Without dead ends: 78 [2021-10-06 21:10:56,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:10:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-10-06 21:10:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-10-06 21:10:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 2.217391304347826) internal successors, (153), 77 states have internal predecessors, (153), 0 states have call successors, (0), 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 21:10:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 153 transitions. [2021-10-06 21:10:56,103 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 153 transitions. Word has length 3 [2021-10-06 21:10:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:56,103 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 153 transitions. [2021-10-06 21:10:56,103 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-06 21:10:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 153 transitions. [2021-10-06 21:10:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-06 21:10:56,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:56,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-06 21:10:56,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-10-06 21:10:56,316 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-06 21:10:56,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash 560938, now seen corresponding path program 1 times [2021-10-06 21:10:56,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:56,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846379424] [2021-10-06 21:10:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:56,321 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:56,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:56,322 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-06 21:10:56,325 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-06 21:10:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:56,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-06 21:10:56,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:56,521 INFO L354 Elim1Store]: treesize reduction 147, result has 20.5 percent of original size [2021-10-06 21:10:56,522 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 4 case distinctions, treesize of input 40 treesize of output 64 [2021-10-06 21:10:56,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 89 [2021-10-06 21:10:56,755 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 21:10:56,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:56,805 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 21:10:56,806 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:56,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846379424] [2021-10-06 21:10:56,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846379424] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:56,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:56,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:10:56,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206849251] [2021-10-06 21:10:56,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:10:56,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:10:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:10:56,809 INFO L87 Difference]: Start difference. First operand 78 states and 153 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-06 21:10:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:56,857 INFO L93 Difference]: Finished difference Result 72 states and 142 transitions. [2021-10-06 21:10:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:10:56,858 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-06 21:10:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:56,860 INFO L225 Difference]: With dead ends: 72 [2021-10-06 21:10:56,860 INFO L226 Difference]: Without dead ends: 72 [2021-10-06 21:10:56,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:10:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-06 21:10:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-10-06 21:10:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 2.1846153846153844) internal successors, (142), 71 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 21:10:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 142 transitions. [2021-10-06 21:10:56,869 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 142 transitions. Word has length 3 [2021-10-06 21:10:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:56,869 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 142 transitions. [2021-10-06 21:10:56,870 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-06 21:10:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 142 transitions. [2021-10-06 21:10:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 21:10:56,870 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:56,870 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 21:10:56,887 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-06 21:10:57,082 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-06 21:10:57,083 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash 539072617, now seen corresponding path program 1 times [2021-10-06 21:10:57,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:57,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781236565] [2021-10-06 21:10:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:57,086 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:57,087 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-06 21:10:57,092 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-06 21:10:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:57,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-06 21:10:57,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:57,303 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-06 21:10:57,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 59 [2021-10-06 21:10:57,674 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 21:10:57,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:57,689 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 21:10:57,689 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:57,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781236565] [2021-10-06 21:10:57,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781236565] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:57,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:57,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-06 21:10:57,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055632636] [2021-10-06 21:10:57,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 21:10:57,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 21:10:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 21:10:57,692 INFO L87 Difference]: Start difference. First operand 72 states and 142 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-06 21:10:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:57,723 INFO L93 Difference]: Finished difference Result 66 states and 131 transitions. [2021-10-06 21:10:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:10:57,724 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-06 21:10:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:57,725 INFO L225 Difference]: With dead ends: 66 [2021-10-06 21:10:57,725 INFO L226 Difference]: Without dead ends: 66 [2021-10-06 21:10:57,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 21:10:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-06 21:10:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-10-06 21:10:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 2.1475409836065573) internal successors, (131), 65 states have internal predecessors, (131), 0 states have call successors, (0), 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 21:10:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 131 transitions. [2021-10-06 21:10:57,732 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 131 transitions. Word has length 5 [2021-10-06 21:10:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:57,733 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 131 transitions. [2021-10-06 21:10:57,734 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-06 21:10:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 131 transitions. [2021-10-06 21:10:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-06 21:10:57,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:57,734 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-06 21:10:57,751 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-06 21:10:57,952 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-06 21:10:57,953 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash 539072618, now seen corresponding path program 1 times [2021-10-06 21:10:57,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:57,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875946109] [2021-10-06 21:10:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:57,956 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:57,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:57,957 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-06 21:10:57,959 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-06 21:10:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:58,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:10:58,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:58,167 INFO L354 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2021-10-06 21:10:58,167 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 4 case distinctions, treesize of input 18 treesize of output 49 [2021-10-06 21:10:58,246 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 21:10:58,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:58,323 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 21:10:58,324 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:58,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875946109] [2021-10-06 21:10:58,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875946109] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:58,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:58,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-06 21:10:58,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682837178] [2021-10-06 21:10:58,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-06 21:10:58,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-06 21:10:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:10:58,326 INFO L87 Difference]: Start difference. First operand 66 states and 131 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-06 21:10:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:58,351 INFO L93 Difference]: Finished difference Result 60 states and 120 transitions. [2021-10-06 21:10:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:10:58,352 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-06 21:10:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:58,353 INFO L225 Difference]: With dead ends: 60 [2021-10-06 21:10:58,353 INFO L226 Difference]: Without dead ends: 60 [2021-10-06 21:10:58,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-06 21:10:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-06 21:10:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-10-06 21:10:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 59 states have internal predecessors, (120), 0 states have call successors, (0), 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 21:10:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 120 transitions. [2021-10-06 21:10:58,359 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 120 transitions. Word has length 5 [2021-10-06 21:10:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:58,359 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 120 transitions. [2021-10-06 21:10:58,359 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-06 21:10:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 120 transitions. [2021-10-06 21:10:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 21:10:58,360 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:58,360 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-06 21:10:58,375 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-06 21:10:58,571 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-06 21:10:58,572 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1642243702, now seen corresponding path program 1 times [2021-10-06 21:10:58,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:58,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479490728] [2021-10-06 21:10:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:58,575 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:58,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:58,576 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-06 21:10:58,593 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-06 21:10:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:58,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:10:58,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:58,833 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-06 21:10:58,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 59 [2021-10-06 21:10:59,170 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 21:10:59,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:59,212 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 21:10:59,213 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:59,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479490728] [2021-10-06 21:10:59,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479490728] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:59,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:59,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-06 21:10:59,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691258158] [2021-10-06 21:10:59,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-06 21:10:59,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-06 21:10:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 21:10:59,216 INFO L87 Difference]: Start difference. First operand 60 states and 120 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-06 21:10:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:59,248 INFO L93 Difference]: Finished difference Result 52 states and 100 transitions. [2021-10-06 21:10:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:10:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 7 [2021-10-06 21:10:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:59,250 INFO L225 Difference]: With dead ends: 52 [2021-10-06 21:10:59,250 INFO L226 Difference]: Without dead ends: 52 [2021-10-06 21:10:59,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-06 21:10:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-10-06 21:10:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-10-06 21:10:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 2.0) internal successors, (100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 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 21:10:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2021-10-06 21:10:59,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 7 [2021-10-06 21:10:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:59,256 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2021-10-06 21:10:59,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-06 21:10:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2021-10-06 21:10:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-06 21:10:59,257 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:59,257 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-06 21:10:59,275 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-06 21:10:59,467 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-06 21:10:59,468 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:59,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1642243701, now seen corresponding path program 1 times [2021-10-06 21:10:59,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:59,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056309498] [2021-10-06 21:10:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:59,471 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:59,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:59,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:10:59,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-06 21:10:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-06 21:10:59,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-06 21:10:59,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-06 21:10:59,622 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 21:10:59,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-06 21:10:59,711 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 21:10:59,712 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-06 21:10:59,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056309498] [2021-10-06 21:10:59,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056309498] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-06 21:10:59,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-06 21:10:59,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-06 21:10:59,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302193346] [2021-10-06 21:10:59,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-06 21:10:59,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-06 21:10:59,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-06 21:10:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 21:10:59,714 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 21:10:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-06 21:10:59,736 INFO L93 Difference]: Finished difference Result 44 states and 80 transitions. [2021-10-06 21:10:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-06 21:10:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-06 21:10:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-06 21:10:59,738 INFO L225 Difference]: With dead ends: 44 [2021-10-06 21:10:59,739 INFO L226 Difference]: Without dead ends: 44 [2021-10-06 21:10:59,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-06 21:10:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-10-06 21:10:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-10-06 21:10:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 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 21:10:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 80 transitions. [2021-10-06 21:10:59,743 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 80 transitions. Word has length 7 [2021-10-06 21:10:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-06 21:10:59,743 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 80 transitions. [2021-10-06 21:10:59,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-06 21:10:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 80 transitions. [2021-10-06 21:10:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-06 21:10:59,744 INFO L504 BasicCegarLoop]: Found error trace [2021-10-06 21:10:59,744 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-06 21:10:59,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-06 21:10:59,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:10:59,946 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-10-06 21:10:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-06 21:10:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1266416008, now seen corresponding path program 1 times [2021-10-06 21:10:59,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-06 21:10:59,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852154886] [2021-10-06 21:10:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-06 21:10:59,948 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-06 21:10:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-06 21:10:59,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-06 21:10:59,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-06 21:11:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 21:11:00,074 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-06 21:11:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-06 21:11:00,255 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-10-06 21:11:00,256 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-06 21:11:00,257 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK [2021-10-06 21:11:00,262 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-06 21:11:00,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-06 21:11:00,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-06 21:11:00,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-06 21:11:00,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-06 21:11:00,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-06 21:11:00,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-06 21:11:00,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-06 21:11:00,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-06 21:11:00,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-06 21:11:00,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-06 21:11:00,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-06 21:11:00,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK [2021-10-06 21:11:00,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-06 21:11:00,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-06 21:11:00,273 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-06 21:11:00,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-06 21:11:00,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-06 21:11:00,481 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-06 21:11:00,481 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-06 21:11:00,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 09:11:00 BasicIcfg [2021-10-06 21:11:00,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-06 21:11:00,569 INFO L168 Benchmark]: Toolchain (without parser) took 26137.57 ms. Allocated memory was 175.1 MB in the beginning and 210.8 MB in the end (delta: 35.7 MB). Free memory was 149.7 MB in the beginning and 110.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 75.8 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:00,570 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 175.1 MB. Free memory is still 145.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-06 21:11:00,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.54 ms. Allocated memory is still 175.1 MB. Free memory was 149.4 MB in the beginning and 138.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:00,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.84 ms. Allocated memory is still 175.1 MB. Free memory was 138.5 MB in the beginning and 137.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:00,571 INFO L168 Benchmark]: Boogie Preprocessor took 33.25 ms. Allocated memory is still 175.1 MB. Free memory was 137.0 MB in the beginning and 135.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:00,572 INFO L168 Benchmark]: RCFGBuilder took 674.15 ms. Allocated memory is still 175.1 MB. Free memory was 135.6 MB in the beginning and 121.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:00,572 INFO L168 Benchmark]: TraceAbstraction took 24931.71 ms. Allocated memory was 175.1 MB in the beginning and 210.8 MB in the end (delta: 35.7 MB). Free memory was 156.9 MB in the beginning and 110.5 MB in the end (delta: 46.4 MB). Peak memory consumption was 82.0 MB. Max. memory is 8.0 GB. [2021-10-06 21:11:00,580 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.19 ms. Allocated memory is still 175.1 MB. Free memory is still 145.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 403.54 ms. Allocated memory is still 175.1 MB. Free memory was 149.4 MB in the beginning and 138.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.84 ms. Allocated memory is still 175.1 MB. Free memory was 138.5 MB in the beginning and 137.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.25 ms. Allocated memory is still 175.1 MB. Free memory was 137.0 MB in the beginning and 135.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 674.15 ms. Allocated memory is still 175.1 MB. Free memory was 135.6 MB in the beginning and 121.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24931.71 ms. Allocated memory was 175.1 MB in the beginning and 210.8 MB in the end (delta: 35.7 MB). Free memory was 156.9 MB in the beginning and 110.5 MB in the end (delta: 46.4 MB). Peak memory consumption was 82.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15928.0ms, 144 PlacesBefore, 43 PlacesAfterwards, 144 TransitionsBefore, 33 TransitionsAfterwards, 3570 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 10 ChoiceCompositions, 159 TotalNumberOfCompositions, 3507 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3507, positive: 3507, positive conditional: 0, positive unconditional: 3507, 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: 2593, positive: 2593, positive conditional: 0, positive unconditional: 2593, 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: 2593, positive: 2593, positive conditional: 0, positive unconditional: 2593, 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: 3507, positive: 914, positive conditional: 0, positive unconditional: 914, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2593, unknown conditional: 0, unknown unconditional: 2593] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, 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: 72]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 72. Possible FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, length_4, to_int_5, result_6, result_7, result_8; [L53] 0 pthread_t t1, t2, t3; [L56] 0 length_0 = __VERIFIER_nondet_int() [L57] 0 to_int_1 = __VERIFIER_nondet_int() [L58] 0 length_2 = __VERIFIER_nondet_int() [L59] 0 to_int_3 = __VERIFIER_nondet_int() [L60] 0 length_4 = __VERIFIER_nondet_int() [L61] 0 to_int_5 = __VERIFIER_nondet_int() [L64] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) VAL [result_6=0, result_7=0, result_8=0] [L65] FCALL, FORK 0 pthread_create(&t2, NULL, thread2, NULL) VAL [result_6=0, result_7=0, result_8=0] [L41] EXPR 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : to_int_1 - to_int_3) [L41] EXPR 1 length_2 == 0 ? -1 : to_int_1 - to_int_3 [L41] EXPR 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : to_int_1 - to_int_3) [L41] 1 result_6 = length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : to_int_1 - to_int_3) [L45] EXPR 2 length_2 == 0 ? (length_4 == 0 ? 0 : 1) : (length_4 == 0 ? -1 : to_int_3 - to_int_5) [L45] EXPR 2 length_4 == 0 ? -1 : to_int_3 - to_int_5 [L45] EXPR 2 length_2 == 0 ? (length_4 == 0 ? 0 : 1) : (length_4 == 0 ? -1 : to_int_3 - to_int_5) [L45] 2 result_7 = length_2 == 0 ? (length_4 == 0 ? 0 : 1) : (length_4 == 0 ? -1 : to_int_3 - to_int_5) [L66] FCALL, FORK 0 pthread_create(&t3, NULL, thread3, NULL) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=0, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L67] 0 \read(t1) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=0, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L67] FCALL, JOIN 1 pthread_join(t1, 0) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=0, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L68] 0 \read(t2) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=0, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L49] EXPR 3 length_0 == 0 ? (length_4 == 0 ? 0 : 1) : (length_4 == 0 ? -1 : to_int_1 - to_int_5) [L49] EXPR 3 length_4 == 0 ? -1 : to_int_1 - to_int_5 [L49] EXPR 3 length_0 == 0 ? (length_4 == 0 ? 0 : 1) : (length_4 == 0 ? -1 : to_int_1 - to_int_5) [L49] 3 result_8 = length_0 == 0 ? (length_4 == 0 ? 0 : 1) : (length_4 == 0 ? -1 : to_int_1 - to_int_5) [L68] FCALL, JOIN 2 pthread_join(t2, 0) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=-2147483644, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L69] 0 \read(t3) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=-2147483644, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L69] FCALL, JOIN 3 pthread_join(t3, 0) VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=-2147483644, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] [L35] COND FALSE 0 !(!cond) [L72] 0 reach_error() VAL [length_0=2, length_2=2, length_4=2, result_6=65534, result_7=2147418118, result_8=-2147483644, to_int_1=701431813, to_int_3=701366279, to_int_5=-1446051839] - UnprovableResult [Line: 64]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 65]: 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: 66]: 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: 64]: 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, 183 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 24646.2ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 12.1ms, AutomataDifference: 301.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15989.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 100 SDtfs, 135 SDslu, 0 SDs, 0 SdLazy, 43 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 164.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 178.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 70.6ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 67.2ms SsaConstructionTime, 240.5ms SatisfiabilityAnalysisTime, 5671.5ms InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 48 ConstructedInterpolants, 4 QuantifiedInterpolants, 714 SizeOfPredicates, 20 NumberOfNonLiveVariables, 277 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-06 21:11:00,639 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...