/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-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 12:29:24,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 12:29:24,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 12:29:24,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 12:29:24,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 12:29:24,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 12:29:24,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 12:29:24,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 12:29:24,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 12:29:24,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 12:29:24,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 12:29:24,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 12:29:24,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 12:29:24,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 12:29:24,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 12:29:24,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 12:29:24,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 12:29:24,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 12:29:24,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 12:29:24,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 12:29:24,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 12:29:24,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 12:29:24,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 12:29:24,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 12:29:24,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 12:29:24,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 12:29:24,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 12:29:24,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 12:29:24,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 12:29:24,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 12:29:24,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 12:29:24,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 12:29:24,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 12:29:24,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 12:29:24,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 12:29:24,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 12:29:24,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 12:29:24,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 12:29:24,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 12:29:24,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 12:29:24,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 12:29:24,259 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:29:24,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 12:29:24,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 12:29:24,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 12:29:24,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 12:29:24,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 12:29:24,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 12:29:24,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 12:29:24,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 12:29:24,288 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 12:29:24,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 12:29:24,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 12:29:24,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 12:29:24,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 12:29:24,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 12:29:24,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 12:29:24,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 12:29:24,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 12:29:24,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:29:24,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 12:29:24,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 12:29:24,292 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 12:29:24,292 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:29:24,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 12:29:24,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 12:29:24,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 12:29:24,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 12:29:24,522 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 12:29:24,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-18 12:29:24,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2c5d121/cb041349af364059afa3db161328222a/FLAGddaebda23 [2022-01-18 12:29:24,931 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 12:29:24,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-18 12:29:24,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2c5d121/cb041349af364059afa3db161328222a/FLAGddaebda23 [2022-01-18 12:29:24,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2c5d121/cb041349af364059afa3db161328222a [2022-01-18 12:29:24,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 12:29:24,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 12:29:24,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 12:29:24,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 12:29:24,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 12:29:24,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:29:24" (1/1) ... [2022-01-18 12:29:24,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:24, skipping insertion in model container [2022-01-18 12:29:24,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:29:24" (1/1) ... [2022-01-18 12:29:24,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 12:29:24,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 12:29:25,132 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-more-max-array.wvr.c[2553,2566] [2022-01-18 12:29:25,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:29:25,143 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 12:29:25,160 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-more-max-array.wvr.c[2553,2566] [2022-01-18 12:29:25,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:29:25,173 INFO L208 MainTranslator]: Completed translation [2022-01-18 12:29:25,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25 WrapperNode [2022-01-18 12:29:25,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 12:29:25,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 12:29:25,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 12:29:25,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 12:29:25,179 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:29:25" (1/1) ... [2022-01-18 12:29:25,185 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:29:25" (1/1) ... [2022-01-18 12:29:25,215 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-01-18 12:29:25,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 12:29:25,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 12:29:25,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 12:29:25,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 12:29:25,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 12:29:25,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 12:29:25,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 12:29:25,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 12:29:25,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (1/1) ... [2022-01-18 12:29:25,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:29:25,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:25,287 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:29:25,312 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:29:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 12:29:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 12:29:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 12:29:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 12:29:25,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 12:29:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 12:29:25,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 12:29:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 12:29:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 12:29:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 12:29:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 12:29:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 12:29:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 12:29:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 12:29:25,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 12:29:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 12:29:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 12:29:25,330 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:29:25,418 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 12:29:25,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 12:29:25,654 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 12:29:25,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 12:29:25,696 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 12:29:25,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:29:25 BoogieIcfgContainer [2022-01-18 12:29:25,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 12:29:25,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 12:29:25,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 12:29:25,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 12:29:25,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 12:29:24" (1/3) ... [2022-01-18 12:29:25,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134f2a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:29:25, skipping insertion in model container [2022-01-18 12:29:25,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:29:25" (2/3) ... [2022-01-18 12:29:25,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134f2a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:29:25, skipping insertion in model container [2022-01-18 12:29:25,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:29:25" (3/3) ... [2022-01-18 12:29:25,704 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-01-18 12:29:25,708 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 12:29:25,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 12:29:25,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 12:29:25,709 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 12:29:25,749 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,749 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,750 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,750 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,750 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,750 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,751 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,752 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,753 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,755 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,755 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,755 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,756 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,756 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,756 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,757 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,759 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,759 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,760 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,760 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,760 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,760 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,761 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,761 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,762 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,763 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,764 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,764 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,764 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,765 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,768 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,769 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,770 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,771 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:29:25,774 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 12:29:25,806 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 12:29:25,811 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:29:25,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 12:29:25,821 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 153 transitions, 330 flow [2022-01-18 12:29:26,026 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3808 states, 3807 states have (on average 3.8127134226425006) internal successors, (14515), 3807 states have internal predecessors, (14515), 0 states have call successors, (0), 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:29:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 3808 states, 3807 states have (on average 3.8127134226425006) internal successors, (14515), 3807 states have internal predecessors, (14515), 0 states have call successors, (0), 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:29:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 12:29:26,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:26,083 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] [2022-01-18 12:29:26,084 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1167185864, now seen corresponding path program 1 times [2022-01-18 12:29:26,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:26,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192431655] [2022-01-18 12:29:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:26,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:26,331 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:29:26,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192431655] [2022-01-18 12:29:26,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192431655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:29:26,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:29:26,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 12:29:26,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257155795] [2022-01-18 12:29:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:29:26,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 12:29:26,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 12:29:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 12:29:26,376 INFO L87 Difference]: Start difference. First operand has 3808 states, 3807 states have (on average 3.8127134226425006) internal successors, (14515), 3807 states have internal predecessors, (14515), 0 states have call successors, (0), 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 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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:29:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:26,468 INFO L93 Difference]: Finished difference Result 3808 states and 13367 transitions. [2022-01-18 12:29:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 12:29:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-01-18 12:29:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:26,516 INFO L225 Difference]: With dead ends: 3808 [2022-01-18 12:29:26,516 INFO L226 Difference]: Without dead ends: 3804 [2022-01-18 12:29:26,517 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:29:26,520 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:26,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 12:29:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2022-01-18 12:29:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3804. [2022-01-18 12:29:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3803 states have (on average 3.5138048908756243) internal successors, (13363), 3803 states have internal predecessors, (13363), 0 states have call successors, (0), 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:29:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 13363 transitions. [2022-01-18 12:29:26,753 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 13363 transitions. Word has length 105 [2022-01-18 12:29:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:26,754 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 13363 transitions. [2022-01-18 12:29:26,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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:29:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 13363 transitions. [2022-01-18 12:29:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 12:29:26,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:26,771 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] [2022-01-18 12:29:26,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 12:29:26,772 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 80050112, now seen corresponding path program 1 times [2022-01-18 12:29:26,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:26,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590429068] [2022-01-18 12:29:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:26,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:27,122 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:29:27,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:27,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590429068] [2022-01-18 12:29:27,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590429068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:29:27,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:29:27,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 12:29:27,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094238424] [2022-01-18 12:29:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:29:27,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 12:29:27,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 12:29:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-18 12:29:27,128 INFO L87 Difference]: Start difference. First operand 3804 states and 13363 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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:29:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:27,353 INFO L93 Difference]: Finished difference Result 3820 states and 13379 transitions. [2022-01-18 12:29:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 12:29:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-01-18 12:29:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:27,379 INFO L225 Difference]: With dead ends: 3820 [2022-01-18 12:29:27,379 INFO L226 Difference]: Without dead ends: 3810 [2022-01-18 12:29:27,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2022-01-18 12:29:27,384 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 227 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:27,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 320 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:29:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-01-18 12:29:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3805. [2022-01-18 12:29:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3805 states, 3804 states have (on average 3.5131440588853837) internal successors, (13364), 3804 states have internal predecessors, (13364), 0 states have call successors, (0), 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:29:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 13364 transitions. [2022-01-18 12:29:27,644 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 13364 transitions. Word has length 105 [2022-01-18 12:29:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:27,644 INFO L470 AbstractCegarLoop]: Abstraction has 3805 states and 13364 transitions. [2022-01-18 12:29:27,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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:29:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 13364 transitions. [2022-01-18 12:29:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-18 12:29:27,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:27,658 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] [2022-01-18 12:29:27,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 12:29:27,659 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash 956153110, now seen corresponding path program 1 times [2022-01-18 12:29:27,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:27,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727019785] [2022-01-18 12:29:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:27,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:29:27,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727019785] [2022-01-18 12:29:27,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727019785] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:27,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701490700] [2022-01-18 12:29:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:27,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:27,935 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:29:27,959 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:29:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:28,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:29:28,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:29:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:29:28,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:29:28,623 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:29:28,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701490700] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:28,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:29:28,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 12:29:28,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560332413] [2022-01-18 12:29:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:29:28,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:29:28,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:29:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:29:28,625 INFO L87 Difference]: Start difference. First operand 3805 states and 13364 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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:29:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:28,756 INFO L93 Difference]: Finished difference Result 4189 states and 14753 transitions. [2022-01-18 12:29:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:29:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-18 12:29:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:28,782 INFO L225 Difference]: With dead ends: 4189 [2022-01-18 12:29:28,783 INFO L226 Difference]: Without dead ends: 4189 [2022-01-18 12:29:28,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 216 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:29:28,786 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 236 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:28,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 342 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 12:29:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2022-01-18 12:29:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4189. [2022-01-18 12:29:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 3.522683858643744) internal successors, (14753), 4188 states have internal predecessors, (14753), 0 states have call successors, (0), 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:29:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 14753 transitions. [2022-01-18 12:29:28,898 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 14753 transitions. Word has length 112 [2022-01-18 12:29:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:28,900 INFO L470 AbstractCegarLoop]: Abstraction has 4189 states and 14753 transitions. [2022-01-18 12:29:28,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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:29:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 14753 transitions. [2022-01-18 12:29:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 12:29:28,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:28,912 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] [2022-01-18 12:29:28,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 12:29:29,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:29,127 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1389244231, now seen corresponding path program 1 times [2022-01-18 12:29:29,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:29,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245647931] [2022-01-18 12:29:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:29,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:29,248 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:29:29,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:29,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245647931] [2022-01-18 12:29:29,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245647931] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:29,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212348559] [2022-01-18 12:29:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:29,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:29,250 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:29:29,274 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:29:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:29,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 12:29:29,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:29:29,649 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:29:29,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:29:29,912 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:29:29,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212348559] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:29,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:29:29,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-18 12:29:29,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074137726] [2022-01-18 12:29:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:29:29,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 12:29:29,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 12:29:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-18 12:29:29,920 INFO L87 Difference]: Start difference. First operand 4189 states and 14753 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:30,188 INFO L93 Difference]: Finished difference Result 7486 states and 26533 transitions. [2022-01-18 12:29:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 12:29:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2022-01-18 12:29:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:30,240 INFO L225 Difference]: With dead ends: 7486 [2022-01-18 12:29:30,241 INFO L226 Difference]: Without dead ends: 7486 [2022-01-18 12:29:30,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-01-18 12:29:30,243 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 498 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:30,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 667 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:29:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7486 states. [2022-01-18 12:29:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7486 to 4736. [2022-01-18 12:29:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4736 states, 4735 states have (on average 3.4963041182682155) internal successors, (16555), 4735 states have internal predecessors, (16555), 0 states have call successors, (0), 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:29:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 16555 transitions. [2022-01-18 12:29:30,427 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 16555 transitions. Word has length 117 [2022-01-18 12:29:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:30,429 INFO L470 AbstractCegarLoop]: Abstraction has 4736 states and 16555 transitions. [2022-01-18 12:29:30,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 16555 transitions. [2022-01-18 12:29:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 12:29:30,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:30,444 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] [2022-01-18 12:29:30,470 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:29:30,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-18 12:29:30,659 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1124966041, now seen corresponding path program 2 times [2022-01-18 12:29:30,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:30,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259026597] [2022-01-18 12:29:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:30,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:30,789 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:29:30,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259026597] [2022-01-18 12:29:30,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259026597] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445944508] [2022-01-18 12:29:30,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:29:30,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:30,791 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:29:30,811 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:29:30,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 12:29:30,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:29:30,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-18 12:29:30,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:29:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:29:31,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 12:29:31,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445944508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:29:31,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 12:29:31,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-01-18 12:29:31,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304107444] [2022-01-18 12:29:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:29:31,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 12:29:31,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 12:29:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:29:31,198 INFO L87 Difference]: Start difference. First operand 4736 states and 16555 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:31,386 INFO L93 Difference]: Finished difference Result 5126 states and 17992 transitions. [2022-01-18 12:29:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 12:29:31,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2022-01-18 12:29:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:31,406 INFO L225 Difference]: With dead ends: 5126 [2022-01-18 12:29:31,406 INFO L226 Difference]: Without dead ends: 5126 [2022-01-18 12:29:31,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-18 12:29:31,407 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 179 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:31,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 395 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:29:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2022-01-18 12:29:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4579. [2022-01-18 12:29:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4579 states, 4578 states have (on average 3.5364788117081694) internal successors, (16190), 4578 states have internal predecessors, (16190), 0 states have call successors, (0), 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:29:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 16190 transitions. [2022-01-18 12:29:31,555 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 16190 transitions. Word has length 117 [2022-01-18 12:29:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:31,555 INFO L470 AbstractCegarLoop]: Abstraction has 4579 states and 16190 transitions. [2022-01-18 12:29:31,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 16190 transitions. [2022-01-18 12:29:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-18 12:29:31,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:31,567 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] [2022-01-18 12:29:31,595 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:29:31,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:31,788 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 209670700, now seen corresponding path program 1 times [2022-01-18 12:29:31,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362553742] [2022-01-18 12:29:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:31,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:29:33,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:33,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362553742] [2022-01-18 12:29:33,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362553742] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:33,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602804971] [2022-01-18 12:29:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:33,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:33,284 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:29:33,293 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:29:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:33,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-18 12:29:33,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:29:33,455 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:29:33,506 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 12:29:33,506 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 18 [2022-01-18 12:29:33,910 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:29:33,910 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 15 treesize of output 15 [2022-01-18 12:29:35,300 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 35 treesize of output 33 [2022-01-18 12:29:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:29:35,712 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 35 treesize of output 33 [2022-01-18 12:29:35,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:29:35,997 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 63 treesize of output 43 [2022-01-18 12:29:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:29:36,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:29:36,870 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (and (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0))))) (or (forall ((v_ArrVal_160 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (= c_~max1~0 c_~max2~0)))) is different from false [2022-01-18 12:29:37,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (and (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_160 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) is different from false [2022-01-18 12:29:37,721 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:29:37,722 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 419 treesize of output 371 [2022-01-18 12:29:37,731 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 332 treesize of output 284 [2022-01-18 12:29:37,738 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 284 treesize of output 260 [2022-01-18 12:29:37,745 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 260 treesize of output 248 [2022-01-18 12:29:37,753 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 248 treesize of output 242 [2022-01-18 12:29:40,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:29:40,970 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:29:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:29:40,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602804971] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:29:40,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:29:40,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 30] total 80 [2022-01-18 12:29:40,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023976759] [2022-01-18 12:29:40,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:29:40,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-01-18 12:29:40,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-01-18 12:29:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=5445, Unknown=12, NotChecked=306, Total=6320 [2022-01-18 12:29:40,996 INFO L87 Difference]: Start difference. First operand 4579 states and 16190 transitions. Second operand has 80 states, 80 states have (on average 3.8875) internal successors, (311), 80 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:29:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:50,448 INFO L93 Difference]: Finished difference Result 17157 states and 60126 transitions. [2022-01-18 12:29:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-18 12:29:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 3.8875) internal successors, (311), 80 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 122 [2022-01-18 12:29:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:50,513 INFO L225 Difference]: With dead ends: 17157 [2022-01-18 12:29:50,513 INFO L226 Difference]: Without dead ends: 16857 [2022-01-18 12:29:50,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 205 SyntacticMatches, 16 SemanticMatches, 151 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8889 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2489, Invalid=20157, Unknown=12, NotChecked=598, Total=23256 [2022-01-18 12:29:50,519 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 2843 mSDsluCounter, 9999 mSDsCounter, 0 mSdLazyCounter, 5204 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2843 SdHoareTripleChecker+Valid, 9088 SdHoareTripleChecker+Invalid, 7588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 5204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2256 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:50,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2843 Valid, 9088 Invalid, 7588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 5204 Invalid, 0 Unknown, 2256 Unchecked, 2.8s Time] [2022-01-18 12:29:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16857 states. [2022-01-18 12:29:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16857 to 7634. [2022-01-18 12:29:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7634 states, 7633 states have (on average 3.5599371151578674) internal successors, (27173), 7633 states have internal predecessors, (27173), 0 states have call successors, (0), 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:29:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7634 states to 7634 states and 27173 transitions. [2022-01-18 12:29:50,793 INFO L78 Accepts]: Start accepts. Automaton has 7634 states and 27173 transitions. Word has length 122 [2022-01-18 12:29:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:50,794 INFO L470 AbstractCegarLoop]: Abstraction has 7634 states and 27173 transitions. [2022-01-18 12:29:50,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 3.8875) internal successors, (311), 80 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:29:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7634 states and 27173 transitions. [2022-01-18 12:29:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-18 12:29:50,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:50,813 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] [2022-01-18 12:29:50,836 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:29:51,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:51,033 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:51,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2069424044, now seen corresponding path program 2 times [2022-01-18 12:29:51,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:51,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681869139] [2022-01-18 12:29:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:51,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:29:51,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681869139] [2022-01-18 12:29:51,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681869139] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839669306] [2022-01-18 12:29:51,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:29:51,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:51,972 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:29:51,995 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:29:52,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:29:52,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:29:52,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-18 12:29:52,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:29:52,117 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:29:52,167 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:29:52,167 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:29:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:29:52,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:29:52,531 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-18 12:29:52,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-01-18 12:29:53,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:29:53,238 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 35 treesize of output 33 [2022-01-18 12:29:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:29:53,534 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 35 treesize of output 33 [2022-01-18 12:29:53,794 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:29:53,795 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 63 treesize of output 43 [2022-01-18 12:29:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:29:54,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:29:54,576 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_196 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_196) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) (forall ((v_ArrVal_196 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_196) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0))))))) is different from false [2022-01-18 12:29:55,362 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:29:55,363 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 337 treesize of output 297 [2022-01-18 12:29:55,370 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 258 treesize of output 234 [2022-01-18 12:29:55,376 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 234 treesize of output 222 [2022-01-18 12:29:55,381 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 222 treesize of output 198 [2022-01-18 12:29:55,386 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 198 treesize of output 186 [2022-01-18 12:29:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:29:56,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839669306] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:29:56,841 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:29:56,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 24] total 63 [2022-01-18 12:29:56,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689051753] [2022-01-18 12:29:56,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:29:56,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-18 12:29:56,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:56,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-18 12:29:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3374, Unknown=22, NotChecked=120, Total=3906 [2022-01-18 12:29:56,843 INFO L87 Difference]: Start difference. First operand 7634 states and 27173 transitions. Second operand has 63 states, 63 states have (on average 5.0) internal successors, (315), 63 states have internal predecessors, (315), 0 states have call successors, (0), 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:30:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:09,542 INFO L93 Difference]: Finished difference Result 19549 states and 67407 transitions. [2022-01-18 12:30:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-01-18 12:30:09,543 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 5.0) internal successors, (315), 63 states have internal predecessors, (315), 0 states have call successors, (0), 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 122 [2022-01-18 12:30:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:09,600 INFO L225 Difference]: With dead ends: 19549 [2022-01-18 12:30:09,600 INFO L226 Difference]: Without dead ends: 19099 [2022-01-18 12:30:09,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 174 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13098 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2825, Invalid=27600, Unknown=29, NotChecked=346, Total=30800 [2022-01-18 12:30:09,607 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 2141 mSDsluCounter, 10081 mSDsCounter, 0 mSdLazyCounter, 6377 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 9243 SdHoareTripleChecker+Invalid, 8858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 6377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2404 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:09,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2141 Valid, 9243 Invalid, 8858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 6377 Invalid, 0 Unknown, 2404 Unchecked, 2.8s Time] [2022-01-18 12:30:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19099 states. [2022-01-18 12:30:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19099 to 7586. [2022-01-18 12:30:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7586 states, 7585 states have (on average 3.559789057350033) internal successors, (27001), 7585 states have internal predecessors, (27001), 0 states have call successors, (0), 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:30:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7586 states to 7586 states and 27001 transitions. [2022-01-18 12:30:09,889 INFO L78 Accepts]: Start accepts. Automaton has 7586 states and 27001 transitions. Word has length 122 [2022-01-18 12:30:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:09,889 INFO L470 AbstractCegarLoop]: Abstraction has 7586 states and 27001 transitions. [2022-01-18 12:30:09,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 5.0) internal successors, (315), 63 states have internal predecessors, (315), 0 states have call successors, (0), 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:30:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7586 states and 27001 transitions. [2022-01-18 12:30:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-18 12:30:09,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:09,908 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] [2022-01-18 12:30:09,933 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:30:10,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:10,123 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1805425292, now seen corresponding path program 3 times [2022-01-18 12:30:10,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219563964] [2022-01-18 12:30:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:10,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:11,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:11,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219563964] [2022-01-18 12:30:11,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219563964] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:11,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305158093] [2022-01-18 12:30:11,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:30:11,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:11,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:11,073 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:30:11,074 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:30:11,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:30:11,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:11,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-18 12:30:11,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:11,632 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:30:11,903 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:30:12,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:30:12,230 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 35 treesize of output 33 [2022-01-18 12:30:12,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:30:12,466 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 35 treesize of output 33 [2022-01-18 12:30:12,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:12,643 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 69 treesize of output 45 [2022-01-18 12:30:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:13,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:13,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (and (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) is different from false [2022-01-18 12:30:13,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (and (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (< 0 ~M~0))) is different from false [2022-01-18 12:30:15,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~max1~0 .cse1)) (.cse2 (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (and (or (not .cse0) (and (or (= .cse1 c_~max2~0) .cse2) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (not (< c_~max2~0 .cse3))))))) (or .cse0 (and (or (= c_~max1~0 c_~max2~0) .cse2) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse4 c_~max1~0) (not (< c_~max2~0 .cse4)))))))))))) is different from false [2022-01-18 12:30:16,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (and (or (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (= .cse0 c_~max2~0)) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset)) (not (< c_~max2~0 .cse1))))))) (not (< c_~max1~0 .cse0))))) (forall ((v_ArrVal_231 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset)) (and (or (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (= c_~max1~0 .cse3)))))))))) is different from false [2022-01-18 12:30:20,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (and (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse0)) (and (or (= .cse0 c_~max2~0) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231))) (let ((.cse2 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) .cse2) (not (< c_~max2~0 .cse2)))))))))) (forall ((v_ArrVal_231 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (= c_~max1~0 .cse3)))))))) (< 0 ~M~0))) is different from false [2022-01-18 12:30:21,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_231 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (and (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (and (or (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (= .cse1 c_~max2~0)) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231))) (let ((.cse2 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< c_~max2~0 .cse2))))))) (not (< c_~max1~0 .cse1)))))))) is different from false [2022-01-18 12:30:22,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_231 (Array Int Int))) (or (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)))))) (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse1)) (and (or (= .cse1 c_~max2~0) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (< c_~max2~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_231))) (let ((.cse2 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max2~0 .cse2)) (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2)))))))))))) is different from false [2022-01-18 12:30:24,651 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:24,651 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 292 treesize of output 185 [2022-01-18 12:30:24,676 INFO L353 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-01-18 12:30:24,677 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 2919 treesize of output 2707 [2022-01-18 12:30:24,735 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 2670 treesize of output 2622 [2022-01-18 12:30:24,748 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 2622 treesize of output 2598 [2022-01-18 12:30:24,772 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 12:30:24,772 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 2598 treesize of output 2577 [2022-01-18 12:30:24,818 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 12:30:24,819 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 2572 treesize of output 2457 [2022-01-18 12:30:24,943 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 2436 treesize of output 2388 [2022-01-18 12:30:24,962 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 2388 treesize of output 2364 [2022-01-18 12:30:24,981 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 2364 treesize of output 2292 [2022-01-18 12:30:25,006 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 2292 treesize of output 2196 [2022-01-18 12:30:25,029 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 2196 treesize of output 2004 [2022-01-18 12:30:25,050 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 2004 treesize of output 1860 [2022-01-18 12:30:25,069 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-18 12:30:25,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:25,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:25,293 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-18 12:30:25,296 INFO L158 Benchmark]: Toolchain (without parser) took 60343.34ms. Allocated memory was 369.1MB in the beginning and 1.2GB in the end (delta: 874.5MB). Free memory was 313.4MB in the beginning and 916.6MB in the end (delta: -603.2MB). Peak memory consumption was 805.5MB. Max. memory is 16.0GB. [2022-01-18 12:30:25,296 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory is still 330.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 12:30:25,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.89ms. Allocated memory was 369.1MB in the beginning and 474.0MB in the end (delta: 104.9MB). Free memory was 313.3MB in the beginning and 445.2MB in the end (delta: -131.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. [2022-01-18 12:30:25,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.37ms. Allocated memory is still 474.0MB. Free memory was 445.2MB in the beginning and 443.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 12:30:25,297 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 474.0MB. Free memory was 443.0MB in the beginning and 441.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 12:30:25,297 INFO L158 Benchmark]: RCFGBuilder took 449.33ms. Allocated memory is still 474.0MB. Free memory was 441.0MB in the beginning and 421.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-18 12:30:25,297 INFO L158 Benchmark]: TraceAbstraction took 59596.57ms. Allocated memory was 474.0MB in the beginning and 1.2GB in the end (delta: 769.7MB). Free memory was 420.0MB in the beginning and 916.6MB in the end (delta: -496.6MB). Peak memory consumption was 808.1MB. Max. memory is 16.0GB. [2022-01-18 12:30:25,299 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.12ms. Allocated memory is still 369.1MB. Free memory is still 330.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 216.89ms. Allocated memory was 369.1MB in the beginning and 474.0MB in the end (delta: 104.9MB). Free memory was 313.3MB in the beginning and 445.2MB in the end (delta: -131.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.37ms. Allocated memory is still 474.0MB. Free memory was 445.2MB in the beginning and 443.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 474.0MB. Free memory was 443.0MB in the beginning and 441.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 449.33ms. Allocated memory is still 474.0MB. Free memory was 441.0MB in the beginning and 421.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 59596.57ms. Allocated memory was 474.0MB in the beginning and 1.2GB in the end (delta: 769.7MB). Free memory was 420.0MB in the beginning and 916.6MB in the end (delta: -496.6MB). Peak memory consumption was 808.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-18 12:30:25,327 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 0 Received shutdown request...