/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/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c503be2 [2021-10-13 20:29:25,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 20:29:25,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 20:29:25,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 20:29:25,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 20:29:25,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 20:29:25,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 20:29:25,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 20:29:25,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 20:29:25,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 20:29:25,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 20:29:25,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 20:29:25,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 20:29:25,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 20:29:25,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 20:29:25,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 20:29:25,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 20:29:25,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 20:29:25,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 20:29:25,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 20:29:25,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 20:29:25,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 20:29:25,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 20:29:25,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 20:29:25,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 20:29:25,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 20:29:25,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 20:29:25,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 20:29:25,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 20:29:25,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 20:29:25,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 20:29:25,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 20:29:25,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 20:29:25,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 20:29:25,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 20:29:25,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 20:29:25,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 20:29:25,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 20:29:25,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 20:29:25,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 20:29:25,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 20:29:25,842 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-10-13 20:29:25,870 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 20:29:25,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 20:29:25,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 20:29:25,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 20:29:25,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 20:29:25,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 20:29:25,872 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 20:29:25,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 20:29:25,873 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 20:29:25,873 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 20:29:25,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 20:29:25,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 20:29:25,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 20:29:25,874 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 20:29:25,874 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 20:29:25,874 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 20:29:25,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 20:29:25,875 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 20:29:25,875 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 20:29:25,875 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 20:29:25,875 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 20:29:25,875 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 20:29:25,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 20:29:25,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 20:29:25,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 20:29:25,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 20:29:25,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 20:29:25,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 20:29:25,877 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-13 20:29:25,877 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 20:29:25,877 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 20:29:25,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 20:29:25,878 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-13 20:29:26,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 20:29:26,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 20:29:26,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 20:29:26,358 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 20:29:26,358 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 20:29:26,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2021-10-13 20:29:26,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80f72dfe9/aa436ffd99ce4233b88bfe1d2a6ca2a4/FLAGc5ae93ff4 [2021-10-13 20:29:27,233 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 20:29:27,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2021-10-13 20:29:27,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80f72dfe9/aa436ffd99ce4233b88bfe1d2a6ca2a4/FLAGc5ae93ff4 [2021-10-13 20:29:27,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80f72dfe9/aa436ffd99ce4233b88bfe1d2a6ca2a4 [2021-10-13 20:29:27,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 20:29:27,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 20:29:27,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 20:29:27,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 20:29:27,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 20:29:27,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:29:27" (1/1) ... [2021-10-13 20:29:27,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f19aa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:27, skipping insertion in model container [2021-10-13 20:29:27,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:29:27" (1/1) ... [2021-10-13 20:29:27,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 20:29:27,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 20:29:27,954 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/parallel-lamport.wvr.c[2922,2935] [2021-10-13 20:29:27,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 20:29:28,007 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-10-13 20:29:28,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 20:29:28,049 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/parallel-lamport.wvr.c[2922,2935] [2021-10-13 20:29:28,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 20:29:28,060 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 20:29:28,091 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/parallel-lamport.wvr.c[2922,2935] [2021-10-13 20:29:28,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 20:29:28,117 INFO L208 MainTranslator]: Completed translation [2021-10-13 20:29:28,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28 WrapperNode [2021-10-13 20:29:28,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 20:29:28,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 20:29:28,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 20:29:28,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 20:29:28,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 20:29:28,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 20:29:28,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 20:29:28,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 20:29:28,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 20:29:28,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 20:29:28,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 20:29:28,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 20:29:28,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (1/1) ... [2021-10-13 20:29:28,248 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 20:29:28,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-13 20:29:28,284 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-13 20:29:28,292 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-13 20:29:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 20:29:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 20:29:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-13 20:29:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-13 20:29:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-13 20:29:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-13 20:29:28,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-13 20:29:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-13 20:29:28,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-13 20:29:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 20:29:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 20:29:28,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 20:29:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 20:29:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-13 20:29:28,370 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 20:29:29,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 20:29:29,200 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-10-13 20:29:29,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:29:29 BoogieIcfgContainer [2021-10-13 20:29:29,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 20:29:29,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 20:29:29,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 20:29:29,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 20:29:29,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:29:27" (1/3) ... [2021-10-13 20:29:29,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb045b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:29:29, skipping insertion in model container [2021-10-13 20:29:29,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:29:28" (2/3) ... [2021-10-13 20:29:29,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb045b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:29:29, skipping insertion in model container [2021-10-13 20:29:29,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:29:29" (3/3) ... [2021-10-13 20:29:29,227 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2021-10-13 20:29:29,237 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 20:29:29,238 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2021-10-13 20:29:29,238 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 20:29:29,286 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,286 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,286 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,287 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,287 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,287 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,287 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,287 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,288 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,288 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,288 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,288 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,289 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,289 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,290 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,290 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,290 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,290 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,291 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,291 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,291 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,291 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,291 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,292 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,299 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,299 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,299 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,300 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,300 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,300 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,300 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,301 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,301 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,301 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,301 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,301 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,309 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,309 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,309 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,310 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,311 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,311 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,312 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,312 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,312 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,312 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,313 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,314 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,315 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,315 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,315 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,316 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,317 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,317 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,317 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,317 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,318 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,318 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,318 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,318 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,319 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,321 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,321 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,321 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,322 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,322 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,323 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,323 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,323 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,323 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,325 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,326 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,327 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,328 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,329 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,329 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,330 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,334 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,334 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,334 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,334 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,335 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,336 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,336 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,336 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,336 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,337 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,337 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,337 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,337 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,337 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,337 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,338 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,339 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,339 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,340 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,340 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,340 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,341 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,341 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,342 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,342 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,345 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,346 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,362 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,363 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,363 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,366 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,366 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 20:29:29,381 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-13 20:29:29,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 20:29:29,462 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-13 20:29:29,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2021-10-13 20:29:29,504 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 20:29:29,518 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 231 transitions, 486 flow [2021-10-13 20:29:29,522 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 231 transitions, 486 flow [2021-10-13 20:29:29,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 231 transitions, 486 flow [2021-10-13 20:29:29,699 INFO L129 PetriNetUnfolder]: 14/228 cut-off events. [2021-10-13 20:29:29,700 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-13 20:29:29,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 228 events. 14/228 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 323 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 176. Up to 2 conditions per place. [2021-10-13 20:29:29,720 INFO L116 LiptonReduction]: Number of co-enabled transitions 7112 [2021-10-13 20:29:56,482 INFO L131 LiptonReduction]: Checked pairs total: 27341 [2021-10-13 20:29:56,483 INFO L133 LiptonReduction]: Total number of compositions: 247 [2021-10-13 20:29:56,497 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 68 transitions, 160 flow [2021-10-13 20:29:56,742 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5914 states, 5710 states have (on average 3.632749562171629) internal successors, (20743), 5913 states have internal predecessors, (20743), 0 states have call successors, (0), 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-13 20:29:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 5914 states, 5710 states have (on average 3.632749562171629) internal successors, (20743), 5913 states have internal predecessors, (20743), 0 states have call successors, (0), 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-13 20:29:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 20:29:56,777 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:29:56,778 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 20:29:56,779 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:29:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:29:56,786 INFO L82 PathProgramCache]: Analyzing trace with hash 27865, now seen corresponding path program 1 times [2021-10-13 20:29:56,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:29:56,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729039940] [2021-10-13 20:29:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:29:56,804 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:29:56,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:29:56,808 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-13 20:29:56,862 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-13 20:29:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:29:56,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 20:29:56,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:29:57,141 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-13 20:29:57,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:29:57,198 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-13 20:29:57,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:29:57,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729039940] [2021-10-13 20:29:57,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729039940] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:29:57,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:29:57,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 20:29:57,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429388698] [2021-10-13 20:29:57,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 20:29:57,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:29:57,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 20:29:57,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:29:57,252 INFO L87 Difference]: Start difference. First operand has 5914 states, 5710 states have (on average 3.632749562171629) internal successors, (20743), 5913 states have internal predecessors, (20743), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:29:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:29:57,481 INFO L93 Difference]: Finished difference Result 5072 states and 16517 transitions. [2021-10-13 20:29:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 20:29:57,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 20:29:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:29:57,564 INFO L225 Difference]: With dead ends: 5072 [2021-10-13 20:29:57,564 INFO L226 Difference]: Without dead ends: 5072 [2021-10-13 20:29:57,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:29:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2021-10-13 20:29:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5070. [2021-10-13 20:29:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5070 states, 4902 states have (on average 3.3694410444716443) internal successors, (16517), 5069 states have internal predecessors, (16517), 0 states have call successors, (0), 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-13 20:29:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 16517 transitions. [2021-10-13 20:29:57,992 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 16517 transitions. Word has length 2 [2021-10-13 20:29:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:29:57,996 INFO L470 AbstractCegarLoop]: Abstraction has 5070 states and 16517 transitions. [2021-10-13 20:29:57,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:29:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 16517 transitions. [2021-10-13 20:29:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 20:29:57,998 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:29:58,002 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 20:29:58,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-10-13 20:29:58,214 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-13 20:29:58,215 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:29:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:29:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 27685, now seen corresponding path program 1 times [2021-10-13 20:29:58,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:29:58,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105045954] [2021-10-13 20:29:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:29:58,218 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:29:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:29:58,220 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-13 20:29:58,229 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-13 20:29:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:29:58,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 20:29:58,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:29:58,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:29:58,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:29:58,835 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:29:58,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:29:58,979 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-13 20:29:58,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:29:59,087 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-13 20:29:59,087 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:29:59,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105045954] [2021-10-13 20:29:59,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105045954] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:29:59,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:29:59,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 20:29:59,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550974005] [2021-10-13 20:29:59,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 20:29:59,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:29:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 20:29:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:29:59,092 INFO L87 Difference]: Start difference. First operand 5070 states and 16517 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:29:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:29:59,590 INFO L93 Difference]: Finished difference Result 5073 states and 16521 transitions. [2021-10-13 20:29:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 20:29:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 20:29:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:29:59,645 INFO L225 Difference]: With dead ends: 5073 [2021-10-13 20:29:59,646 INFO L226 Difference]: Without dead ends: 5073 [2021-10-13 20:29:59,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:29:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2021-10-13 20:29:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 5071. [2021-10-13 20:29:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 4903 states have (on average 3.3695696512339386) internal successors, (16521), 5070 states have internal predecessors, (16521), 0 states have call successors, (0), 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-13 20:29:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 16521 transitions. [2021-10-13 20:29:59,897 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 16521 transitions. Word has length 2 [2021-10-13 20:29:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:29:59,898 INFO L470 AbstractCegarLoop]: Abstraction has 5071 states and 16521 transitions. [2021-10-13 20:29:59,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:29:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 16521 transitions. [2021-10-13 20:29:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 20:29:59,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:29:59,899 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 20:29:59,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:00,110 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-13 20:30:00,111 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash 27686, now seen corresponding path program 1 times [2021-10-13 20:30:00,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:00,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168250550] [2021-10-13 20:30:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:00,115 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:00,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:00,116 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-13 20:30:00,120 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-13 20:30:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:00,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 20:30:00,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:00,406 INFO L354 Elim1Store]: treesize reduction 350, result has 15.7 percent of original size [2021-10-13 20:30:00,406 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 6 case distinctions, treesize of input 24 treesize of output 70 [2021-10-13 20:30:01,116 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-13 20:30:01,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:01,121 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-13 20:30:01,121 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:01,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168250550] [2021-10-13 20:30:01,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168250550] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:30:01,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:30:01,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-13 20:30:01,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422504816] [2021-10-13 20:30:01,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 20:30:01,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:01,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 20:30:01,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 20:30:01,124 INFO L87 Difference]: Start difference. First operand 5071 states and 16521 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:01,323 INFO L93 Difference]: Finished difference Result 5070 states and 16518 transitions. [2021-10-13 20:30:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 20:30:01,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 20:30:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:01,430 INFO L225 Difference]: With dead ends: 5070 [2021-10-13 20:30:01,430 INFO L226 Difference]: Without dead ends: 5070 [2021-10-13 20:30:01,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 20:30:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states. [2021-10-13 20:30:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 5070. [2021-10-13 20:30:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5070 states, 4903 states have (on average 3.3689577809504385) internal successors, (16518), 5069 states have internal predecessors, (16518), 0 states have call successors, (0), 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-13 20:30:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 16518 transitions. [2021-10-13 20:30:01,679 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 16518 transitions. Word has length 2 [2021-10-13 20:30:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:01,683 INFO L470 AbstractCegarLoop]: Abstraction has 5070 states and 16518 transitions. [2021-10-13 20:30:01,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 16518 transitions. [2021-10-13 20:30:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 20:30:01,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:01,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 20:30:01,702 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-13 20:30:01,884 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-13 20:30:01,885 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 862819, now seen corresponding path program 1 times [2021-10-13 20:30:01,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:01,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239402891] [2021-10-13 20:30:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:01,888 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:01,889 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-13 20:30:01,920 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-13 20:30:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:01,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-13 20:30:01,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:02,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:02,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:02,396 INFO L354 Elim1Store]: treesize reduction 241, result has 18.6 percent of original size [2021-10-13 20:30:02,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 102 [2021-10-13 20:30:02,413 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 20:30:02,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 217 [2021-10-13 20:30:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:06,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:06,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:06,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239402891] [2021-10-13 20:30:06,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239402891] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:30:06,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:30:06,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2021-10-13 20:30:06,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553723902] [2021-10-13 20:30:06,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 20:30:06,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 20:30:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:30:06,865 INFO L87 Difference]: Start difference. First operand 5070 states and 16518 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-13 20:30:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:07,946 INFO L93 Difference]: Finished difference Result 9158 states and 29448 transitions. [2021-10-13 20:30:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 20:30:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-13 20:30:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:08,009 INFO L225 Difference]: With dead ends: 9158 [2021-10-13 20:30:08,010 INFO L226 Difference]: Without dead ends: 9158 [2021-10-13 20:30:08,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 481.9ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:30:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9158 states. [2021-10-13 20:30:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9158 to 6473. [2021-10-13 20:30:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6473 states, 6306 states have (on average 3.59720900729464) internal successors, (22684), 6472 states have internal predecessors, (22684), 0 states have call successors, (0), 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-13 20:30:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6473 states to 6473 states and 22684 transitions. [2021-10-13 20:30:08,396 INFO L78 Accepts]: Start accepts. Automaton has 6473 states and 22684 transitions. Word has length 3 [2021-10-13 20:30:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:08,397 INFO L470 AbstractCegarLoop]: Abstraction has 6473 states and 22684 transitions. [2021-10-13 20:30:08,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-13 20:30:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6473 states and 22684 transitions. [2021-10-13 20:30:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 20:30:08,398 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:08,398 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 20:30:08,414 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-13 20:30:08,611 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-13 20:30:08,611 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:08,612 INFO L82 PathProgramCache]: Analyzing trace with hash 862820, now seen corresponding path program 1 times [2021-10-13 20:30:08,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:08,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299106087] [2021-10-13 20:30:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:08,613 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:08,614 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-13 20:30:08,617 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-13 20:30:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:08,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 20:30:08,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:09,080 INFO L354 Elim1Store]: treesize reduction 358, result has 15.4 percent of original size [2021-10-13 20:30:09,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 194 treesize of output 233 [2021-10-13 20:30:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:14,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:14,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:14,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299106087] [2021-10-13 20:30:14,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299106087] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:30:14,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:30:14,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 20:30:14,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338632477] [2021-10-13 20:30:14,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 20:30:14,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:14,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 20:30:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:14,965 INFO L87 Difference]: Start difference. First operand 6473 states and 22684 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-13 20:30:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:15,237 INFO L93 Difference]: Finished difference Result 5492 states and 18116 transitions. [2021-10-13 20:30:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 20:30:15,238 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-13 20:30:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:15,267 INFO L225 Difference]: With dead ends: 5492 [2021-10-13 20:30:15,267 INFO L226 Difference]: Without dead ends: 5492 [2021-10-13 20:30:15,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2021-10-13 20:30:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5492. [2021-10-13 20:30:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5492 states, 5362 states have (on average 3.3785900783289815) internal successors, (18116), 5491 states have internal predecessors, (18116), 0 states have call successors, (0), 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-13 20:30:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 18116 transitions. [2021-10-13 20:30:15,544 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 18116 transitions. Word has length 3 [2021-10-13 20:30:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:15,545 INFO L470 AbstractCegarLoop]: Abstraction has 5492 states and 18116 transitions. [2021-10-13 20:30:15,545 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-13 20:30:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 18116 transitions. [2021-10-13 20:30:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 20:30:15,546 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:15,546 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-13 20:30:15,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:15,761 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-13 20:30:15,763 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 26746213, now seen corresponding path program 1 times [2021-10-13 20:30:15,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:15,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896405589] [2021-10-13 20:30:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:15,767 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:15,768 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-13 20:30:15,769 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-13 20:30:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:15,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 20:30:15,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:15,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:15,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:16,107 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:30:16,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:30:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:16,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:16,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:16,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896405589] [2021-10-13 20:30:16,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896405589] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:30:16,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:30:16,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 20:30:16,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265653194] [2021-10-13 20:30:16,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:30:16,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:16,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:30:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:30:16,635 INFO L87 Difference]: Start difference. First operand 5492 states and 18116 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:18,490 INFO L93 Difference]: Finished difference Result 19446 states and 61049 transitions. [2021-10-13 20:30:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 20:30:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-13 20:30:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:18,609 INFO L225 Difference]: With dead ends: 19446 [2021-10-13 20:30:18,609 INFO L226 Difference]: Without dead ends: 19446 [2021-10-13 20:30:18,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 719.4ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-10-13 20:30:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19446 states. [2021-10-13 20:30:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19446 to 5494. [2021-10-13 20:30:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5494 states, 5364 states have (on average 3.378076062639821) internal successors, (18120), 5493 states have internal predecessors, (18120), 0 states have call successors, (0), 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-13 20:30:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 18120 transitions. [2021-10-13 20:30:19,096 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 18120 transitions. Word has length 4 [2021-10-13 20:30:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:19,096 INFO L470 AbstractCegarLoop]: Abstraction has 5494 states and 18120 transitions. [2021-10-13 20:30:19,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 18120 transitions. [2021-10-13 20:30:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 20:30:19,098 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:19,098 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 20:30:19,113 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-13 20:30:19,310 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-13 20:30:19,311 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash 829187389, now seen corresponding path program 1 times [2021-10-13 20:30:19,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:19,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725516751] [2021-10-13 20:30:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:19,314 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:19,316 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-13 20:30:19,323 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-13 20:30:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:19,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 20:30:19,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:19,603 INFO L354 Elim1Store]: treesize reduction 350, result has 15.7 percent of original size [2021-10-13 20:30:19,603 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 7 case distinctions, treesize of input 73 treesize of output 116 [2021-10-13 20:30:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:25,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:25,922 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:25,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725516751] [2021-10-13 20:30:25,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725516751] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:30:25,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:30:25,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 20:30:25,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903002805] [2021-10-13 20:30:25,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 20:30:25,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 20:30:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:25,928 INFO L87 Difference]: Start difference. First operand 5494 states and 18120 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-13 20:30:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:26,087 INFO L93 Difference]: Finished difference Result 5410 states and 17888 transitions. [2021-10-13 20:30:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 20:30:26,088 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-13 20:30:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:26,119 INFO L225 Difference]: With dead ends: 5410 [2021-10-13 20:30:26,120 INFO L226 Difference]: Without dead ends: 5410 [2021-10-13 20:30:26,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-10-13 20:30:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 5410. [2021-10-13 20:30:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5410 states, 5295 states have (on average 3.378281397544854) internal successors, (17888), 5409 states have internal predecessors, (17888), 0 states have call successors, (0), 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-13 20:30:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5410 states to 5410 states and 17888 transitions. [2021-10-13 20:30:26,362 INFO L78 Accepts]: Start accepts. Automaton has 5410 states and 17888 transitions. Word has length 5 [2021-10-13 20:30:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:26,363 INFO L470 AbstractCegarLoop]: Abstraction has 5410 states and 17888 transitions. [2021-10-13 20:30:26,363 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-13 20:30:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5410 states and 17888 transitions. [2021-10-13 20:30:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 20:30:26,364 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:26,364 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 20:30:26,383 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-13 20:30:26,578 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-13 20:30:26,578 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash 829187388, now seen corresponding path program 1 times [2021-10-13 20:30:26,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:26,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307911255] [2021-10-13 20:30:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:26,580 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:26,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:26,582 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-13 20:30:26,589 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-13 20:30:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:26,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 20:30:26,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:26,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:26,993 INFO L354 Elim1Store]: treesize reduction 235, result has 20.6 percent of original size [2021-10-13 20:30:26,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 89 [2021-10-13 20:30:26,999 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 116 treesize of output 114 [2021-10-13 20:30:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:32,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:32,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:32,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307911255] [2021-10-13 20:30:32,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307911255] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:30:32,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:30:32,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 20:30:32,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811918017] [2021-10-13 20:30:32,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:30:32,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:30:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:30:32,508 INFO L87 Difference]: Start difference. First operand 5410 states and 17888 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-13 20:30:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:33,072 INFO L93 Difference]: Finished difference Result 6860 states and 21408 transitions. [2021-10-13 20:30:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 20:30:33,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-13 20:30:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:33,098 INFO L225 Difference]: With dead ends: 6860 [2021-10-13 20:30:33,098 INFO L226 Difference]: Without dead ends: 6860 [2021-10-13 20:30:33,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 366.0ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-13 20:30:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2021-10-13 20:30:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 5326. [2021-10-13 20:30:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5326 states, 5226 states have (on average 3.3784921546115574) internal successors, (17656), 5325 states have internal predecessors, (17656), 0 states have call successors, (0), 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-13 20:30:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 17656 transitions. [2021-10-13 20:30:33,344 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 17656 transitions. Word has length 5 [2021-10-13 20:30:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:33,345 INFO L470 AbstractCegarLoop]: Abstraction has 5326 states and 17656 transitions. [2021-10-13 20:30:33,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-13 20:30:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 17656 transitions. [2021-10-13 20:30:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 20:30:33,346 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:33,346 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1] [2021-10-13 20:30:33,365 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-13 20:30:33,562 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-13 20:30:33,563 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash -66551975, now seen corresponding path program 2 times [2021-10-13 20:30:33,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:33,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698630476] [2021-10-13 20:30:33,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:30:33,567 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:33,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:30:33,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 20:30:33,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:30:33,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:30:33,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 20:30:33,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:33,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:33,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:33,995 INFO L354 Elim1Store]: treesize reduction 241, result has 18.6 percent of original size [2021-10-13 20:30:33,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 102 [2021-10-13 20:30:34,009 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 20:30:34,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 216 [2021-10-13 20:30:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:30:39,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:30:39,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:39,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698630476] [2021-10-13 20:30:39,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698630476] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:30:39,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:30:39,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 20:30:39,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222198842] [2021-10-13 20:30:39,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 20:30:39,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 20:30:39,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:39,822 INFO L87 Difference]: Start difference. First operand 5326 states and 17656 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-13 20:30:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:40,069 INFO L93 Difference]: Finished difference Result 5325 states and 17653 transitions. [2021-10-13 20:30:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 20:30:40,070 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 6 [2021-10-13 20:30:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:40,091 INFO L225 Difference]: With dead ends: 5325 [2021-10-13 20:30:40,091 INFO L226 Difference]: Without dead ends: 5325 [2021-10-13 20:30:40,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-10-13 20:30:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 5325. [2021-10-13 20:30:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5325 states, 5226 states have (on average 3.377918101798699) internal successors, (17653), 5324 states have internal predecessors, (17653), 0 states have call successors, (0), 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-13 20:30:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 17653 transitions. [2021-10-13 20:30:40,261 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 17653 transitions. Word has length 6 [2021-10-13 20:30:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:40,261 INFO L470 AbstractCegarLoop]: Abstraction has 5325 states and 17653 transitions. [2021-10-13 20:30:40,261 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-13 20:30:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 17653 transitions. [2021-10-13 20:30:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 20:30:40,262 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:40,262 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:30:40,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:40,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:30:40,478 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2014818757, now seen corresponding path program 1 times [2021-10-13 20:30:40,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:40,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90729503] [2021-10-13 20:30:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:40,480 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:40,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:40,481 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:30:40,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 20:30:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:40,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 20:30:40,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:40,814 INFO L354 Elim1Store]: treesize reduction 350, result has 15.7 percent of original size [2021-10-13 20:30:40,815 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 6 case distinctions, treesize of input 24 treesize of output 70 [2021-10-13 20:30:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:41,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:41,355 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:41,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90729503] [2021-10-13 20:30:41,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90729503] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:30:41,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:30:41,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-13 20:30:41,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976763272] [2021-10-13 20:30:41,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 20:30:41,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 20:30:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 20:30:41,363 INFO L87 Difference]: Start difference. First operand 5325 states and 17653 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-13 20:30:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:41,535 INFO L93 Difference]: Finished difference Result 5124 states and 16888 transitions. [2021-10-13 20:30:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 20:30:41,536 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-13 20:30:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:41,555 INFO L225 Difference]: With dead ends: 5124 [2021-10-13 20:30:41,555 INFO L226 Difference]: Without dead ends: 5124 [2021-10-13 20:30:41,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 20:30:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2021-10-13 20:30:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 5124. [2021-10-13 20:30:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 5038 states have (on average 3.352123858674077) internal successors, (16888), 5123 states have internal predecessors, (16888), 0 states have call successors, (0), 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-13 20:30:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 16888 transitions. [2021-10-13 20:30:41,799 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 16888 transitions. Word has length 7 [2021-10-13 20:30:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:41,800 INFO L470 AbstractCegarLoop]: Abstraction has 5124 states and 16888 transitions. [2021-10-13 20:30:41,801 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-13 20:30:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 16888 transitions. [2021-10-13 20:30:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 20:30:41,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:41,802 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:30:41,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:42,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:30:42,016 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:42,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2014818755, now seen corresponding path program 1 times [2021-10-13 20:30:42,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:42,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498254145] [2021-10-13 20:30:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:42,019 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:42,020 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:30:42,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 20:30:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:42,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 20:30:42,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:42,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:42,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:42,466 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:30:42,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:30:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:42,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:43,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:43,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498254145] [2021-10-13 20:30:43,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498254145] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:30:43,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:30:43,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 20:30:43,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318404777] [2021-10-13 20:30:43,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:30:43,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:43,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:30:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:30:43,017 INFO L87 Difference]: Start difference. First operand 5124 states and 16888 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:43,506 INFO L93 Difference]: Finished difference Result 6055 states and 19129 transitions. [2021-10-13 20:30:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 20:30:43,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 20:30:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:43,523 INFO L225 Difference]: With dead ends: 6055 [2021-10-13 20:30:43,524 INFO L226 Difference]: Without dead ends: 6055 [2021-10-13 20:30:43,524 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 290.7ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-13 20:30:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2021-10-13 20:30:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 4923. [2021-10-13 20:30:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 4850 states have (on average 3.3243298969072166) internal successors, (16123), 4922 states have internal predecessors, (16123), 0 states have call successors, (0), 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-13 20:30:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 16123 transitions. [2021-10-13 20:30:43,711 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 16123 transitions. Word has length 7 [2021-10-13 20:30:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:43,711 INFO L470 AbstractCegarLoop]: Abstraction has 4923 states and 16123 transitions. [2021-10-13 20:30:43,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 16123 transitions. [2021-10-13 20:30:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 20:30:43,715 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:43,715 INFO L512 BasicCegarLoop]: trace histogram [6, 1, 1] [2021-10-13 20:30:43,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:43,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:30:43,930 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash 468029413, now seen corresponding path program 2 times [2021-10-13 20:30:43,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:43,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632163479] [2021-10-13 20:30:43,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:30:43,932 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:43,934 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:30:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 20:30:44,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 20:30:44,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:30:44,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 20:30:44,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:44,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:44,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:44,334 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:30:44,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:30:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:44,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:46,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:46,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632163479] [2021-10-13 20:30:46,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632163479] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:30:46,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:30:46,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2021-10-13 20:30:46,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391775976] [2021-10-13 20:30:46,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-13 20:30:46,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-13 20:30:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-10-13 20:30:46,409 INFO L87 Difference]: Start difference. First operand 4923 states and 16123 transitions. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:56,292 INFO L93 Difference]: Finished difference Result 44706 states and 143984 transitions. [2021-10-13 20:30:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 20:30:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-13 20:30:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:56,463 INFO L225 Difference]: With dead ends: 44706 [2021-10-13 20:30:56,463 INFO L226 Difference]: Without dead ends: 44706 [2021-10-13 20:30:56,464 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 6529.3ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-10-13 20:30:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44706 states. [2021-10-13 20:30:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44706 to 4931. [2021-10-13 20:30:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4931 states, 4858 states have (on average 3.322149032523672) internal successors, (16139), 4930 states have internal predecessors, (16139), 0 states have call successors, (0), 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-13 20:30:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 16139 transitions. [2021-10-13 20:30:57,336 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 16139 transitions. Word has length 8 [2021-10-13 20:30:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:57,336 INFO L470 AbstractCegarLoop]: Abstraction has 4931 states and 16139 transitions. [2021-10-13 20:30:57,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:30:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 16139 transitions. [2021-10-13 20:30:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 20:30:57,338 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:57,338 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:30:57,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:57,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:30:57,552 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err0REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash 789445128, now seen corresponding path program 1 times [2021-10-13 20:30:57,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:57,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110576694] [2021-10-13 20:30:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:57,623 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:57,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:57,624 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:30:57,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 20:30:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:57,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 20:30:57,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:57,960 INFO L354 Elim1Store]: treesize reduction 350, result has 15.7 percent of original size [2021-10-13 20:30:57,960 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 6 case distinctions, treesize of input 24 treesize of output 70 [2021-10-13 20:30:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:58,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:30:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:30:58,472 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:30:58,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110576694] [2021-10-13 20:30:58,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110576694] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:30:58,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:30:58,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 20:30:58,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135783573] [2021-10-13 20:30:58,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 20:30:58,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:30:58,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 20:30:58,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 20:30:58,475 INFO L87 Difference]: Start difference. First operand 4931 states and 16139 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 20:30:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:30:58,627 INFO L93 Difference]: Finished difference Result 3565 states and 11399 transitions. [2021-10-13 20:30:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 20:30:58,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 20:30:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:30:58,637 INFO L225 Difference]: With dead ends: 3565 [2021-10-13 20:30:58,638 INFO L226 Difference]: Without dead ends: 3565 [2021-10-13 20:30:58,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 20:30:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2021-10-13 20:30:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3565. [2021-10-13 20:30:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3540 states have (on average 3.220056497175141) internal successors, (11399), 3564 states have internal predecessors, (11399), 0 states have call successors, (0), 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-13 20:30:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 11399 transitions. [2021-10-13 20:30:58,736 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 11399 transitions. Word has length 9 [2021-10-13 20:30:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:30:58,737 INFO L470 AbstractCegarLoop]: Abstraction has 3565 states and 11399 transitions. [2021-10-13 20:30:58,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 20:30:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 11399 transitions. [2021-10-13 20:30:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 20:30:58,738 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:30:58,738 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:30:58,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 20:30:58,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:30:58,955 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:30:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:30:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash 789445129, now seen corresponding path program 1 times [2021-10-13 20:30:58,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:30:58,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776661739] [2021-10-13 20:30:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:30:58,957 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:30:58,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:30:58,958 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:30:58,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 20:30:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:30:59,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 20:30:59,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:30:59,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:59,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:30:59,383 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:30:59,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:30:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:30:59,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:00,314 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:00,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776661739] [2021-10-13 20:31:00,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776661739] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:31:00,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:31:00,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 20:31:00,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923469018] [2021-10-13 20:31:00,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:31:00,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:31:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:31:00,318 INFO L87 Difference]: Start difference. First operand 3565 states and 11399 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:02,140 INFO L93 Difference]: Finished difference Result 5961 states and 18300 transitions. [2021-10-13 20:31:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 20:31:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 20:31:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:02,162 INFO L225 Difference]: With dead ends: 5961 [2021-10-13 20:31:02,162 INFO L226 Difference]: Without dead ends: 5961 [2021-10-13 20:31:02,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1054.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 20:31:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2021-10-13 20:31:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 4296. [2021-10-13 20:31:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 4271 states have (on average 3.314914539920393) internal successors, (14158), 4295 states have internal predecessors, (14158), 0 states have call successors, (0), 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-13 20:31:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 14158 transitions. [2021-10-13 20:31:02,301 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 14158 transitions. Word has length 9 [2021-10-13 20:31:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:02,301 INFO L470 AbstractCegarLoop]: Abstraction has 4296 states and 14158 transitions. [2021-10-13 20:31:02,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 14158 transitions. [2021-10-13 20:31:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 20:31:02,306 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:02,307 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:02,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-10-13 20:31:02,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:02,520 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:02,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash 789445362, now seen corresponding path program 1 times [2021-10-13 20:31:02,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:02,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355162052] [2021-10-13 20:31:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:31:02,522 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:02,524 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:02,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-13 20:31:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:31:02,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 20:31:02,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:02,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:02,983 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:02,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:03,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:04,195 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:04,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355162052] [2021-10-13 20:31:04,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355162052] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:31:04,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:31:04,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 20:31:04,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866999039] [2021-10-13 20:31:04,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:31:04,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:31:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:31:04,198 INFO L87 Difference]: Start difference. First operand 4296 states and 14158 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:06,552 INFO L93 Difference]: Finished difference Result 5060 states and 15228 transitions. [2021-10-13 20:31:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 20:31:06,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 20:31:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:06,566 INFO L225 Difference]: With dead ends: 5060 [2021-10-13 20:31:06,566 INFO L226 Difference]: Without dead ends: 5060 [2021-10-13 20:31:06,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1508.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 20:31:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5060 states. [2021-10-13 20:31:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5060 to 4127. [2021-10-13 20:31:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4102 states have (on average 3.1626036079960995) internal successors, (12973), 4126 states have internal predecessors, (12973), 0 states have call successors, (0), 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-13 20:31:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 12973 transitions. [2021-10-13 20:31:06,663 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 12973 transitions. Word has length 9 [2021-10-13 20:31:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:06,664 INFO L470 AbstractCegarLoop]: Abstraction has 4127 states and 12973 transitions. [2021-10-13 20:31:06,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 12973 transitions. [2021-10-13 20:31:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 20:31:06,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:06,665 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:06,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-10-13 20:31:06,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:06,881 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2029728287, now seen corresponding path program 1 times [2021-10-13 20:31:06,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:06,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988333453] [2021-10-13 20:31:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:31:06,883 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:06,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:06,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:06,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-13 20:31:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:31:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 20:31:07,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 20:31:07,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:07,193 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 8 treesize of output 6 [2021-10-13 20:31:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 20:31:07,219 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:07,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988333453] [2021-10-13 20:31:07,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988333453] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:31:07,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:31:07,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-13 20:31:07,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342178511] [2021-10-13 20:31:07,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 20:31:07,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 20:31:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:31:07,221 INFO L87 Difference]: Start difference. First operand 4127 states and 12973 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:07,356 INFO L93 Difference]: Finished difference Result 3282 states and 9892 transitions. [2021-10-13 20:31:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 20:31:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 20:31:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:07,365 INFO L225 Difference]: With dead ends: 3282 [2021-10-13 20:31:07,365 INFO L226 Difference]: Without dead ends: 3282 [2021-10-13 20:31:07,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:31:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2021-10-13 20:31:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2579. [2021-10-13 20:31:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 2566 states have (on average 3.019485580670304) internal successors, (7748), 2578 states have internal predecessors, (7748), 0 states have call successors, (0), 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-13 20:31:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 7748 transitions. [2021-10-13 20:31:07,430 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 7748 transitions. Word has length 10 [2021-10-13 20:31:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:07,431 INFO L470 AbstractCegarLoop]: Abstraction has 2579 states and 7748 transitions. [2021-10-13 20:31:07,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 7748 transitions. [2021-10-13 20:31:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 20:31:07,432 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:07,432 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:07,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-13 20:31:07,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:07,647 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash 257372534, now seen corresponding path program 1 times [2021-10-13 20:31:07,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:07,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831042375] [2021-10-13 20:31:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:31:07,648 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:07,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:07,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:07,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-10-13 20:31:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:31:07,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 20:31:07,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:07,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:07,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:08,083 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:08,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:08,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:09,108 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:09,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831042375] [2021-10-13 20:31:09,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831042375] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:31:09,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:31:09,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 20:31:09,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767101731] [2021-10-13 20:31:09,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:31:09,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:09,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:31:09,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:31:09,110 INFO L87 Difference]: Start difference. First operand 2579 states and 7748 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:10,996 INFO L93 Difference]: Finished difference Result 3922 states and 11298 transitions. [2021-10-13 20:31:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 20:31:10,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 20:31:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:11,005 INFO L225 Difference]: With dead ends: 3922 [2021-10-13 20:31:11,005 INFO L226 Difference]: Without dead ends: 3922 [2021-10-13 20:31:11,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1123.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 20:31:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2021-10-13 20:31:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 2677. [2021-10-13 20:31:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2664 states have (on average 2.9894894894894897) internal successors, (7964), 2676 states have internal predecessors, (7964), 0 states have call successors, (0), 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-13 20:31:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 7964 transitions. [2021-10-13 20:31:11,056 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 7964 transitions. Word has length 11 [2021-10-13 20:31:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:11,057 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 7964 transitions. [2021-10-13 20:31:11,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 7964 transitions. [2021-10-13 20:31:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 20:31:11,058 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:11,058 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:11,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-10-13 20:31:11,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:11,263 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1668759167, now seen corresponding path program 2 times [2021-10-13 20:31:11,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:11,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977579512] [2021-10-13 20:31:11,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:31:11,264 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:11,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:11,266 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:11,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-10-13 20:31:11,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:31:11,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:31:11,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 20:31:11,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:11,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:11,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:11,837 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:11,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:31:12,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:31:12,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:12,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977579512] [2021-10-13 20:31:12,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977579512] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:31:12,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:31:12,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-13 20:31:12,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869359129] [2021-10-13 20:31:12,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 20:31:12,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 20:31:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:31:12,883 INFO L87 Difference]: Start difference. First operand 2677 states and 7964 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:13,176 INFO L93 Difference]: Finished difference Result 2311 states and 6753 transitions. [2021-10-13 20:31:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 20:31:13,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 20:31:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:13,183 INFO L225 Difference]: With dead ends: 2311 [2021-10-13 20:31:13,184 INFO L226 Difference]: Without dead ends: 2311 [2021-10-13 20:31:13,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 180.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 20:31:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2021-10-13 20:31:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2021-10-13 20:31:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 2302 states have (on average 2.9335360556038226) internal successors, (6753), 2310 states have internal predecessors, (6753), 0 states have call successors, (0), 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-13 20:31:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 6753 transitions. [2021-10-13 20:31:13,226 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 6753 transitions. Word has length 12 [2021-10-13 20:31:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:13,226 INFO L470 AbstractCegarLoop]: Abstraction has 2311 states and 6753 transitions. [2021-10-13 20:31:13,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 6753 transitions. [2021-10-13 20:31:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 20:31:13,227 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:13,228 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:13,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-10-13 20:31:13,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:13,440 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:13,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:13,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1668759400, now seen corresponding path program 2 times [2021-10-13 20:31:13,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:13,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621741572] [2021-10-13 20:31:13,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:31:13,443 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:13,444 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:13,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-13 20:31:13,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:31:13,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:31:13,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-13 20:31:13,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:13,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:13,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:13,932 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:13,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:31:14,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:31:15,357 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:15,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621741572] [2021-10-13 20:31:15,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621741572] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:31:15,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:31:15,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-13 20:31:15,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542112304] [2021-10-13 20:31:15,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 20:31:15,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 20:31:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:31:15,359 INFO L87 Difference]: Start difference. First operand 2311 states and 6753 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:15,566 INFO L93 Difference]: Finished difference Result 1945 states and 5542 transitions. [2021-10-13 20:31:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 20:31:15,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 20:31:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:15,572 INFO L225 Difference]: With dead ends: 1945 [2021-10-13 20:31:15,572 INFO L226 Difference]: Without dead ends: 1945 [2021-10-13 20:31:15,572 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 173.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 20:31:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2021-10-13 20:31:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1551. [2021-10-13 20:31:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1546 states have (on average 2.8402328589909445) internal successors, (4391), 1550 states have internal predecessors, (4391), 0 states have call successors, (0), 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-13 20:31:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4391 transitions. [2021-10-13 20:31:15,606 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 4391 transitions. Word has length 12 [2021-10-13 20:31:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:15,606 INFO L470 AbstractCegarLoop]: Abstraction has 1551 states and 4391 transitions. [2021-10-13 20:31:15,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 4391 transitions. [2021-10-13 20:31:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 20:31:15,607 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:15,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:15,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-10-13 20:31:15,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:15,808 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash -26943285, now seen corresponding path program 1 times [2021-10-13 20:31:15,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:15,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724554445] [2021-10-13 20:31:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:31:15,811 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:15,812 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-10-13 20:31:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:31:16,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 20:31:16,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:16,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:16,263 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:16,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:16,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:17,539 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:17,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724554445] [2021-10-13 20:31:17,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724554445] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:31:17,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:31:17,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2021-10-13 20:31:17,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880035709] [2021-10-13 20:31:17,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 20:31:17,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 20:31:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-13 20:31:17,541 INFO L87 Difference]: Start difference. First operand 1551 states and 4391 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:21,881 INFO L93 Difference]: Finished difference Result 3220 states and 8886 transitions. [2021-10-13 20:31:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 20:31:21,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 20:31:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:21,891 INFO L225 Difference]: With dead ends: 3220 [2021-10-13 20:31:21,891 INFO L226 Difference]: Without dead ends: 3220 [2021-10-13 20:31:21,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3022.1ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-10-13 20:31:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2021-10-13 20:31:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 1631. [2021-10-13 20:31:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1626 states have (on average 2.8407134071340714) internal successors, (4619), 1630 states have internal predecessors, (4619), 0 states have call successors, (0), 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-13 20:31:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4619 transitions. [2021-10-13 20:31:21,926 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 4619 transitions. Word has length 14 [2021-10-13 20:31:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:21,927 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 4619 transitions. [2021-10-13 20:31:21,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 4619 transitions. [2021-10-13 20:31:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 20:31:21,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:21,928 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:31:21,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-10-13 20:31:22,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:22,135 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -830394260, now seen corresponding path program 2 times [2021-10-13 20:31:22,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:22,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63171454] [2021-10-13 20:31:22,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:31:22,137 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:22,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:22,138 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:22,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-10-13 20:31:22,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:31:22,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:31:22,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 20:31:22,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:22,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:22,615 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:22,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:31:22,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:31:23,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:23,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63171454] [2021-10-13 20:31:23,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63171454] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:31:23,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:31:23,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-13 20:31:23,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691035862] [2021-10-13 20:31:23,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 20:31:23,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:23,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 20:31:23,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:31:23,628 INFO L87 Difference]: Start difference. First operand 1631 states and 4619 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:31:24,013 INFO L93 Difference]: Finished difference Result 1569 states and 4435 transitions. [2021-10-13 20:31:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 20:31:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 20:31:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:31:24,016 INFO L225 Difference]: With dead ends: 1569 [2021-10-13 20:31:24,016 INFO L226 Difference]: Without dead ends: 1569 [2021-10-13 20:31:24,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 173.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 20:31:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2021-10-13 20:31:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1527. [2021-10-13 20:31:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1523 states have (on average 2.8292843072882468) internal successors, (4309), 1526 states have internal predecessors, (4309), 0 states have call successors, (0), 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-13 20:31:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 4309 transitions. [2021-10-13 20:31:24,035 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 4309 transitions. Word has length 14 [2021-10-13 20:31:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:31:24,036 INFO L470 AbstractCegarLoop]: Abstraction has 1527 states and 4309 transitions. [2021-10-13 20:31:24,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:31:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 4309 transitions. [2021-10-13 20:31:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 20:31:24,038 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:31:24,038 INFO L512 BasicCegarLoop]: trace histogram [14, 1, 1] [2021-10-13 20:31:24,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-10-13 20:31:24,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:31:24,239 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:31:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:31:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1373063963, now seen corresponding path program 3 times [2021-10-13 20:31:24,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:31:24,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348125167] [2021-10-13 20:31:24,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 20:31:24,242 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:31:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:31:24,243 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:31:24,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-13 20:31:24,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-10-13 20:31:24,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:31:24,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 20:31:24,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:31:24,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:24,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:31:24,944 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:31:24,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:31:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:25,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:31:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:31:30,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:31:30,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348125167] [2021-10-13 20:31:30,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348125167] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:31:30,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:31:30,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2021-10-13 20:31:30,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882150403] [2021-10-13 20:31:30,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-13 20:31:30,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:31:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-13 20:31:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-10-13 20:31:30,889 INFO L87 Difference]: Start difference. First operand 1527 states and 4309 transitions. Second operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 20:31:44,545 WARN L207 SmtUtils]: Spent 10.72 s on a formula simplification that was a NOOP. DAG size: 168 [2021-10-13 20:31:52,738 WARN L207 SmtUtils]: Spent 7.42 s on a formula simplification that was a NOOP. DAG size: 157 [2021-10-13 20:32:00,498 WARN L207 SmtUtils]: Spent 6.91 s on a formula simplification that was a NOOP. DAG size: 146 [2021-10-13 20:32:06,668 WARN L207 SmtUtils]: Spent 5.27 s on a formula simplification that was a NOOP. DAG size: 136 [2021-10-13 20:32:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:35,540 INFO L93 Difference]: Finished difference Result 30010 states and 83474 transitions. [2021-10-13 20:32:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-13 20:32:35,542 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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 16 [2021-10-13 20:32:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:35,601 INFO L225 Difference]: With dead ends: 30010 [2021-10-13 20:32:35,601 INFO L226 Difference]: Without dead ends: 30010 [2021-10-13 20:32:35,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 56726.2ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-10-13 20:32:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30010 states. [2021-10-13 20:32:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30010 to 1543. [2021-10-13 20:32:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1539 states have (on average 2.820662768031189) internal successors, (4341), 1542 states have internal predecessors, (4341), 0 states have call successors, (0), 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-13 20:32:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 4341 transitions. [2021-10-13 20:32:35,799 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 4341 transitions. Word has length 16 [2021-10-13 20:32:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:35,799 INFO L470 AbstractCegarLoop]: Abstraction has 1543 states and 4341 transitions. [2021-10-13 20:32:35,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 20:32:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 4341 transitions. [2021-10-13 20:32:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 20:32:35,801 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:35,801 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:35,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-10-13 20:32:36,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:36,002 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash -159255019, now seen corresponding path program 2 times [2021-10-13 20:32:36,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:36,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070771022] [2021-10-13 20:32:36,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:32:36,004 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:36,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:36,005 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:36,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-10-13 20:32:36,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:32:36,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:32:36,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 20:32:36,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:36,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:32:36,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:32:36,516 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:32:36,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:32:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:32:36,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:32:37,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:37,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070771022] [2021-10-13 20:32:37,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070771022] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:37,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:37,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2021-10-13 20:32:37,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086447950] [2021-10-13 20:32:37,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 20:32:37,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 20:32:37,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 20:32:37,862 INFO L87 Difference]: Start difference. First operand 1543 states and 4341 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:32:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:38,689 INFO L93 Difference]: Finished difference Result 1605 states and 4455 transitions. [2021-10-13 20:32:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 20:32:38,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 20:32:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:38,693 INFO L225 Difference]: With dead ends: 1605 [2021-10-13 20:32:38,693 INFO L226 Difference]: Without dead ends: 1605 [2021-10-13 20:32:38,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 506.8ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 20:32:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2021-10-13 20:32:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1038. [2021-10-13 20:32:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1034 states have (on average 2.7524177949709863) internal successors, (2846), 1037 states have internal predecessors, (2846), 0 states have call successors, (0), 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-13 20:32:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 2846 transitions. [2021-10-13 20:32:38,710 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 2846 transitions. Word has length 17 [2021-10-13 20:32:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:38,711 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 2846 transitions. [2021-10-13 20:32:38,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:32:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 2846 transitions. [2021-10-13 20:32:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:38,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:38,713 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:38,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:38,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:38,915 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:38,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1569852898, now seen corresponding path program 1 times [2021-10-13 20:32:38,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:38,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641712219] [2021-10-13 20:32:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:32:38,917 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:38,918 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:38,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-10-13 20:32:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:32:39,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 20:32:39,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:39,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:39,668 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:39,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641712219] [2021-10-13 20:32:39,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641712219] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:39,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:39,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-10-13 20:32:39,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082408772] [2021-10-13 20:32:39,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 20:32:39,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 20:32:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-13 20:32:39,669 INFO L87 Difference]: Start difference. First operand 1038 states and 2846 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 20:32:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:40,080 INFO L93 Difference]: Finished difference Result 2022 states and 5492 transitions. [2021-10-13 20:32:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 20:32:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:40,088 INFO L225 Difference]: With dead ends: 2022 [2021-10-13 20:32:40,089 INFO L226 Difference]: Without dead ends: 1964 [2021-10-13 20:32:40,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 358.9ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-10-13 20:32:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2021-10-13 20:32:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1230. [2021-10-13 20:32:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1226 states have (on average 2.7520391517128875) internal successors, (3374), 1229 states have internal predecessors, (3374), 0 states have call successors, (0), 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-13 20:32:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 3374 transitions. [2021-10-13 20:32:40,117 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 3374 transitions. Word has length 22 [2021-10-13 20:32:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:40,118 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 3374 transitions. [2021-10-13 20:32:40,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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-13 20:32:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 3374 transitions. [2021-10-13 20:32:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:40,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:40,121 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:40,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-10-13 20:32:40,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:40,335 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1034206662, now seen corresponding path program 2 times [2021-10-13 20:32:40,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:40,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156184323] [2021-10-13 20:32:40,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:32:40,337 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:40,338 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:40,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-10-13 20:32:40,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:32:40,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:32:40,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 20:32:40,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:40,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:40,721 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:40,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156184323] [2021-10-13 20:32:40,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156184323] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:40,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:40,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-10-13 20:32:40,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244681431] [2021-10-13 20:32:40,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 20:32:40,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 20:32:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 20:32:40,723 INFO L87 Difference]: Start difference. First operand 1230 states and 3374 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 20:32:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:40,796 INFO L93 Difference]: Finished difference Result 1342 states and 3590 transitions. [2021-10-13 20:32:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 20:32:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:40,801 INFO L225 Difference]: With dead ends: 1342 [2021-10-13 20:32:40,801 INFO L226 Difference]: Without dead ends: 1224 [2021-10-13 20:32:40,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 20:32:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2021-10-13 20:32:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1224. [2021-10-13 20:32:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1220 states have (on average 2.736065573770492) internal successors, (3338), 1223 states have internal predecessors, (3338), 0 states have call successors, (0), 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-13 20:32:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3338 transitions. [2021-10-13 20:32:40,858 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3338 transitions. Word has length 22 [2021-10-13 20:32:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:40,858 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 3338 transitions. [2021-10-13 20:32:40,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 20:32:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3338 transitions. [2021-10-13 20:32:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:40,861 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:40,861 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:40,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:41,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:41,075 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1652340164, now seen corresponding path program 3 times [2021-10-13 20:32:41,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:41,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347078794] [2021-10-13 20:32:41,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 20:32:41,078 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:41,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:41,079 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:41,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-10-13 20:32:41,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-10-13 20:32:41,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:32:41,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 20:32:41,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:41,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:41,800 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:41,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347078794] [2021-10-13 20:32:41,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347078794] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:41,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:41,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-10-13 20:32:41,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449511111] [2021-10-13 20:32:41,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 20:32:41,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:41,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 20:32:41,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-13 20:32:41,802 INFO L87 Difference]: Start difference. First operand 1224 states and 3338 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:42,580 INFO L93 Difference]: Finished difference Result 2614 states and 7070 transitions. [2021-10-13 20:32:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 20:32:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:42,586 INFO L225 Difference]: With dead ends: 2614 [2021-10-13 20:32:42,587 INFO L226 Difference]: Without dead ends: 2562 [2021-10-13 20:32:42,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 633.9ms TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2021-10-13 20:32:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2021-10-13 20:32:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 1242. [2021-10-13 20:32:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1238 states have (on average 2.7350565428109856) internal successors, (3386), 1241 states have internal predecessors, (3386), 0 states have call successors, (0), 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-13 20:32:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 3386 transitions. [2021-10-13 20:32:42,618 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 3386 transitions. Word has length 22 [2021-10-13 20:32:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:42,618 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 3386 transitions. [2021-10-13 20:32:42,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 3386 transitions. [2021-10-13 20:32:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:42,621 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:42,621 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:42,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:42,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:42,834 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1555450662, now seen corresponding path program 4 times [2021-10-13 20:32:42,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:42,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939304739] [2021-10-13 20:32:42,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 20:32:42,836 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:42,838 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:42,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-10-13 20:32:43,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 20:32:43,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:32:43,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 20:32:43,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:43,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:43,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:43,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939304739] [2021-10-13 20:32:43,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939304739] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:43,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:43,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-10-13 20:32:43,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670880209] [2021-10-13 20:32:43,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 20:32:43,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:43,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 20:32:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-13 20:32:43,680 INFO L87 Difference]: Start difference. First operand 1242 states and 3386 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:44,430 INFO L93 Difference]: Finished difference Result 2294 states and 6152 transitions. [2021-10-13 20:32:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 20:32:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:44,438 INFO L225 Difference]: With dead ends: 2294 [2021-10-13 20:32:44,439 INFO L226 Difference]: Without dead ends: 2242 [2021-10-13 20:32:44,439 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 671.4ms TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2021-10-13 20:32:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2021-10-13 20:32:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1242. [2021-10-13 20:32:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1238 states have (on average 2.7350565428109856) internal successors, (3386), 1241 states have internal predecessors, (3386), 0 states have call successors, (0), 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-13 20:32:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 3386 transitions. [2021-10-13 20:32:44,472 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 3386 transitions. Word has length 22 [2021-10-13 20:32:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:44,472 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 3386 transitions. [2021-10-13 20:32:44,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 3386 transitions. [2021-10-13 20:32:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:44,476 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:44,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:44,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:44,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:44,690 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2028210908, now seen corresponding path program 5 times [2021-10-13 20:32:44,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:44,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279372073] [2021-10-13 20:32:44,692 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-13 20:32:44,692 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:44,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:44,694 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-10-13 20:32:44,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 20:32:44,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:32:44,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 20:32:44,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:45,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:45,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:45,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279372073] [2021-10-13 20:32:45,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279372073] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:45,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:45,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-10-13 20:32:45,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440476066] [2021-10-13 20:32:45,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 20:32:45,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 20:32:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-13 20:32:45,511 INFO L87 Difference]: Start difference. First operand 1242 states and 3386 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 20:32:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:45,991 INFO L93 Difference]: Finished difference Result 1772 states and 4694 transitions. [2021-10-13 20:32:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 20:32:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:45,996 INFO L225 Difference]: With dead ends: 1772 [2021-10-13 20:32:45,996 INFO L226 Difference]: Without dead ends: 1718 [2021-10-13 20:32:45,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 402.9ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-10-13 20:32:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-10-13 20:32:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1362. [2021-10-13 20:32:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1358 states have (on average 2.7142857142857144) internal successors, (3686), 1361 states have internal predecessors, (3686), 0 states have call successors, (0), 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-13 20:32:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 3686 transitions. [2021-10-13 20:32:46,015 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 3686 transitions. Word has length 22 [2021-10-13 20:32:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:46,016 INFO L470 AbstractCegarLoop]: Abstraction has 1362 states and 3686 transitions. [2021-10-13 20:32:46,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 20:32:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 3686 transitions. [2021-10-13 20:32:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:46,019 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:46,019 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:46,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:46,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:46,225 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1393569564, now seen corresponding path program 6 times [2021-10-13 20:32:46,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:46,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579662211] [2021-10-13 20:32:46,227 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-13 20:32:46,228 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:46,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:46,229 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:46,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-10-13 20:32:46,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-10-13 20:32:46,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:32:46,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 20:32:46,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:46,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:46,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:46,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579662211] [2021-10-13 20:32:46,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579662211] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:46,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:46,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-10-13 20:32:46,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036649687] [2021-10-13 20:32:46,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 20:32:46,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 20:32:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-13 20:32:46,977 INFO L87 Difference]: Start difference. First operand 1362 states and 3686 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:47,349 INFO L93 Difference]: Finished difference Result 1790 states and 4712 transitions. [2021-10-13 20:32:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 20:32:47,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:47,353 INFO L225 Difference]: With dead ends: 1790 [2021-10-13 20:32:47,353 INFO L226 Difference]: Without dead ends: 1738 [2021-10-13 20:32:47,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 361.2ms TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2021-10-13 20:32:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2021-10-13 20:32:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1350. [2021-10-13 20:32:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1346 states have (on average 2.7161961367013374) internal successors, (3656), 1349 states have internal predecessors, (3656), 0 states have call successors, (0), 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-13 20:32:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3656 transitions. [2021-10-13 20:32:47,373 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 3656 transitions. Word has length 22 [2021-10-13 20:32:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:47,373 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 3656 transitions. [2021-10-13 20:32:47,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 3656 transitions. [2021-10-13 20:32:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 20:32:47,376 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:47,376 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:47,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:47,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:47,588 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1296680062, now seen corresponding path program 7 times [2021-10-13 20:32:47,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:47,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092810537] [2021-10-13 20:32:47,590 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 20:32:47,590 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:47,592 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:47,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-10-13 20:32:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:32:47,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 20:32:47,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:48,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 20:32:48,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:48,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092810537] [2021-10-13 20:32:48,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092810537] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:32:48,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:32:48,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-10-13 20:32:48,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852123664] [2021-10-13 20:32:48,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 20:32:48,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:48,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 20:32:48,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-13 20:32:48,389 INFO L87 Difference]: Start difference. First operand 1350 states and 3656 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:48,781 INFO L93 Difference]: Finished difference Result 1470 states and 3794 transitions. [2021-10-13 20:32:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 20:32:48,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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 22 [2021-10-13 20:32:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:48,784 INFO L225 Difference]: With dead ends: 1470 [2021-10-13 20:32:48,784 INFO L226 Difference]: Without dead ends: 1418 [2021-10-13 20:32:48,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 375.4ms TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-10-13 20:32:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2021-10-13 20:32:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 902. [2021-10-13 20:32:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 898 states have (on average 2.5902004454342986) internal successors, (2326), 901 states have internal predecessors, (2326), 0 states have call successors, (0), 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-13 20:32:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2326 transitions. [2021-10-13 20:32:48,801 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 2326 transitions. Word has length 22 [2021-10-13 20:32:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:48,801 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 2326 transitions. [2021-10-13 20:32:48,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 20:32:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 2326 transitions. [2021-10-13 20:32:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 20:32:48,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:48,803 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:48,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:49,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:49,020 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash 802253340, now seen corresponding path program 1 times [2021-10-13 20:32:49,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:49,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420377474] [2021-10-13 20:32:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:32:49,022 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:49,025 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:49,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-10-13 20:32:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:32:49,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 20:32:49,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:49,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:32:49,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:32:49,663 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:32:49,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:32:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:32:50,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:32:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:32:52,837 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:32:52,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420377474] [2021-10-13 20:32:52,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420377474] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:32:52,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:32:52,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-10-13 20:32:52,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856049453] [2021-10-13 20:32:52,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 20:32:52,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:32:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 20:32:52,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-13 20:32:52,839 INFO L87 Difference]: Start difference. First operand 902 states and 2326 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 20:32:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:32:58,419 INFO L93 Difference]: Finished difference Result 2644 states and 6848 transitions. [2021-10-13 20:32:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 20:32:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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 24 [2021-10-13 20:32:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:32:58,428 INFO L225 Difference]: With dead ends: 2644 [2021-10-13 20:32:58,428 INFO L226 Difference]: Without dead ends: 2644 [2021-10-13 20:32:58,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4002.9ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-10-13 20:32:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2021-10-13 20:32:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1273. [2021-10-13 20:32:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 2.620173364854216) internal successors, (3325), 1272 states have internal predecessors, (3325), 0 states have call successors, (0), 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-13 20:32:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 3325 transitions. [2021-10-13 20:32:58,462 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 3325 transitions. Word has length 24 [2021-10-13 20:32:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:32:58,462 INFO L470 AbstractCegarLoop]: Abstraction has 1273 states and 3325 transitions. [2021-10-13 20:32:58,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 20:32:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 3325 transitions. [2021-10-13 20:32:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 20:32:58,465 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:32:58,465 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:32:58,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-10-13 20:32:58,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:32:58,679 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:32:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:32:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash -628012721, now seen corresponding path program 1 times [2021-10-13 20:32:58,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:32:58,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129443885] [2021-10-13 20:32:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 20:32:58,681 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:32:58,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:32:58,682 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:32:58,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-10-13 20:32:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 20:32:59,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 20:32:59,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:32:59,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:32:59,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:32:59,362 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:32:59,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:33:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:33:00,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:33:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:33:02,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:33:02,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129443885] [2021-10-13 20:33:02,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129443885] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:33:02,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:33:02,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-10-13 20:33:02,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657406231] [2021-10-13 20:33:02,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 20:33:02,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:33:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 20:33:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-13 20:33:02,008 INFO L87 Difference]: Start difference. First operand 1273 states and 3325 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:33:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:33:09,784 INFO L93 Difference]: Finished difference Result 2640 states and 6824 transitions. [2021-10-13 20:33:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-13 20:33:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 20:33:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:33:09,793 INFO L225 Difference]: With dead ends: 2640 [2021-10-13 20:33:09,794 INFO L226 Difference]: Without dead ends: 2640 [2021-10-13 20:33:09,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 5827.1ms TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-10-13 20:33:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2021-10-13 20:33:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 1685. [2021-10-13 20:33:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1681 states have (on average 2.6299821534800714) internal successors, (4421), 1684 states have internal predecessors, (4421), 0 states have call successors, (0), 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-13 20:33:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4421 transitions. [2021-10-13 20:33:09,840 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4421 transitions. Word has length 25 [2021-10-13 20:33:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:33:09,840 INFO L470 AbstractCegarLoop]: Abstraction has 1685 states and 4421 transitions. [2021-10-13 20:33:09,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:33:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4421 transitions. [2021-10-13 20:33:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 20:33:09,845 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:33:09,845 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:33:09,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-10-13 20:33:10,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:33:10,061 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:33:10,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:33:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 880012006, now seen corresponding path program 2 times [2021-10-13 20:33:10,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:33:10,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033069067] [2021-10-13 20:33:10,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:33:10,063 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:33:10,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:33:10,064 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:33:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-10-13 20:33:10,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:33:10,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:33:10,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 20:33:10,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:33:10,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:33:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:33:10,666 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:33:10,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:33:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:33:11,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:33:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:33:13,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:33:13,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033069067] [2021-10-13 20:33:13,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033069067] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:33:13,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:33:13,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-10-13 20:33:13,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80003916] [2021-10-13 20:33:13,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 20:33:13,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:33:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 20:33:13,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-13 20:33:13,877 INFO L87 Difference]: Start difference. First operand 1685 states and 4421 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 20:33:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:33:14,604 INFO L93 Difference]: Finished difference Result 1695 states and 4429 transitions. [2021-10-13 20:33:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 20:33:14,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 27 [2021-10-13 20:33:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:33:14,608 INFO L225 Difference]: With dead ends: 1695 [2021-10-13 20:33:14,608 INFO L226 Difference]: Without dead ends: 1695 [2021-10-13 20:33:14,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 608.9ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-10-13 20:33:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2021-10-13 20:33:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1349. [2021-10-13 20:33:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1346 states have (on average 2.6203566121842496) internal successors, (3527), 1348 states have internal predecessors, (3527), 0 states have call successors, (0), 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-13 20:33:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 3527 transitions. [2021-10-13 20:33:14,629 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 3527 transitions. Word has length 27 [2021-10-13 20:33:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:33:14,629 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 3527 transitions. [2021-10-13 20:33:14,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 20:33:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 3527 transitions. [2021-10-13 20:33:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 20:33:14,632 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:33:14,632 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 20:33:14,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-10-13 20:33:14,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:33:14,833 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:33:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:33:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1782505925, now seen corresponding path program 2 times [2021-10-13 20:33:14,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:33:14,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22754591] [2021-10-13 20:33:14,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 20:33:14,835 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:33:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:33:14,836 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:33:14,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-10-13 20:33:15,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 20:33:15,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:33:15,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 20:33:15,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:33:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:33:15,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:33:15,514 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:33:15,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:33:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:33:16,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:33:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 20:33:18,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:33:18,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22754591] [2021-10-13 20:33:18,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22754591] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 20:33:18,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 20:33:18,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-10-13 20:33:18,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317771658] [2021-10-13 20:33:18,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 20:33:18,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:33:18,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 20:33:18,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-13 20:33:18,176 INFO L87 Difference]: Start difference. First operand 1349 states and 3527 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:33:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 20:33:18,782 INFO L93 Difference]: Finished difference Result 1355 states and 3525 transitions. [2021-10-13 20:33:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 20:33:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 20:33:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 20:33:18,787 INFO L225 Difference]: With dead ends: 1355 [2021-10-13 20:33:18,787 INFO L226 Difference]: Without dead ends: 1355 [2021-10-13 20:33:18,788 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 560.9ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-10-13 20:33:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2021-10-13 20:33:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 886. [2021-10-13 20:33:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 2.5927601809954752) internal successors, (2292), 885 states have internal predecessors, (2292), 0 states have call successors, (0), 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-13 20:33:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2292 transitions. [2021-10-13 20:33:18,808 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2292 transitions. Word has length 28 [2021-10-13 20:33:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 20:33:18,809 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 2292 transitions. [2021-10-13 20:33:18,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 20:33:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2292 transitions. [2021-10-13 20:33:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 20:33:18,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 20:33:18,811 INFO L512 BasicCegarLoop]: trace histogram [30, 1, 1] [2021-10-13 20:33:18,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-10-13 20:33:19,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:33:19,025 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 31 more)] === [2021-10-13 20:33:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 20:33:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1792016101, now seen corresponding path program 4 times [2021-10-13 20:33:19,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 20:33:19,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367431017] [2021-10-13 20:33:19,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 20:33:19,027 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 20:33:19,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 20:33:19,028 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 20:33:19,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-10-13 20:33:19,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 20:33:19,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 20:33:19,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2021-10-13 20:33:19,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 20:33:19,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:33:19,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 20:33:19,762 INFO L354 Elim1Store]: treesize reduction 229, result has 22.6 percent of original size [2021-10-13 20:33:19,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 74 [2021-10-13 20:33:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:33:22,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 20:33:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 20:33:48,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 20:33:48,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367431017] [2021-10-13 20:33:48,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367431017] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 20:33:48,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 20:33:48,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2021-10-13 20:33:48,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004050704] [2021-10-13 20:33:48,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-10-13 20:33:48,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 20:33:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-10-13 20:33:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2021-10-13 20:33:48,830 INFO L87 Difference]: Start difference. First operand 886 states and 2292 transitions. Second operand has 64 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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-13 20:35:05,051 WARN L207 SmtUtils]: Spent 1.03 m on a formula simplification that was a NOOP. DAG size: 340 [2021-10-13 20:36:02,139 WARN L207 SmtUtils]: Spent 53.87 s on a formula simplification that was a NOOP. DAG size: 329 [2021-10-13 20:37:03,237 WARN L207 SmtUtils]: Spent 57.44 s on a formula simplification that was a NOOP. DAG size: 318 [2021-10-13 20:37:59,253 WARN L207 SmtUtils]: Spent 52.27 s on a formula simplification that was a NOOP. DAG size: 308 [2021-10-13 20:38:50,808 WARN L207 SmtUtils]: Spent 47.79 s on a formula simplification that was a NOOP. DAG size: 297 [2021-10-13 20:39:42,432 WARN L207 SmtUtils]: Spent 48.11 s on a formula simplification that was a NOOP. DAG size: 286 [2021-10-13 20:40:24,820 WARN L207 SmtUtils]: Spent 38.19 s on a formula simplification that was a NOOP. DAG size: 275 [2021-10-13 20:41:00,610 WARN L207 SmtUtils]: Spent 32.01 s on a formula simplification that was a NOOP. DAG size: 265 [2021-10-13 20:41:35,825 WARN L207 SmtUtils]: Spent 30.54 s on a formula simplification that was a NOOP. DAG size: 254 [2021-10-13 20:42:06,494 WARN L207 SmtUtils]: Spent 25.59 s on a formula simplification that was a NOOP. DAG size: 243 [2021-10-13 20:42:36,400 WARN L207 SmtUtils]: Spent 25.63 s on a formula simplification that was a NOOP. DAG size: 232 [2021-10-13 20:42:59,547 WARN L207 SmtUtils]: Spent 18.74 s on a formula simplification that was a NOOP. DAG size: 222 [2021-10-13 20:43:24,631 WARN L207 SmtUtils]: Spent 21.45 s on a formula simplification that was a NOOP. DAG size: 211 Received shutdown request... [2021-10-13 20:43:29,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-10-13 20:43:29,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-10-13 20:43:29,221 WARN L223 SmtUtils]: Removed 2 from assertion stack [2021-10-13 20:43:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-13 20:43:29,223 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 20:43:29,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-10-13 20:43:29,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 20:43:29,424 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. [2021-10-13 20:43:29,427 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2REQUIRES_VIOLATION [2021-10-13 20:43:29,428 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 20:43:29,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 20:43:29,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2REQUIRES_VIOLATION [2021-10-13 20:43:29,431 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3REQUIRES_VIOLATION [2021-10-13 20:43:29,437 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 20:43:29,438 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 20:43:29,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:43:29 BasicIcfg [2021-10-13 20:43:29,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 20:43:29,441 INFO L168 Benchmark]: Toolchain (without parser) took 841873.30 ms. Allocated memory was 165.7 MB in the beginning and 752.9 MB in the end (delta: 587.2 MB). Free memory was 140.8 MB in the beginning and 122.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 606.8 MB. Max. memory is 8.0 GB. [2021-10-13 20:43:29,441 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 165.7 MB. Free memory was 136.9 MB in the beginning and 136.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-13 20:43:29,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.74 ms. Allocated memory is still 165.7 MB. Free memory was 140.6 MB in the beginning and 127.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-10-13 20:43:29,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.95 ms. Allocated memory is still 165.7 MB. Free memory was 126.9 MB in the beginning and 124.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-13 20:43:29,442 INFO L168 Benchmark]: Boogie Preprocessor took 46.57 ms. Allocated memory is still 165.7 MB. Free memory was 124.9 MB in the beginning and 123.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-13 20:43:29,443 INFO L168 Benchmark]: RCFGBuilder took 970.59 ms. Allocated memory is still 165.7 MB. Free memory was 123.0 MB in the beginning and 139.3 MB in the end (delta: -16.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. [2021-10-13 20:43:29,443 INFO L168 Benchmark]: TraceAbstraction took 840231.32 ms. Allocated memory was 165.7 MB in the beginning and 752.9 MB in the end (delta: 587.2 MB). Free memory was 138.7 MB in the beginning and 122.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 603.8 MB. Max. memory is 8.0 GB. [2021-10-13 20:43:29,445 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.21 ms. Allocated memory is still 165.7 MB. Free memory was 136.9 MB in the beginning and 136.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 540.74 ms. Allocated memory is still 165.7 MB. Free memory was 140.6 MB in the beginning and 127.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 64.95 ms. Allocated memory is still 165.7 MB. Free memory was 126.9 MB in the beginning and 124.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.57 ms. Allocated memory is still 165.7 MB. Free memory was 124.9 MB in the beginning and 123.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 970.59 ms. Allocated memory is still 165.7 MB. Free memory was 123.0 MB in the beginning and 139.3 MB in the end (delta: -16.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 840231.32 ms. Allocated memory was 165.7 MB in the beginning and 752.9 MB in the end (delta: 587.2 MB). Free memory was 138.7 MB in the beginning and 122.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 603.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26961.3ms, 227 PlacesBefore, 74 PlacesAfterwards, 231 TransitionsBefore, 68 TransitionsAfterwards, 7112 CoEnabledTransitionPairs, 13 FixpointIterations, 115 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 16 ConcurrentYvCompositions, 10 ChoiceCompositions, 247 TotalNumberOfCompositions, 27341 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12322, positive: 11720, positive conditional: 0, positive unconditional: 11720, negative: 602, negative conditional: 0, negative unconditional: 602, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4852, positive: 4787, positive conditional: 0, positive unconditional: 4787, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4852, positive: 4734, positive conditional: 0, positive unconditional: 4734, negative: 118, negative conditional: 0, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 118, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1254, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 1219, negative conditional: 0, negative unconditional: 1219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12322, positive: 6933, positive conditional: 0, positive unconditional: 6933, negative: 537, negative conditional: 0, negative unconditional: 537, unknown: 4852, unknown conditional: 0, unknown unconditional: 4852] , Statistics on independence cache: Total cache size (in pairs): 506, Positive cache size: 473, Positive conditional cache size: 0, Positive unconditional cache size: 473, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - 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 - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (886states) and FLOYD_HOARE automaton (currently 46 states, 64 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 200 for 284ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 297 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 839988.8ms, OverallIterations: 35, TraceHistogramMax: 30, EmptinessCheckTime: 90.1ms, AutomataDifference: 692102.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27279.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2962 SDtfs, 39339 SDslu, 35147 SDs, 0 SdLazy, 15082 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54373.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1035 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 665330.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6473occurred in iteration=4, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5125.8ms AutomataMinimizationTime, 34 MinimizatonAttempts, 102142 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 340.6ms SsaConstructionTime, 2249.3ms SatisfiabilityAnalysisTime, 99945.2ms InterpolantComputationTime, 477 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 884 ConstructedInterpolants, 213 QuantifiedInterpolants, 16911 SizeOfPredicates, 359 NumberOfNonLiveVariables, 3099 ConjunctsInSsa, 444 ConjunctsInUnsatCore, 70 InterpolantComputations, 44 PerfectInterpolantSequences, 168/1374 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown