/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 02:04:16,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 02:04:16,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 02:04:16,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 02:04:16,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 02:04:16,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 02:04:16,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 02:04:16,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 02:04:16,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 02:04:16,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 02:04:16,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 02:04:16,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 02:04:16,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 02:04:16,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 02:04:16,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 02:04:16,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 02:04:16,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 02:04:16,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 02:04:16,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 02:04:16,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 02:04:16,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 02:04:16,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 02:04:16,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 02:04:16,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 02:04:16,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 02:04:16,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 02:04:16,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 02:04:16,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 02:04:16,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 02:04:16,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 02:04:16,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 02:04:16,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 02:04:16,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 02:04:16,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 02:04:16,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 02:04:16,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 02:04:16,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 02:04:16,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 02:04:16,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 02:04:16,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 02:04:16,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 02:04:16,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-18 02:04:16,692 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 02:04:16,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 02:04:16,693 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 02:04:16,693 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 02:04:16,694 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 02:04:16,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 02:04:16,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 02:04:16,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 02:04:16,694 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 02:04:16,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 02:04:16,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 02:04:16,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 02:04:16,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 02:04:16,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 02:04:16,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:04:16,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 02:04:16,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/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 [2022-01-18 02:04:16,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 02:04:16,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 02:04:16,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 02:04:16,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 02:04:16,903 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 02:04:16,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-01-18 02:04:16,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee136ab8c/1139f6505bfe404881687fc2cbbb5830/FLAGd0b70db0f [2022-01-18 02:04:17,287 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 02:04:17,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-01-18 02:04:17,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee136ab8c/1139f6505bfe404881687fc2cbbb5830/FLAGd0b70db0f [2022-01-18 02:04:17,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee136ab8c/1139f6505bfe404881687fc2cbbb5830 [2022-01-18 02:04:17,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 02:04:17,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 02:04:17,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 02:04:17,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 02:04:17,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 02:04:17,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:17,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1eddfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17, skipping insertion in model container [2022-01-18 02:04:17,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:17,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 02:04:17,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 02:04:17,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-01-18 02:04:17,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:04:17,910 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 02:04:17,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-01-18 02:04:17,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:04:17,948 INFO L208 MainTranslator]: Completed translation [2022-01-18 02:04:17,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17 WrapperNode [2022-01-18 02:04:17,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 02:04:17,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 02:04:17,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 02:04:17,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 02:04:17,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:17,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:17,994 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-01-18 02:04:17,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 02:04:17,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 02:04:17,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 02:04:17,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 02:04:18,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 02:04:18,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 02:04:18,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 02:04:18,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 02:04:18,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (1/1) ... [2022-01-18 02:04:18,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:04:18,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:18,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 02:04:18,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 02:04:18,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 02:04:18,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 02:04:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 02:04:18,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-18 02:04:18,082 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 02:04:18,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 02:04:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 02:04:18,083 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 02:04:18,137 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 02:04:18,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 02:04:18,356 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 02:04:18,428 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 02:04:18,428 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 02:04:18,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:04:18 BoogieIcfgContainer [2022-01-18 02:04:18,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 02:04:18,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 02:04:18,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 02:04:18,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 02:04:18,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 02:04:17" (1/3) ... [2022-01-18 02:04:18,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afe60eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:04:18, skipping insertion in model container [2022-01-18 02:04:18,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:04:17" (2/3) ... [2022-01-18 02:04:18,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afe60eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:04:18, skipping insertion in model container [2022-01-18 02:04:18,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:04:18" (3/3) ... [2022-01-18 02:04:18,436 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-01-18 02:04:18,439 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 02:04:18,439 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 02:04:18,439 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 02:04:18,439 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 02:04:18,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,481 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,481 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,483 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,485 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,486 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,487 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,488 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,489 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,490 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,491 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,492 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,493 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,493 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,493 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,493 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,493 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,493 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,494 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,497 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,497 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,497 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,498 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:04:18,502 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-18 02:04:18,531 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 02:04:18,535 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 02:04:18,536 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 02:04:18,544 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-01-18 02:04:19,470 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 02:04:19,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:19,756 INFO L514 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:19,757 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-01-18 02:04:19,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:19,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694993393] [2022-01-18 02:04:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:19,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:04:20,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694993393] [2022-01-18 02:04:20,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694993393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:04:20,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:04:20,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 02:04:20,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406466211] [2022-01-18 02:04:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:04:20,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 02:04:20,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 02:04:20,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:04:20,099 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:20,476 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-01-18 02:04:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 02:04:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-18 02:04:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:20,849 INFO L225 Difference]: With dead ends: 26140 [2022-01-18 02:04:20,850 INFO L226 Difference]: Without dead ends: 26136 [2022-01-18 02:04:20,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:04:20,855 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:20,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:04:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-01-18 02:04:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-01-18 02:04:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-01-18 02:04:22,157 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-01-18 02:04:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:22,157 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-01-18 02:04:22,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-01-18 02:04:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 02:04:22,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:22,252 INFO L514 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:22,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 02:04:22,252 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-01-18 02:04:22,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:22,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203402239] [2022-01-18 02:04:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:22,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:04:22,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:22,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203402239] [2022-01-18 02:04:22,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203402239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:04:22,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:04:22,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:04:22,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448482279] [2022-01-18 02:04:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:04:22,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:04:22,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:04:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:04:22,560 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:22,940 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-01-18 02:04:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 02:04:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-18 02:04:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:23,288 INFO L225 Difference]: With dead ends: 35136 [2022-01-18 02:04:23,288 INFO L226 Difference]: Without dead ends: 35136 [2022-01-18 02:04:23,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-01-18 02:04:23,293 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:23,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:04:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-01-18 02:04:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-01-18 02:04:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-01-18 02:04:24,405 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-01-18 02:04:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:24,405 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-01-18 02:04:24,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-01-18 02:04:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-18 02:04:24,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:24,487 INFO L514 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, 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, 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, 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, 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, 1] [2022-01-18 02:04:24,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 02:04:24,488 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-01-18 02:04:24,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434985878] [2022-01-18 02:04:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:24,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:04:24,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:24,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434985878] [2022-01-18 02:04:24,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434985878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:04:24,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:04:24,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 02:04:24,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705679690] [2022-01-18 02:04:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:04:24,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:04:24,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:04:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 02:04:24,612 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:25,152 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-01-18 02:04:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:04:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-01-18 02:04:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:25,272 INFO L225 Difference]: With dead ends: 37401 [2022-01-18 02:04:25,272 INFO L226 Difference]: Without dead ends: 28392 [2022-01-18 02:04:25,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 02:04:25,273 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:25,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:04:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-01-18 02:04:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-01-18 02:04:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-01-18 02:04:26,158 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-01-18 02:04:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:26,158 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-01-18 02:04:26,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-01-18 02:04:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-18 02:04:26,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:26,413 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:26,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 02:04:26,413 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-01-18 02:04:26,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:26,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421514233] [2022-01-18 02:04:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:26,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:26,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421514233] [2022-01-18 02:04:26,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421514233] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676817634] [2022-01-18 02:04:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:26,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:26,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:26,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 02:04:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:26,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:04:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:26,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:27,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676817634] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:27,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:04:27,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 02:04:27,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208004051] [2022-01-18 02:04:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:04:27,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:04:27,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:04:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:04:27,113 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:27,392 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-01-18 02:04:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:04:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2022-01-18 02:04:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:27,500 INFO L225 Difference]: With dead ends: 30943 [2022-01-18 02:04:27,500 INFO L226 Difference]: Without dead ends: 30943 [2022-01-18 02:04:27,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:04:27,501 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:27,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:04:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-01-18 02:04:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-01-18 02:04:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-01-18 02:04:28,581 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-01-18 02:04:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:28,582 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-01-18 02:04:28,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-01-18 02:04:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:04:28,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:28,664 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:28,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-18 02:04:28,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:28,866 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-01-18 02:04:28,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:28,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847475148] [2022-01-18 02:04:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:28,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:28,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847475148] [2022-01-18 02:04:28,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847475148] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545120473] [2022-01-18 02:04:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:28,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:28,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:28,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 02:04:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:29,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:04:29,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:29,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:29,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545120473] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:29,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:04:29,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 02:04:29,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227878311] [2022-01-18 02:04:29,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:04:29,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:04:29,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:04:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:04:29,442 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:29,762 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-01-18 02:04:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:04:29,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-01-18 02:04:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:29,904 INFO L225 Difference]: With dead ends: 34267 [2022-01-18 02:04:29,904 INFO L226 Difference]: Without dead ends: 34267 [2022-01-18 02:04:29,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:04:29,905 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:29,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:04:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-01-18 02:04:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-01-18 02:04:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-01-18 02:04:31,231 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-01-18 02:04:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:31,232 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-01-18 02:04:31,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-01-18 02:04:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:04:31,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:31,321 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:31,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 02:04:31,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:31,524 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-01-18 02:04:31,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:31,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148103724] [2022-01-18 02:04:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:31,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:31,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148103724] [2022-01-18 02:04:31,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148103724] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827005709] [2022-01-18 02:04:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:31,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:31,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:31,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 02:04:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:31,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 02:04:31,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:32,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 02:04:32,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:04:32,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:04:32,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:04:32,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-01-18 02:04:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:32,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:32,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 02:04:33,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))) (<= 2147483647 .cse0)))) is different from false [2022-01-18 02:04:33,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< (select .cse2 c_~A~0.offset) .cse1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset)))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))))) is different from false [2022-01-18 02:04:33,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (and (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse3 c_~A~0.offset) .cse4) (<= .cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))))) (<= 2147483647 .cse1))))) is different from false [2022-01-18 02:04:33,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.offset|) .cse1) (<= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 1))))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret16#1.base|) (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))) (+ 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))))) (<= (select (select .cse4 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse5 1)))) (<= 2147483647 .cse5))))) is different from false [2022-01-18 02:04:33,532 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse3 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)) (< (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse1)))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 2)))) (<= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))))) is different from false [2022-01-18 02:04:33,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2)))) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse2 1))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse3))))))) (<= 2147483647 .cse2))))) is different from false [2022-01-18 02:04:33,758 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:04:33,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 124 [2022-01-18 02:04:33,775 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:04:33,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1183 treesize of output 1011 [2022-01-18 02:04:33,807 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:04:33,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 515 treesize of output 471 [2022-01-18 02:04:33,815 INFO L387 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 483 treesize of output 443 [2022-01-18 02:04:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 02:04:34,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827005709] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:34,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:34,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 43 [2022-01-18 02:04:34,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688031191] [2022-01-18 02:04:34,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:34,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-18 02:04:34,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-18 02:04:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1156, Unknown=7, NotChecked=518, Total=1806 [2022-01-18 02:04:34,247 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 43 states, 43 states have (on average 8.837209302325581) internal successors, (380), 43 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:38,822 INFO L93 Difference]: Finished difference Result 231123 states and 997140 transitions. [2022-01-18 02:04:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-18 02:04:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 8.837209302325581) internal successors, (380), 43 states have internal predecessors, (380), 0 states have call successors, (0), 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 143 [2022-01-18 02:04:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:39,913 INFO L225 Difference]: With dead ends: 231123 [2022-01-18 02:04:39,914 INFO L226 Difference]: Without dead ends: 138672 [2022-01-18 02:04:39,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 260 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=850, Invalid=3203, Unknown=7, NotChecked=910, Total=4970 [2022-01-18 02:04:39,915 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1744 mSDsluCounter, 5334 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 5781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3886 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:39,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1744 Valid, 5224 Invalid, 5781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1829 Invalid, 0 Unknown, 3886 Unchecked, 0.8s Time] [2022-01-18 02:04:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138672 states. [2022-01-18 02:04:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138672 to 35408. [2022-01-18 02:04:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35408 states, 35407 states have (on average 4.250402462789844) internal successors, (150494), 35407 states have internal predecessors, (150494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35408 states to 35408 states and 150494 transitions. [2022-01-18 02:04:42,532 INFO L78 Accepts]: Start accepts. Automaton has 35408 states and 150494 transitions. Word has length 143 [2022-01-18 02:04:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:42,533 INFO L470 AbstractCegarLoop]: Abstraction has 35408 states and 150494 transitions. [2022-01-18 02:04:42,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.837209302325581) internal successors, (380), 43 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 35408 states and 150494 transitions. [2022-01-18 02:04:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:04:42,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:42,616 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:42,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-18 02:04:42,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:42,817 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-01-18 02:04:42,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542516400] [2022-01-18 02:04:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:42,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:43,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542516400] [2022-01-18 02:04:43,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542516400] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709396514] [2022-01-18 02:04:43,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:04:43,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:43,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:43,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 02:04:43,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:04:43,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:43,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-18 02:04:43,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:43,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:04:43,183 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:04:43,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 02:04:43,220 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-18 02:04:43,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-01-18 02:04:43,394 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 02:04:43,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 02:04:43,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:04:43,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:04:43,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-01-18 02:04:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:43,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:43,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 02:04:43,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 02:04:44,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2)))))))) is different from false [2022-01-18 02:04:44,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~min~0 .cse1)) (.cse2 (+ .cse3 1))) (and (or .cse0 (<= .cse1 .cse2)) (or (not .cse0) (<= c_~min~0 .cse2))))) (<= 2147483647 .cse3)))) is different from false [2022-01-18 02:04:44,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 247 treesize of output 215 [2022-01-18 02:04:44,143 INFO L387 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 105 treesize of output 97 [2022-01-18 02:04:44,145 INFO L387 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 199 treesize of output 183 [2022-01-18 02:04:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-01-18 02:04:44,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709396514] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:44,544 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:44,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 20] total 35 [2022-01-18 02:04:44,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460053529] [2022-01-18 02:04:44,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:44,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-18 02:04:44,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-18 02:04:44,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=825, Unknown=4, NotChecked=244, Total=1190 [2022-01-18 02:04:44,545 INFO L87 Difference]: Start difference. First operand 35408 states and 150494 transitions. Second operand has 35 states, 35 states have (on average 9.028571428571428) internal successors, (316), 35 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:47,573 INFO L93 Difference]: Finished difference Result 153099 states and 659574 transitions. [2022-01-18 02:04:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 02:04:47,573 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 9.028571428571428) internal successors, (316), 35 states have internal predecessors, (316), 0 states have call successors, (0), 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 143 [2022-01-18 02:04:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:48,151 INFO L225 Difference]: With dead ends: 153099 [2022-01-18 02:04:48,151 INFO L226 Difference]: Without dead ends: 123151 [2022-01-18 02:04:48,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=768, Invalid=2550, Unknown=4, NotChecked=460, Total=3782 [2022-01-18 02:04:48,153 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 1548 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1470 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:48,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 3568 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1363 Invalid, 0 Unknown, 1470 Unchecked, 0.6s Time] [2022-01-18 02:04:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123151 states. [2022-01-18 02:04:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123151 to 34847. [2022-01-18 02:04:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34847 states, 34846 states have (on average 4.2547494690925785) internal successors, (148261), 34846 states have internal predecessors, (148261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34847 states to 34847 states and 148261 transitions. [2022-01-18 02:04:50,322 INFO L78 Accepts]: Start accepts. Automaton has 34847 states and 148261 transitions. Word has length 143 [2022-01-18 02:04:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:50,322 INFO L470 AbstractCegarLoop]: Abstraction has 34847 states and 148261 transitions. [2022-01-18 02:04:50,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.028571428571428) internal successors, (316), 35 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34847 states and 148261 transitions. [2022-01-18 02:04:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:04:50,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:50,399 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:50,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 02:04:50,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:50,600 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-01-18 02:04:50,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:50,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243303610] [2022-01-18 02:04:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:50,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:50,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:50,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243303610] [2022-01-18 02:04:50,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243303610] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:50,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288488068] [2022-01-18 02:04:50,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:04:50,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:50,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:50,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:50,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 02:04:51,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:04:51,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:51,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 02:04:51,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:04:51,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:04:51,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:04:51,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:04:51,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-01-18 02:04:51,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:04:51,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 02:04:51,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 9 [2022-01-18 02:04:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:04:52,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:52,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 02:04:52,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 .cse2) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-01-18 02:04:52,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (not (<= (+ (select .cse0 c_~A~0.offset) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-01-18 02:04:52,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278))))))) is different from false [2022-01-18 02:04:52,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-01-18 02:04:52,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse3 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse1)) (.cse2 (+ .cse3 1))) (and (or .cse0 (<= .cse1 .cse2)) (or (not .cse0) (<= c_~min~0 .cse2))))) (<= 2147483647 .cse3) (not (<= (+ (select .cse4 c_~A~0.offset) 1) v_ArrVal_278))))))) is different from false [2022-01-18 02:04:52,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ .cse0 1)) (.cse4 (< c_~min~0 .cse2))) (and (or (<= .cse2 .cse3) .cse4) (or (<= c_~min~0 .cse3) (not .cse4)))))))))) is different from false [2022-01-18 02:04:52,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 315 treesize of output 279 [2022-01-18 02:04:52,891 INFO L387 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 219 treesize of output 203 [2022-01-18 02:04:52,894 INFO L387 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 60 treesize of output 56 [2022-01-18 02:04:52,898 INFO L387 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 56 treesize of output 54 [2022-01-18 02:04:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 02:04:53,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288488068] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:53,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:53,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 52 [2022-01-18 02:04:53,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426200644] [2022-01-18 02:04:53,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:53,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-18 02:04:53,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-18 02:04:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1822, Unknown=7, NotChecked=644, Total=2652 [2022-01-18 02:04:53,981 INFO L87 Difference]: Start difference. First operand 34847 states and 148261 transitions. Second operand has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:00,701 INFO L93 Difference]: Finished difference Result 276051 states and 1199107 transitions. [2022-01-18 02:05:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 02:05:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 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 143 [2022-01-18 02:05:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:01,647 INFO L225 Difference]: With dead ends: 276051 [2022-01-18 02:05:01,647 INFO L226 Difference]: Without dead ends: 179135 [2022-01-18 02:05:01,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 255 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1558, Invalid=6119, Unknown=7, NotChecked=1246, Total=8930 [2022-01-18 02:05:01,649 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 3108 mSDsluCounter, 7921 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3108 SdHoareTripleChecker+Valid, 7802 SdHoareTripleChecker+Invalid, 8128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5077 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:01,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3108 Valid, 7802 Invalid, 8128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2934 Invalid, 0 Unknown, 5077 Unchecked, 1.3s Time] [2022-01-18 02:05:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179135 states. [2022-01-18 02:05:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179135 to 34267. [2022-01-18 02:05:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.249430922780599) internal successors, (145611), 34266 states have internal predecessors, (145611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 145611 transitions. [2022-01-18 02:05:04,707 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 145611 transitions. Word has length 143 [2022-01-18 02:05:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:04,707 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 145611 transitions. [2022-01-18 02:05:04,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 145611 transitions. [2022-01-18 02:05:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:05:04,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:04,795 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:04,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 02:05:05,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:05,003 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-01-18 02:05:05,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:05,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926140673] [2022-01-18 02:05:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:05,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 02:05:05,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:05,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926140673] [2022-01-18 02:05:05,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926140673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:05:05,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:05:05,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:05:05,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349007132] [2022-01-18 02:05:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:05:05,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:05:05,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:05,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:05:05,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:05:05,135 INFO L87 Difference]: Start difference. First operand 34267 states and 145611 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:06,008 INFO L93 Difference]: Finished difference Result 49672 states and 212772 transitions. [2022-01-18 02:05:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:05:06,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-18 02:05:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:06,132 INFO L225 Difference]: With dead ends: 49672 [2022-01-18 02:05:06,132 INFO L226 Difference]: Without dead ends: 29945 [2022-01-18 02:05:06,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-18 02:05:06,133 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:06,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:05:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29945 states. [2022-01-18 02:05:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29945 to 29945. [2022-01-18 02:05:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29945 states, 29944 states have (on average 4.260786802030457) internal successors, (127585), 29944 states have internal predecessors, (127585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29945 states to 29945 states and 127585 transitions. [2022-01-18 02:05:07,235 INFO L78 Accepts]: Start accepts. Automaton has 29945 states and 127585 transitions. Word has length 143 [2022-01-18 02:05:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:07,236 INFO L470 AbstractCegarLoop]: Abstraction has 29945 states and 127585 transitions. [2022-01-18 02:05:07,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 29945 states and 127585 transitions. [2022-01-18 02:05:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:05:07,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:07,309 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:07,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 02:05:07,309 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-01-18 02:05:07,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:07,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19991600] [2022-01-18 02:05:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:07,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:05:07,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:07,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19991600] [2022-01-18 02:05:07,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19991600] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:07,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68559874] [2022-01-18 02:05:07,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:05:07,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:07,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:07,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 02:05:07,497 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 02:05:07,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:05:07,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 02:05:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:07,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:05:07,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 61 treesize of output 41 [2022-01-18 02:05:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:05:07,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:05:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:05:08,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68559874] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:05:08,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:05:08,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-01-18 02:05:08,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018896098] [2022-01-18 02:05:08,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:05:08,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 02:05:08,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 02:05:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-18 02:05:08,094 INFO L87 Difference]: Start difference. First operand 29945 states and 127585 transitions. Second operand has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:09,620 INFO L93 Difference]: Finished difference Result 148600 states and 639537 transitions. [2022-01-18 02:05:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 02:05:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 0 states have call successors, (0), 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 143 [2022-01-18 02:05:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:09,917 INFO L225 Difference]: With dead ends: 148600 [2022-01-18 02:05:09,917 INFO L226 Difference]: Without dead ends: 68291 [2022-01-18 02:05:09,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2022-01-18 02:05:09,918 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 595 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:09,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 2294 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 498 Invalid, 0 Unknown, 141 Unchecked, 0.2s Time] [2022-01-18 02:05:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68291 states. [2022-01-18 02:05:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68291 to 30451. [2022-01-18 02:05:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30451 states, 30450 states have (on average 4.247192118226601) internal successors, (129327), 30450 states have internal predecessors, (129327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30451 states to 30451 states and 129327 transitions. [2022-01-18 02:05:11,442 INFO L78 Accepts]: Start accepts. Automaton has 30451 states and 129327 transitions. Word has length 143 [2022-01-18 02:05:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:11,442 INFO L470 AbstractCegarLoop]: Abstraction has 30451 states and 129327 transitions. [2022-01-18 02:05:11,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30451 states and 129327 transitions. [2022-01-18 02:05:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:05:11,512 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:11,512 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:11,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 02:05:11,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:11,733 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 6 times [2022-01-18 02:05:11,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148951258] [2022-01-18 02:05:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:11,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:11,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:11,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148951258] [2022-01-18 02:05:11,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148951258] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:11,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165697202] [2022-01-18 02:05:11,905 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:05:11,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:11,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:11,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:11,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-18 02:05:12,003 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 02:05:12,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:05:12,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-18 02:05:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:12,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:05:12,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:05:12,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-01-18 02:05:12,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 9 [2022-01-18 02:05:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:12,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:05:13,220 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_391 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) c_~A~0.base) c_~A~0.offset) c_~max~0))) is different from false [2022-01-18 02:05:13,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 17 [2022-01-18 02:05:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 02:05:13,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165697202] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:05:13,351 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:05:13,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 38 [2022-01-18 02:05:13,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201290099] [2022-01-18 02:05:13,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:05:13,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-18 02:05:13,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-18 02:05:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1182, Unknown=1, NotChecked=70, Total=1406 [2022-01-18 02:05:13,353 INFO L87 Difference]: Start difference. First operand 30451 states and 129327 transitions. Second operand has 38 states, 38 states have (on average 8.18421052631579) internal successors, (311), 38 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:16,766 INFO L93 Difference]: Finished difference Result 188069 states and 810390 transitions. [2022-01-18 02:05:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 02:05:16,766 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.18421052631579) internal successors, (311), 38 states have internal predecessors, (311), 0 states have call successors, (0), 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 143 [2022-01-18 02:05:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:17,676 INFO L225 Difference]: With dead ends: 188069 [2022-01-18 02:05:17,677 INFO L226 Difference]: Without dead ends: 108715 [2022-01-18 02:05:17,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1401, Invalid=5244, Unknown=1, NotChecked=160, Total=6806 [2022-01-18 02:05:17,678 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 2697 mSDsluCounter, 5163 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 5150 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:17,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2697 Valid, 5150 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1761 Invalid, 0 Unknown, 540 Unchecked, 0.8s Time] [2022-01-18 02:05:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108715 states. [2022-01-18 02:05:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108715 to 29549. [2022-01-18 02:05:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29549 states, 29548 states have (on average 4.249221605523217) internal successors, (125556), 29548 states have internal predecessors, (125556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 125556 transitions. [2022-01-18 02:05:19,479 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 125556 transitions. Word has length 143 [2022-01-18 02:05:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:19,479 INFO L470 AbstractCegarLoop]: Abstraction has 29549 states and 125556 transitions. [2022-01-18 02:05:19,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.18421052631579) internal successors, (311), 38 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 125556 transitions. [2022-01-18 02:05:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:05:19,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:19,563 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:19,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 02:05:19,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:19,763 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 7 times [2022-01-18 02:05:19,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:19,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936716921] [2022-01-18 02:05:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:19,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:20,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:20,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936716921] [2022-01-18 02:05:20,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936716921] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:20,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864399732] [2022-01-18 02:05:20,014 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:05:20,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:20,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:20,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:20,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-18 02:05:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:20,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 02:05:20,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:20,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:05:20,242 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:05:20,243 INFO L387 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 11 treesize of output 11 [2022-01-18 02:05:20,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:05:20,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:05:20,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 02:05:20,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 02:05:20,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 9 [2022-01-18 02:05:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:20,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:05:20,963 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_442 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_442) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 02:05:21,016 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_440 Int) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (not (<= v_ArrVal_440 (+ (select .cse0 .cse1) 1))) (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_440)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_442) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 02:05:21,039 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_440 Int) (v_ArrVal_442 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (not (<= v_ArrVal_440 (+ (select .cse0 c_~A~0.offset) 1))) (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_440)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_442) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 02:05:21,060 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 Int) (v_ArrVal_442 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_439))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= v_ArrVal_440 (+ (select .cse0 c_~A~0.offset) 1))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_440)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_442) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))))) is different from false [2022-01-18 02:05:21,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 105 treesize of output 81 [2022-01-18 02:05:21,137 INFO L387 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 54 treesize of output 50 [2022-01-18 02:05:21,140 INFO L387 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 24 treesize of output 22 [2022-01-18 02:05:21,472 INFO L387 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 10 treesize of output 8 [2022-01-18 02:05:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 02:05:21,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864399732] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:05:21,505 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:05:21,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 42 [2022-01-18 02:05:21,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277575007] [2022-01-18 02:05:21,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:05:21,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-18 02:05:21,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:21,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-18 02:05:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1257, Unknown=4, NotChecked=300, Total=1722 [2022-01-18 02:05:21,506 INFO L87 Difference]: Start difference. First operand 29549 states and 125556 transitions. Second operand has 42 states, 42 states have (on average 7.928571428571429) internal successors, (333), 42 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:26,836 INFO L93 Difference]: Finished difference Result 214451 states and 934238 transitions. [2022-01-18 02:05:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 02:05:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.928571428571429) internal successors, (333), 42 states have internal predecessors, (333), 0 states have call successors, (0), 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 143 [2022-01-18 02:05:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:27,410 INFO L225 Difference]: With dead ends: 214451 [2022-01-18 02:05:27,410 INFO L226 Difference]: Without dead ends: 105323 [2022-01-18 02:05:27,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 264 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2372, Invalid=7540, Unknown=4, NotChecked=796, Total=10712 [2022-01-18 02:05:27,412 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 2616 mSDsluCounter, 4897 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2616 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 4305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2383 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:27,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2616 Valid, 4863 Invalid, 4305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1782 Invalid, 0 Unknown, 2383 Unchecked, 0.9s Time] [2022-01-18 02:05:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105323 states. [2022-01-18 02:05:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105323 to 28157. [2022-01-18 02:05:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28157 states, 28156 states have (on average 4.237249609319505) internal successors, (119304), 28156 states have internal predecessors, (119304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28157 states to 28157 states and 119304 transitions. [2022-01-18 02:05:29,141 INFO L78 Accepts]: Start accepts. Automaton has 28157 states and 119304 transitions. Word has length 143 [2022-01-18 02:05:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:29,142 INFO L470 AbstractCegarLoop]: Abstraction has 28157 states and 119304 transitions. [2022-01-18 02:05:29,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.928571428571429) internal successors, (333), 42 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28157 states and 119304 transitions. [2022-01-18 02:05:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:05:29,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:29,209 INFO L514 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:29,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-18 02:05:29,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 02:05:29,423 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 8 times [2022-01-18 02:05:29,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:29,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404220476] [2022-01-18 02:05:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:29,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:05:29,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:29,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404220476] [2022-01-18 02:05:29,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404220476] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:29,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783110085] [2022-01-18 02:05:29,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:05:29,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:29,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:29,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 02:05:29,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:05:29,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:05:29,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-18 02:05:29,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:05:29,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:05:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:05:29,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783110085] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:05:29,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:05:29,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-01-18 02:05:29,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371025381] [2022-01-18 02:05:29,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:05:29,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 02:05:29,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 02:05:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-18 02:05:29,972 INFO L87 Difference]: Start difference. First operand 28157 states and 119304 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:30,254 INFO L93 Difference]: Finished difference Result 38564 states and 164557 transitions. [2022-01-18 02:05:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:05:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 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 143 [2022-01-18 02:05:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:30,333 INFO L225 Difference]: With dead ends: 38564 [2022-01-18 02:05:30,333 INFO L226 Difference]: Without dead ends: 22799 [2022-01-18 02:05:30,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-18 02:05:30,334 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 43 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:30,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 807 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:05:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22799 states. [2022-01-18 02:05:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22799 to 22679. [2022-01-18 02:05:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22679 states, 22678 states have (on average 4.1738248522797425) internal successors, (94654), 22678 states have internal predecessors, (94654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22679 states to 22679 states and 94654 transitions. [2022-01-18 02:05:31,263 INFO L78 Accepts]: Start accepts. Automaton has 22679 states and 94654 transitions. Word has length 143 [2022-01-18 02:05:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:31,263 INFO L470 AbstractCegarLoop]: Abstraction has 22679 states and 94654 transitions. [2022-01-18 02:05:31,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22679 states and 94654 transitions. [2022-01-18 02:05:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 02:05:31,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:31,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:31,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 02:05:31,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 02:05:31,512 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:31,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash 222105859, now seen corresponding path program 9 times [2022-01-18 02:05:31,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:31,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74087954] [2022-01-18 02:05:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:31,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:31,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:31,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74087954] [2022-01-18 02:05:31,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74087954] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:31,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435907582] [2022-01-18 02:05:31,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:05:31,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:31,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:31,589 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:31,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 02:05:31,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-18 02:05:31,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:05:31,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:05:31,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:31,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:05:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:05:32,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435907582] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:05:32,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:05:32,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-01-18 02:05:32,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320987266] [2022-01-18 02:05:32,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:05:32,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-18 02:05:32,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:32,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-18 02:05:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-01-18 02:05:32,147 INFO L87 Difference]: Start difference. First operand 22679 states and 94654 transitions. Second operand has 21 states, 21 states have (on average 12.80952380952381) internal successors, (269), 21 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:33,652 INFO L93 Difference]: Finished difference Result 39938 states and 165608 transitions. [2022-01-18 02:05:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-18 02:05:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.80952380952381) internal successors, (269), 21 states have internal predecessors, (269), 0 states have call successors, (0), 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 148 [2022-01-18 02:05:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:33,793 INFO L225 Difference]: With dead ends: 39938 [2022-01-18 02:05:33,793 INFO L226 Difference]: Without dead ends: 38571 [2022-01-18 02:05:33,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=532, Invalid=2224, Unknown=0, NotChecked=0, Total=2756 [2022-01-18 02:05:33,794 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1071 mSDsluCounter, 3739 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:33,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1071 Valid, 3635 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 02:05:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38571 states. [2022-01-18 02:05:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38571 to 31886. [2022-01-18 02:05:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31886 states, 31885 states have (on average 4.2220793476556375) internal successors, (134621), 31885 states have internal predecessors, (134621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31886 states to 31886 states and 134621 transitions. [2022-01-18 02:05:34,581 INFO L78 Accepts]: Start accepts. Automaton has 31886 states and 134621 transitions. Word has length 148 [2022-01-18 02:05:34,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:34,581 INFO L470 AbstractCegarLoop]: Abstraction has 31886 states and 134621 transitions. [2022-01-18 02:05:34,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.80952380952381) internal successors, (269), 21 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31886 states and 134621 transitions. [2022-01-18 02:05:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 02:05:34,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:34,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1] [2022-01-18 02:05:34,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-18 02:05:35,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 02:05:35,139 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash 995583525, now seen corresponding path program 10 times [2022-01-18 02:05:35,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:35,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880547569] [2022-01-18 02:05:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:35,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 02:05:35,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:35,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880547569] [2022-01-18 02:05:35,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880547569] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:35,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157314562] [2022-01-18 02:05:35,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:05:35,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:35,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:35,246 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:35,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 02:05:35,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:05:35,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:05:35,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 02:05:35,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 02:05:35,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:05:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-18 02:05:35,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157314562] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:05:35,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:05:35,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-01-18 02:05:35,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697532532] [2022-01-18 02:05:35,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:05:35,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 02:05:35,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:05:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 02:05:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-01-18 02:05:35,932 INFO L87 Difference]: Start difference. First operand 31886 states and 134621 transitions. Second operand has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 24 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:05:36,595 INFO L93 Difference]: Finished difference Result 55982 states and 237301 transitions. [2022-01-18 02:05:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 02:05:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 24 states have internal predecessors, (263), 0 states have call successors, (0), 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 160 [2022-01-18 02:05:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:05:36,805 INFO L225 Difference]: With dead ends: 55982 [2022-01-18 02:05:36,805 INFO L226 Difference]: Without dead ends: 55982 [2022-01-18 02:05:36,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 305 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2022-01-18 02:05:36,806 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 903 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 02:05:36,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 1556 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 02:05:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55982 states. [2022-01-18 02:05:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55982 to 46946. [2022-01-18 02:05:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46946 states, 46945 states have (on average 4.2346575780168285) internal successors, (198796), 46945 states have internal predecessors, (198796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46946 states to 46946 states and 198796 transitions. [2022-01-18 02:05:38,260 INFO L78 Accepts]: Start accepts. Automaton has 46946 states and 198796 transitions. Word has length 160 [2022-01-18 02:05:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:05:38,260 INFO L470 AbstractCegarLoop]: Abstraction has 46946 states and 198796 transitions. [2022-01-18 02:05:38,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 24 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:05:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 46946 states and 198796 transitions. [2022-01-18 02:05:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 02:05:38,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:05:38,698 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:05:38,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-18 02:05:38,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-18 02:05:38,914 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:05:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:05:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1193294040, now seen corresponding path program 11 times [2022-01-18 02:05:38,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:05:38,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270253601] [2022-01-18 02:05:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:05:38,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:05:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:05:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-18 02:05:39,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:05:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270253601] [2022-01-18 02:05:39,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270253601] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:05:39,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347058497] [2022-01-18 02:05:39,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:05:39,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:05:39,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:05:39,208 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:05:39,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 02:05:39,319 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-18 02:05:39,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:05:39,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-18 02:05:39,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:05:39,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:05:39,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:05:39,586 INFO L353 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2022-01-18 02:05:39,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 23 [2022-01-18 02:05:39,664 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-18 02:05:39,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-18 02:05:39,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:05:39,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 34 [2022-01-18 02:05:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 02:05:39,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:06:01,495 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_643 Int) (v_ArrVal_641 Int) (v_ArrVal_639 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_48| Int) (v_subst_2 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_639) c_~A~0.base))) (let ((.cse2 (store (store .cse0 c_~A~0.offset v_ArrVal_641) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_48| 4)) v_ArrVal_643))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (not (<= v_ArrVal_641 (+ (select .cse0 c_~A~0.offset) 1))) (< |v_thread3Thread1of1ForFork3_~i~2#1_48| 1) (<= .cse1 (+ c_~max~0 1)) (< (select .cse2 c_~A~0.offset) .cse1))))))) is different from false [2022-01-18 02:06:01,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 172 treesize of output 158 [2022-01-18 02:06:01,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:06:01,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:06:01,810 INFO L387 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 209 treesize of output 207 [2022-01-18 02:06:01,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:06:01,826 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:06:01,826 INFO L387 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 520 treesize of output 480 [2022-01-18 02:06:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2022-01-18 02:06:04,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347058497] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:06:04,349 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:06:04,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 22] total 51 [2022-01-18 02:06:04,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304230213] [2022-01-18 02:06:04,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:06:04,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 02:06:04,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:06:04,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 02:06:04,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2217, Unknown=29, NotChecked=96, Total=2550 [2022-01-18 02:06:04,351 INFO L87 Difference]: Start difference. First operand 46946 states and 198796 transitions. Second operand has 51 states, 51 states have (on average 7.137254901960785) internal successors, (364), 51 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:06:33,708 WARN L228 SmtUtils]: Spent 12.77s on a formula simplification. DAG size of input: 62 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 02:07:05,518 WARN L228 SmtUtils]: Spent 12.47s on a formula simplification. DAG size of input: 60 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 02:07:43,950 WARN L228 SmtUtils]: Spent 9.04s on a formula simplification. DAG size of input: 60 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 02:08:33,606 WARN L228 SmtUtils]: Spent 24.99s on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 02:08:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:08:37,864 INFO L93 Difference]: Finished difference Result 171255 states and 735798 transitions. [2022-01-18 02:08:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-18 02:08:37,864 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 7.137254901960785) internal successors, (364), 51 states have internal predecessors, (364), 0 states have call successors, (0), 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 165 [2022-01-18 02:08:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:08:38,152 INFO L225 Difference]: With dead ends: 171255 [2022-01-18 02:08:38,152 INFO L226 Difference]: Without dead ends: 69699 [2022-01-18 02:08:38,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 173.2s TimeCoverageRelationStatistics Valid=822, Invalid=5868, Unknown=120, NotChecked=162, Total=6972 [2022-01-18 02:08:38,153 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 1141 mSDsluCounter, 7247 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 7029 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1266 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 02:08:38,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 7029 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1613 Invalid, 0 Unknown, 1266 Unchecked, 0.6s Time] [2022-01-18 02:08:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69699 states. [2022-01-18 02:08:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69699 to 51526. [2022-01-18 02:08:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51526 states, 51525 states have (on average 4.219311014070839) internal successors, (217400), 51525 states have internal predecessors, (217400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:08:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51526 states to 51526 states and 217400 transitions. [2022-01-18 02:08:40,340 INFO L78 Accepts]: Start accepts. Automaton has 51526 states and 217400 transitions. Word has length 165 [2022-01-18 02:08:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:08:40,340 INFO L470 AbstractCegarLoop]: Abstraction has 51526 states and 217400 transitions. [2022-01-18 02:08:40,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.137254901960785) internal successors, (364), 51 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:08:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 51526 states and 217400 transitions. [2022-01-18 02:08:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 02:08:40,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:08:40,472 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:08:40,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-18 02:08:40,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-18 02:08:40,673 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:08:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:08:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash -207637650, now seen corresponding path program 12 times [2022-01-18 02:08:40,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:08:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511546477] [2022-01-18 02:08:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:08:40,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:08:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:08:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-18 02:08:40,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:08:40,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511546477] [2022-01-18 02:08:40,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511546477] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:08:40,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218730409] [2022-01-18 02:08:40,977 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:08:40,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:08:40,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:08:40,978 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:08:40,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 02:08:41,095 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-18 02:08:41,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:08:41,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-18 02:08:41,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:08:41,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:08:41,146 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 02:08:41,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 02:08:41,246 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:08:41,246 INFO L387 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 11 treesize of output 11 [2022-01-18 02:08:41,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:08:41,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:08:41,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:08:41,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 36 treesize of output 30 [2022-01-18 02:08:41,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:08:41,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-18 02:08:41,832 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:08:41,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 32 [2022-01-18 02:08:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 02:08:41,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:08:46,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-01-18 02:08:46,425 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-01-18 02:08:46,426 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-18 02:08:46,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-18 02:08:46,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 02:08:46,626 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 47 more [2022-01-18 02:08:46,629 INFO L158 Benchmark]: Toolchain (without parser) took 268905.94ms. Allocated memory was 337.6MB in the beginning and 15.1GB in the end (delta: 14.8GB). Free memory was 288.6MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. [2022-01-18 02:08:46,629 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 337.6MB. Free memory is still 305.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:08:46,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.59ms. Allocated memory is still 337.6MB. Free memory was 288.5MB in the beginning and 310.3MB in the end (delta: -21.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. [2022-01-18 02:08:46,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 337.6MB. Free memory was 310.3MB in the beginning and 308.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:08:46,630 INFO L158 Benchmark]: Boogie Preprocessor took 29.57ms. Allocated memory is still 337.6MB. Free memory was 308.2MB in the beginning and 306.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:08:46,630 INFO L158 Benchmark]: RCFGBuilder took 406.80ms. Allocated memory is still 337.6MB. Free memory was 306.6MB in the beginning and 286.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-18 02:08:46,630 INFO L158 Benchmark]: TraceAbstraction took 268196.72ms. Allocated memory was 337.6MB in the beginning and 15.1GB in the end (delta: 14.8GB). Free memory was 285.6MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. [2022-01-18 02:08:46,631 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.11ms. Allocated memory is still 337.6MB. Free memory is still 305.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 224.59ms. Allocated memory is still 337.6MB. Free memory was 288.5MB in the beginning and 310.3MB in the end (delta: -21.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 337.6MB. Free memory was 310.3MB in the beginning and 308.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.57ms. Allocated memory is still 337.6MB. Free memory was 308.2MB in the beginning and 306.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 406.80ms. Allocated memory is still 337.6MB. Free memory was 306.6MB in the beginning and 286.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 268196.72ms. Allocated memory was 337.6MB in the beginning and 15.1GB in the end (delta: 14.8GB). Free memory was 285.6MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...