/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-Separate.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 12:21:55,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 12:21:55,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 12:21:55,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 12:21:55,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 12:21:55,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 12:21:55,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 12:21:55,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 12:21:55,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 12:21:55,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 12:21:55,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 12:21:55,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 12:21:55,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 12:21:55,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 12:21:55,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 12:21:55,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 12:21:55,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 12:21:55,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 12:21:55,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 12:21:55,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 12:21:55,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 12:21:55,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 12:21:55,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 12:21:55,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 12:21:55,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 12:21:55,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 12:21:55,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 12:21:55,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 12:21:55,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 12:21:55,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 12:21:55,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 12:21:55,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 12:21:55,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 12:21:55,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 12:21:55,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 12:21:55,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 12:21:55,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 12:21:55,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 12:21:55,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 12:21:55,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 12:21:55,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 12:21:55,286 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-Separate.epf [2022-01-18 12:21:55,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 12:21:55,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 12:21:55,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 12:21:55,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 12:21:55,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 12:21:55,316 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 12:21:55,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 12:21:55,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 12:21:55,317 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 12:21:55,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 12:21:55,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 12:21:55,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 12:21:55,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 12:21:55,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 12:21:55,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 12:21:55,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:21:55,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 12:21:55,320 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 12:21:55,320 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 12:21:55,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 12:21:55,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 12:21:55,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 12:21:55,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 12:21:55,555 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 12:21:55,556 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 12:21:55,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8111576/ac2abc7909d44933874f98622d8d8504/FLAG424671026 [2022-01-18 12:21:55,976 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 12:21:55,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-01-18 12:21:55,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8111576/ac2abc7909d44933874f98622d8d8504/FLAG424671026 [2022-01-18 12:21:56,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8111576/ac2abc7909d44933874f98622d8d8504 [2022-01-18 12:21:56,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 12:21:56,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 12:21:56,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 12:21:56,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 12:21:56,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 12:21:56,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c22e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56, skipping insertion in model container [2022-01-18 12:21:56,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 12:21:56,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 12:21:56,592 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 12:21:56,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:21:56,601 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 12:21:56,623 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 12:21:56,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:21:56,637 INFO L208 MainTranslator]: Completed translation [2022-01-18 12:21:56,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56 WrapperNode [2022-01-18 12:21:56,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 12:21:56,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 12:21:56,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 12:21:56,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 12:21:56,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,674 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-01-18 12:21:56,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 12:21:56,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 12:21:56,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 12:21:56,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 12:21:56,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 12:21:56,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 12:21:56,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 12:21:56,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 12:21:56,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (1/1) ... [2022-01-18 12:21:56,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:21:56,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:21:56,743 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 12:21:56,751 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 12:21:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 12:21:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 12:21:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 12:21:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 12:21:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-18 12:21:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 12:21:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 12:21:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 12:21:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 12:21:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 12:21:56,779 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 12:21:56,850 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 12:21:56,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 12:21:57,150 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 12:21:57,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 12:21:57,226 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 12:21:57,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:21:57 BoogieIcfgContainer [2022-01-18 12:21:57,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 12:21:57,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 12:21:57,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 12:21:57,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 12:21:57,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 12:21:56" (1/3) ... [2022-01-18 12:21:57,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4784cf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:21:57, skipping insertion in model container [2022-01-18 12:21:57,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:56" (2/3) ... [2022-01-18 12:21:57,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4784cf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:21:57, skipping insertion in model container [2022-01-18 12:21:57,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:21:57" (3/3) ... [2022-01-18 12:21:57,241 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-01-18 12:21:57,244 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 12:21:57,244 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 12:21:57,244 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 12:21:57,244 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 12:21:57,303 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,304 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,304 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,304 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,307 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,308 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,309 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,310 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,312 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,314 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 12:21:57,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,314 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 12:21:57,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,314 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 12:21:57,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 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 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,315 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,316 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,319 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,319 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,320 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,320 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,321 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 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 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,322 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 12:21:57,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:21:57,325 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-18 12:21:57,354 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 12:21:57,358 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 12:21:57,359 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 12:21:57,370 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-01-18 12:21:58,428 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 12:21:58,479 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 12:21:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 12:21:58,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:21:58,749 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 12:21:58,750 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 12:21:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:21:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-01-18 12:21:58,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:21:58,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903370301] [2022-01-18 12:21:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:21:58,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:21:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:21:58,997 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 12:21:58,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:21:58,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903370301] [2022-01-18 12:21:58,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903370301] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:21:58,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:21:58,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 12:21:59,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506906874] [2022-01-18 12:21:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:21:59,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 12:21:59,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:21:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 12:21:59,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 12:21:59,063 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 12:21:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:21:59,432 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-01-18 12:21:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 12:21:59,449 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 12:21:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:21:59,741 INFO L225 Difference]: With dead ends: 26140 [2022-01-18 12:21:59,742 INFO L226 Difference]: Without dead ends: 26136 [2022-01-18 12:21:59,743 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 12:21:59,745 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 12:21:59,745 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 12:21:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-01-18 12:22:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-01-18 12:22:00,834 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 12:22:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-01-18 12:22:01,156 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-01-18 12:22:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:01,156 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-01-18 12:22:01,156 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 12:22:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-01-18 12:22:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 12:22:01,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:01,288 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 12:22:01,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 12:22:01,289 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 12:22:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-01-18 12:22:01,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876697333] [2022-01-18 12:22:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:01,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:01,457 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 12:22:01,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876697333] [2022-01-18 12:22:01,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876697333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:01,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:01,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 12:22:01,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514854355] [2022-01-18 12:22:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:01,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 12:22:01,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 12:22:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-18 12:22:01,460 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 12:22:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:02,140 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-01-18 12:22:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 12:22:02,141 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 12:22:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:02,376 INFO L225 Difference]: With dead ends: 35136 [2022-01-18 12:22:02,376 INFO L226 Difference]: Without dead ends: 35136 [2022-01-18 12:22:02,377 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 12:22:02,377 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.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:02,378 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.1s Time] [2022-01-18 12:22:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-01-18 12:22:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-01-18 12:22:03,276 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 12:22:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-01-18 12:22:03,566 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-01-18 12:22:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:03,600 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-01-18 12:22:03,600 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 12:22:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-01-18 12:22:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-18 12:22:03,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:03,708 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 12:22:03,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 12:22:03,708 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 12:22:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-01-18 12:22:03,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:03,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345608587] [2022-01-18 12:22:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:03,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:03,883 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 12:22:03,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345608587] [2022-01-18 12:22:03,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345608587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:03,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:03,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 12:22:03,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77502709] [2022-01-18 12:22:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:03,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:22:03,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:22:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 12:22:03,885 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 12:22:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:04,191 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-01-18 12:22:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 12:22:04,192 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 12:22:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:04,516 INFO L225 Difference]: With dead ends: 37401 [2022-01-18 12:22:04,516 INFO L226 Difference]: Without dead ends: 28392 [2022-01-18 12:22:04,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 12:22:04,522 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 12:22:04,523 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 12:22:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-01-18 12:22:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-01-18 12:22:05,293 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 12:22:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-01-18 12:22:05,413 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-01-18 12:22:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:05,413 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-01-18 12:22:05,413 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 12:22:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-01-18 12:22:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-18 12:22:05,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:05,481 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 12:22:05,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 12:22:05,482 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 12:22:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-01-18 12:22:05,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:05,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910115035] [2022-01-18 12:22:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:05,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:05,595 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 12:22:05,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:05,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910115035] [2022-01-18 12:22:05,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910115035] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:05,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111216029] [2022-01-18 12:22:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:05,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:05,598 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 12:22:05,599 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 12:22:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:05,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:05,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:06,004 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 12:22:06,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:06,317 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 12:22:06,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111216029] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:06,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:22:06,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 12:22:06,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744433860] [2022-01-18 12:22:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:06,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:22:06,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:06,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:22:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:22:06,319 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 12:22:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:06,687 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-01-18 12:22:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:22:06,687 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 12:22:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:07,177 INFO L225 Difference]: With dead ends: 30943 [2022-01-18 12:22:07,177 INFO L226 Difference]: Without dead ends: 30943 [2022-01-18 12:22:07,178 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 12:22:07,178 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 12:22:07,179 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 12:22:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-01-18 12:22:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-01-18 12:22:07,809 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 12:22:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-01-18 12:22:08,247 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-01-18 12:22:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:08,247 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-01-18 12:22:08,247 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 12:22:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-01-18 12:22:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 12:22:08,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:08,314 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 12:22:08,331 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 12:22:08,521 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 12:22:08,521 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 12:22:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-01-18 12:22:08,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510107095] [2022-01-18 12:22:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:08,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:08,654 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 12:22:08,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:08,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510107095] [2022-01-18 12:22:08,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510107095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:08,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643402985] [2022-01-18 12:22:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:08,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:08,658 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 12:22:08,671 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 12:22:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:08,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:08,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:08,970 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 12:22:08,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:09,224 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 12:22:09,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643402985] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:09,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:22:09,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 12:22:09,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006990153] [2022-01-18 12:22:09,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:09,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:22:09,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:22:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:22:09,225 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 12:22:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:09,471 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-01-18 12:22:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:22:09,471 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 12:22:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:09,582 INFO L225 Difference]: With dead ends: 34267 [2022-01-18 12:22:09,582 INFO L226 Difference]: Without dead ends: 34267 [2022-01-18 12:22:09,582 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 12:22:09,583 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 12:22:09,583 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 12:22:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-01-18 12:22:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-01-18 12:22:10,430 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 12:22:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-01-18 12:22:10,858 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-01-18 12:22:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:10,859 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-01-18 12:22:10,859 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 12:22:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-01-18 12:22:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:22:10,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:10,949 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 12:22:10,968 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 12:22:11,165 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 12:22:11,165 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 12:22:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-01-18 12:22:11,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:11,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656623962] [2022-01-18 12:22:11,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:11,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:11,694 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 12:22:11,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656623962] [2022-01-18 12:22:11,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656623962] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051832444] [2022-01-18 12:22:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:11,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:11,696 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 12:22:11,727 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 12:22:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:11,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 12:22:11,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:12,104 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 12:22:12,229 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 12:22:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:12,631 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 12:22:12,673 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 12:22:12,914 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 12:22:12,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:13,225 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 12:22:13,357 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 12:22:13,579 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 12:22:13,694 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 12:22:13,897 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 12:22:13,992 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 12:22:14,032 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 12:22:14,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:14,259 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 12:22:14,280 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:14,280 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 12:22:14,321 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:14,321 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 12:22:14,337 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 12:22:14,847 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 12:22:14,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051832444] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:14,847 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:14,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 43 [2022-01-18 12:22:14,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15187] [2022-01-18 12:22:14,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:14,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-18 12:22:14,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-18 12:22:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1156, Unknown=7, NotChecked=518, Total=1806 [2022-01-18 12:22:14,849 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 12:22:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:19,739 INFO L93 Difference]: Finished difference Result 231123 states and 997140 transitions. [2022-01-18 12:22:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-18 12:22:19,740 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 12:22:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:21,147 INFO L225 Difference]: With dead ends: 231123 [2022-01-18 12:22:21,147 INFO L226 Difference]: Without dead ends: 138672 [2022-01-18 12:22:21,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 260 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=850, Invalid=3203, Unknown=7, NotChecked=910, Total=4970 [2022-01-18 12:22:21,167 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1744 mSDsluCounter, 5334 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:21,167 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.9s Time] [2022-01-18 12:22:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138672 states. [2022-01-18 12:22:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138672 to 35408. [2022-01-18 12:22:23,277 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 12:22:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35408 states to 35408 states and 150494 transitions. [2022-01-18 12:22:23,393 INFO L78 Accepts]: Start accepts. Automaton has 35408 states and 150494 transitions. Word has length 143 [2022-01-18 12:22:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:23,394 INFO L470 AbstractCegarLoop]: Abstraction has 35408 states and 150494 transitions. [2022-01-18 12:22:23,394 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 12:22:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 35408 states and 150494 transitions. [2022-01-18 12:22:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:22:23,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:23,467 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 12:22:23,484 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 12:22:23,684 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 12:22:23,684 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 12:22:23,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-01-18 12:22:23,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:23,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529928357] [2022-01-18 12:22:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:23,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:23,957 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 12:22:23,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529928357] [2022-01-18 12:22:23,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529928357] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81552637] [2022-01-18 12:22:23,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:22:23,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:23,958 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 12:22:23,960 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 12:22:24,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:22:24,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:24,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-18 12:22:24,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:24,081 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 12:22:24,100 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:22:24,100 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 12:22:24,141 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-18 12:22:24,141 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 12:22:24,319 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:22:24,319 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 12:22:24,866 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 12:22:24,935 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 12:22:24,952 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 12:22:25,066 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 12:22:25,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:25,265 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 12:22:25,297 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 12:22:25,387 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 12:22:25,428 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 12:22:25,452 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 12:22:25,457 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 12:22:25,459 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 12:22:25,829 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 12:22:25,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81552637] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:25,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:25,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 20] total 35 [2022-01-18 12:22:25,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600667565] [2022-01-18 12:22:25,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:25,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-18 12:22:25,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-18 12:22:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=825, Unknown=4, NotChecked=244, Total=1190 [2022-01-18 12:22:25,831 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 12:22:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:28,281 INFO L93 Difference]: Finished difference Result 153099 states and 659574 transitions. [2022-01-18 12:22:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 12:22:28,281 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 12:22:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:29,332 INFO L225 Difference]: With dead ends: 153099 [2022-01-18 12:22:29,332 INFO L226 Difference]: Without dead ends: 123151 [2022-01-18 12:22:29,333 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 12:22:29,334 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 12:22:29,335 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 12:22:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123151 states. [2022-01-18 12:22:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123151 to 34847. [2022-01-18 12:22:31,512 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 12:22:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34847 states to 34847 states and 148261 transitions. [2022-01-18 12:22:31,641 INFO L78 Accepts]: Start accepts. Automaton has 34847 states and 148261 transitions. Word has length 143 [2022-01-18 12:22:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:31,642 INFO L470 AbstractCegarLoop]: Abstraction has 34847 states and 148261 transitions. [2022-01-18 12:22:31,642 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 12:22:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 34847 states and 148261 transitions. [2022-01-18 12:22:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:22:31,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:31,725 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 12:22:31,751 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 12:22:31,939 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 12:22:31,940 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 12:22:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-01-18 12:22:31,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:31,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996831471] [2022-01-18 12:22:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:31,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:32,299 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 12:22:32,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996831471] [2022-01-18 12:22:32,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996831471] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264457453] [2022-01-18 12:22:32,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:22:32,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:32,309 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 12:22:32,310 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 12:22:32,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:22:32,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:32,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-18 12:22:32,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:33,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:33,191 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 12:22:33,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:33,255 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 12:22:33,329 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 12:22:33,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:33,716 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 12:22:33,751 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 12:22:33,818 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 12:22:33,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:33,937 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 12:22:34,000 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 12:22:34,030 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 12:22:34,053 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 12:22:34,119 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 12:22:34,332 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 12:22:34,446 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 12:22:34,508 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 12:22:34,512 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 12:22:34,516 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 12:22:34,519 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 12:22:35,426 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 12:22:35,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264457453] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:35,427 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:35,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 52 [2022-01-18 12:22:35,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538287940] [2022-01-18 12:22:35,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:35,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-18 12:22:35,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:35,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-18 12:22:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1822, Unknown=7, NotChecked=644, Total=2652 [2022-01-18 12:22:35,428 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 12:22:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:41,603 INFO L93 Difference]: Finished difference Result 276051 states and 1199107 transitions. [2022-01-18 12:22:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 12:22:41,604 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 12:22:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:42,848 INFO L225 Difference]: With dead ends: 276051 [2022-01-18 12:22:42,848 INFO L226 Difference]: Without dead ends: 179135 [2022-01-18 12:22:42,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 255 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1558, Invalid=6119, Unknown=7, NotChecked=1246, Total=8930 [2022-01-18 12:22:42,850 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 3108 mSDsluCounter, 7921 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:42,851 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.4s Time] [2022-01-18 12:22:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179135 states. [2022-01-18 12:22:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179135 to 34267. [2022-01-18 12:22:45,638 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 12:22:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 145611 transitions. [2022-01-18 12:22:45,751 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 145611 transitions. Word has length 143 [2022-01-18 12:22:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:45,751 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 145611 transitions. [2022-01-18 12:22:45,751 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 12:22:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 145611 transitions. [2022-01-18 12:22:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:22:45,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:45,824 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 12:22:45,844 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 12:22:46,029 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 12:22:46,029 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 12:22:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-01-18 12:22:46,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:46,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565287040] [2022-01-18 12:22:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:46,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:46,167 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 12:22:46,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565287040] [2022-01-18 12:22:46,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565287040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:46,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:46,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 12:22:46,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841074723] [2022-01-18 12:22:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:46,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 12:22:46,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 12:22:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 12:22:46,168 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 12:22:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:47,028 INFO L93 Difference]: Finished difference Result 49672 states and 212772 transitions. [2022-01-18 12:22:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:22:47,029 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 12:22:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:47,144 INFO L225 Difference]: With dead ends: 49672 [2022-01-18 12:22:47,144 INFO L226 Difference]: Without dead ends: 29945 [2022-01-18 12:22:47,144 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 12:22:47,146 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 12:22:47,146 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 12:22:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29945 states. [2022-01-18 12:22:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29945 to 29945. [2022-01-18 12:22:47,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 12:22:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29945 states to 29945 states and 127585 transitions. [2022-01-18 12:22:48,246 INFO L78 Accepts]: Start accepts. Automaton has 29945 states and 127585 transitions. Word has length 143 [2022-01-18 12:22:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:48,247 INFO L470 AbstractCegarLoop]: Abstraction has 29945 states and 127585 transitions. [2022-01-18 12:22:48,247 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 12:22:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29945 states and 127585 transitions. [2022-01-18 12:22:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:22:48,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:48,325 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 12:22:48,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 12:22:48,325 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 12:22:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-01-18 12:22:48,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:48,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503434894] [2022-01-18 12:22:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:48,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:48,431 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 12:22:48,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:48,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503434894] [2022-01-18 12:22:48,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503434894] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:48,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235312875] [2022-01-18 12:22:48,431 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:22:48,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:48,437 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 12:22:48,441 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 12:22:48,535 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 12:22:48,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:48,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 12:22:48,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:48,674 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:48,675 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 12:22:48,794 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 12:22:48,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:49,158 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 12:22:49,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235312875] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:49,158 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:49,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-01-18 12:22:49,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517376031] [2022-01-18 12:22:49,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:49,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 12:22:49,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:49,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 12:22:49,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-18 12:22:49,159 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 12:22:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:50,640 INFO L93 Difference]: Finished difference Result 148600 states and 639537 transitions. [2022-01-18 12:22:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 12:22:50,641 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 12:22:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:50,986 INFO L225 Difference]: With dead ends: 148600 [2022-01-18 12:22:50,986 INFO L226 Difference]: Without dead ends: 68291 [2022-01-18 12:22:50,986 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 12:22:50,987 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 12:22:50,987 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 12:22:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68291 states. [2022-01-18 12:22:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68291 to 30451. [2022-01-18 12:22:52,404 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 12:22:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30451 states to 30451 states and 129327 transitions. [2022-01-18 12:22:52,516 INFO L78 Accepts]: Start accepts. Automaton has 30451 states and 129327 transitions. Word has length 143 [2022-01-18 12:22:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:52,516 INFO L470 AbstractCegarLoop]: Abstraction has 30451 states and 129327 transitions. [2022-01-18 12:22:52,517 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 12:22:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 30451 states and 129327 transitions. [2022-01-18 12:22:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:22:52,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:52,588 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 12:22:52,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-18 12:22:52,794 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 12:22:52,795 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 12:22:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 6 times [2022-01-18 12:22:52,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:52,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991721071] [2022-01-18 12:22:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:52,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:53,023 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 12:22:53,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991721071] [2022-01-18 12:22:53,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991721071] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827311775] [2022-01-18 12:22:53,023 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:22:53,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:53,036 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 12:22:53,038 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 12:22:53,150 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 12:22:53,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:53,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-18 12:22:53,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:53,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:53,439 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 12:22:53,491 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 12:22:53,576 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 12:22:53,649 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 12:22:53,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:54,358 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 12:22:54,387 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 12:22:54,476 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 12:22:54,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827311775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:54,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:54,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 38 [2022-01-18 12:22:54,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580706731] [2022-01-18 12:22:54,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:54,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-18 12:22:54,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-18 12:22:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1182, Unknown=1, NotChecked=70, Total=1406 [2022-01-18 12:22:54,479 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 12:22:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:58,002 INFO L93 Difference]: Finished difference Result 188069 states and 810390 transitions. [2022-01-18 12:22:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 12:22:58,002 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 12:22:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:59,044 INFO L225 Difference]: With dead ends: 188069 [2022-01-18 12:22:59,044 INFO L226 Difference]: Without dead ends: 108715 [2022-01-18 12:22:59,045 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 12:22:59,045 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 12:22:59,047 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 12:22:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108715 states. [2022-01-18 12:23:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108715 to 29549. [2022-01-18 12:23:00,639 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 12:23:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 125556 transitions. [2022-01-18 12:23:00,749 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 125556 transitions. Word has length 143 [2022-01-18 12:23:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:23:00,750 INFO L470 AbstractCegarLoop]: Abstraction has 29549 states and 125556 transitions. [2022-01-18 12:23:00,750 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 12:23:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 125556 transitions. [2022-01-18 12:23:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:23:00,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:23:00,828 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 12:23:00,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-18 12:23:01,049 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 12:23:01,050 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 12:23:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:23:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 7 times [2022-01-18 12:23:01,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:23:01,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945638431] [2022-01-18 12:23:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:23:01,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:23:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:01,315 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 12:23:01,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:23:01,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945638431] [2022-01-18 12:23:01,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945638431] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:23:01,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321473704] [2022-01-18 12:23:01,315 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:23:01,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:23:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:23:01,324 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 12:23:01,326 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 12:23:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:01,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 12:23:01,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:01,452 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 12:23:01,580 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:23:01,580 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 12:23:01,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:23:01,859 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 12:23:01,923 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 12:23:01,973 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 12:23:02,033 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 12:23:02,080 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 12:23:02,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:02,318 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 12:23:02,381 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 12:23:02,395 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 12:23:02,422 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 12:23:02,480 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 12:23:02,483 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 12:23:02,485 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 12:23:02,794 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 12:23:02,826 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 12:23:02,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321473704] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:02,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:02,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 42 [2022-01-18 12:23:02,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596987177] [2022-01-18 12:23:02,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:02,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-18 12:23:02,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:02,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-18 12:23:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1257, Unknown=4, NotChecked=300, Total=1722 [2022-01-18 12:23:02,829 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 12:23:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:23:07,882 INFO L93 Difference]: Finished difference Result 214451 states and 934238 transitions. [2022-01-18 12:23:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-18 12:23:07,883 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 12:23:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:23:08,810 INFO L225 Difference]: With dead ends: 214451 [2022-01-18 12:23:08,810 INFO L226 Difference]: Without dead ends: 105323 [2022-01-18 12:23:08,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 264 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2372, Invalid=7540, Unknown=4, NotChecked=796, Total=10712 [2022-01-18 12:23:08,813 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 2616 mSDsluCounter, 4897 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:23:08,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2616 Valid, 4863 Invalid, 4305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1782 Invalid, 0 Unknown, 2383 Unchecked, 1.1s Time] [2022-01-18 12:23:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105323 states. [2022-01-18 12:23:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105323 to 28157. [2022-01-18 12:23:10,294 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 12:23:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28157 states to 28157 states and 119304 transitions. [2022-01-18 12:23:10,385 INFO L78 Accepts]: Start accepts. Automaton has 28157 states and 119304 transitions. Word has length 143 [2022-01-18 12:23:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:23:10,386 INFO L470 AbstractCegarLoop]: Abstraction has 28157 states and 119304 transitions. [2022-01-18 12:23:10,407 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 12:23:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28157 states and 119304 transitions. [2022-01-18 12:23:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:23:10,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:23:10,466 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 12:23:10,482 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 12:23:10,679 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 12:23:10,679 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 12:23:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:23:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 8 times [2022-01-18 12:23:10,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:23:10,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474243150] [2022-01-18 12:23:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:23:10,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:23:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:10,743 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 12:23:10,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:23:10,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474243150] [2022-01-18 12:23:10,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474243150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:23:10,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926922967] [2022-01-18 12:23:10,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:23:10,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:23:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:23:10,744 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 12:23:10,745 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 12:23:10,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:23:10,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:23:10,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-18 12:23:10,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:11,043 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 12:23:11,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:11,259 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 12:23:11,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926922967] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:11,259 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:11,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-01-18 12:23:11,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024886808] [2022-01-18 12:23:11,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:11,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 12:23:11,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 12:23:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-18 12:23:11,260 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 12:23:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:23:11,551 INFO L93 Difference]: Finished difference Result 38564 states and 164557 transitions. [2022-01-18 12:23:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:23:11,551 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 12:23:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:23:11,630 INFO L225 Difference]: With dead ends: 38564 [2022-01-18 12:23:11,630 INFO L226 Difference]: Without dead ends: 22799 [2022-01-18 12:23:11,631 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 12:23:11,631 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.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:23:11,632 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.0s Time] [2022-01-18 12:23:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22799 states. [2022-01-18 12:23:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22799 to 22679. [2022-01-18 12:23:12,358 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 12:23:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22679 states to 22679 states and 94654 transitions. [2022-01-18 12:23:12,439 INFO L78 Accepts]: Start accepts. Automaton has 22679 states and 94654 transitions. Word has length 143 [2022-01-18 12:23:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:23:12,439 INFO L470 AbstractCegarLoop]: Abstraction has 22679 states and 94654 transitions. [2022-01-18 12:23:12,439 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 12:23:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22679 states and 94654 transitions. [2022-01-18 12:23:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 12:23:12,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:23:12,484 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 12:23:12,500 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 12:23:12,697 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 12:23:12,697 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 12:23:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:23:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 222105859, now seen corresponding path program 9 times [2022-01-18 12:23:12,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:23:12,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322248525] [2022-01-18 12:23:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:23:12,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:23:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:12,772 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 12:23:12,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:23:12,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322248525] [2022-01-18 12:23:12,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322248525] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:23:12,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61069872] [2022-01-18 12:23:12,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:23:12,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:23:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:23:12,778 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 12:23:12,779 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 12:23:12,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-18 12:23:12,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:23:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 12:23:12,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:13,144 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 12:23:13,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:13,291 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 12:23:13,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61069872] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:13,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:13,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-01-18 12:23:13,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110842671] [2022-01-18 12:23:13,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:13,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-18 12:23:13,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-18 12:23:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-01-18 12:23:13,293 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 12:23:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:23:14,344 INFO L93 Difference]: Finished difference Result 39938 states and 165608 transitions. [2022-01-18 12:23:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-18 12:23:14,344 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 12:23:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:23:14,462 INFO L225 Difference]: With dead ends: 39938 [2022-01-18 12:23:14,462 INFO L226 Difference]: Without dead ends: 38571 [2022-01-18 12:23:14,463 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 12:23:14,463 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 12:23:14,463 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 12:23:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38571 states. [2022-01-18 12:23:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38571 to 31886. [2022-01-18 12:23:15,299 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 12:23:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31886 states to 31886 states and 134621 transitions. [2022-01-18 12:23:15,401 INFO L78 Accepts]: Start accepts. Automaton has 31886 states and 134621 transitions. Word has length 148 [2022-01-18 12:23:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:23:15,401 INFO L470 AbstractCegarLoop]: Abstraction has 31886 states and 134621 transitions. [2022-01-18 12:23:15,401 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 12:23:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 31886 states and 134621 transitions. [2022-01-18 12:23:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 12:23:15,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:23:15,465 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 12:23:15,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 12:23:15,675 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 12:23:15,676 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 12:23:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:23:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash 995583525, now seen corresponding path program 10 times [2022-01-18 12:23:15,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:23:15,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189527621] [2022-01-18 12:23:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:23:15,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:23:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:15,796 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 12:23:15,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:23:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189527621] [2022-01-18 12:23:15,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189527621] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:23:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996842097] [2022-01-18 12:23:15,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:23:15,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:23:15,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:23:15,798 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 12:23:15,799 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 12:23:15,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:23:15,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:23:15,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 12:23:15,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:16,242 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 12:23:16,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:16,573 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 12:23:16,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996842097] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:16,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:16,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-01-18 12:23:16,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824191841] [2022-01-18 12:23:16,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:16,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 12:23:16,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 12:23:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-01-18 12:23:16,574 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 12:23:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:23:17,549 INFO L93 Difference]: Finished difference Result 55982 states and 237301 transitions. [2022-01-18 12:23:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 12:23:17,549 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 12:23:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:23:17,736 INFO L225 Difference]: With dead ends: 55982 [2022-01-18 12:23:17,736 INFO L226 Difference]: Without dead ends: 55982 [2022-01-18 12:23:17,738 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 12:23:17,738 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 903 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:23:17,739 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.5s Time] [2022-01-18 12:23:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55982 states. [2022-01-18 12:23:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55982 to 46946. [2022-01-18 12:23:18,871 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 12:23:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46946 states to 46946 states and 198796 transitions. [2022-01-18 12:23:19,026 INFO L78 Accepts]: Start accepts. Automaton has 46946 states and 198796 transitions. Word has length 160 [2022-01-18 12:23:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:23:19,027 INFO L470 AbstractCegarLoop]: Abstraction has 46946 states and 198796 transitions. [2022-01-18 12:23:19,027 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 12:23:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 46946 states and 198796 transitions. [2022-01-18 12:23:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 12:23:19,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:23:19,122 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 12:23:19,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 12:23:19,338 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 12:23:19,338 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 12:23:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:23:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1193294040, now seen corresponding path program 11 times [2022-01-18 12:23:19,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:23:19,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16396185] [2022-01-18 12:23:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:23:19,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:23:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:19,631 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 12:23:19,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:23:19,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16396185] [2022-01-18 12:23:19,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16396185] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:23:19,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175544264] [2022-01-18 12:23:19,632 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:23:19,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:23:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:23:19,648 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 12:23:19,694 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 12:23:19,789 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-18 12:23:19,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:23:19,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-18 12:23:19,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:20,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:23:20,012 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 12:23:20,063 INFO L353 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2022-01-18 12:23:20,063 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 12:23:20,132 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-18 12:23:20,133 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 12:23:20,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:20,531 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 12:23:20,657 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 12:23:20,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:44,718 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 12:23:44,957 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 12:23:44,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:23:44,967 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:44,967 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 12:23:44,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:23:44,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:44,977 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 12:23:47,254 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 12:23:47,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175544264] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:47,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:47,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 22] total 51 [2022-01-18 12:23:47,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012093833] [2022-01-18 12:23:47,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:47,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 12:23:47,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:47,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 12:23:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2217, Unknown=29, NotChecked=96, Total=2550 [2022-01-18 12:23:47,257 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 12:24:14,955 WARN L228 SmtUtils]: Spent 14.40s 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 12:24:47,798 WARN L228 SmtUtils]: Spent 14.59s 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 12:25:13,907 WARN L228 SmtUtils]: Spent 8.03s 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 12:25:56,414 WARN L228 SmtUtils]: Spent 27.72s 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 12:26:12,021 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 12:26:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 12:26:12,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 310 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 161.0s TimeCoverageRelationStatistics Valid=642, Invalid=4367, Unknown=107, NotChecked=140, Total=5256 [2022-01-18 12:26:12,023 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 749 mSDsluCounter, 3832 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 685 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:26:12,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 3831 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 780 Invalid, 0 Unknown, 685 Unchecked, 0.3s Time] [2022-01-18 12:26:12,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-01-18 12:26:12,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 12:26:12,223 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 12:26:12,224 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:934) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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) ... 49 more [2022-01-18 12:26:12,226 INFO L158 Benchmark]: Toolchain (without parser) took 255836.29ms. Allocated memory was 358.6MB in the beginning and 15.2GB in the end (delta: 14.8GB). Free memory was 304.0MB in the beginning and 9.0GB in the end (delta: -8.7GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2022-01-18 12:26:12,226 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory is still 321.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 12:26:12,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.78ms. Allocated memory is still 358.6MB. Free memory was 303.8MB in the beginning and 329.5MB in the end (delta: -25.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.0GB. [2022-01-18 12:26:12,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.02ms. Allocated memory is still 358.6MB. Free memory was 329.5MB in the beginning and 326.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 12:26:12,227 INFO L158 Benchmark]: Boogie Preprocessor took 19.05ms. Allocated memory is still 358.6MB. Free memory was 326.7MB in the beginning and 325.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 12:26:12,227 INFO L158 Benchmark]: RCFGBuilder took 532.93ms. Allocated memory is still 358.6MB. Free memory was 325.6MB in the beginning and 303.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2022-01-18 12:26:12,227 INFO L158 Benchmark]: TraceAbstraction took 254997.51ms. Allocated memory was 358.6MB in the beginning and 15.2GB in the end (delta: 14.8GB). Free memory was 303.6MB in the beginning and 9.0GB in the end (delta: -8.7GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2022-01-18 12:26:12,228 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.13ms. Allocated memory is still 358.6MB. Free memory is still 321.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 246.78ms. Allocated memory is still 358.6MB. Free memory was 303.8MB in the beginning and 329.5MB in the end (delta: -25.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.02ms. Allocated memory is still 358.6MB. Free memory was 329.5MB in the beginning and 326.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.05ms. Allocated memory is still 358.6MB. Free memory was 326.7MB in the beginning and 325.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 532.93ms. Allocated memory is still 358.6MB. Free memory was 325.6MB in the beginning and 303.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 254997.51ms. Allocated memory was 358.6MB in the beginning and 15.2GB in the end (delta: 14.8GB). Free memory was 303.6MB in the beginning and 9.0GB in the end (delta: -8.7GB). Peak memory consumption was 6.2GB. 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...