/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 02:13:50,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 02:13:50,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 02:13:50,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 02:13:50,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 02:13:50,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 02:13:50,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 02:13:50,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 02:13:50,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 02:13:50,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 02:13:50,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 02:13:50,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 02:13:50,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 02:13:50,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 02:13:50,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 02:13:50,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 02:13:50,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 02:13:50,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 02:13:50,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 02:13:50,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 02:13:50,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 02:13:50,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 02:13:50,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 02:13:50,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 02:13:50,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 02:13:50,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 02:13:50,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 02:13:50,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 02:13:50,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 02:13:50,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 02:13:50,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 02:13:50,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 02:13:50,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 02:13:50,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 02:13:50,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 02:13:50,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 02:13:50,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 02:13:50,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 02:13:50,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 02:13:50,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 02:13:50,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 02:13:50,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-18 02:13:50,156 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 02:13:50,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 02:13:50,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 02:13:50,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 02:13:50,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 02:13:50,157 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 02:13:50,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 02:13:50,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 02:13:50,158 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 02:13:50,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 02:13:50,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 02:13:50,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 02:13:50,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 02:13:50,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 02:13:50,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 02:13:50,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 02:13:50,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 02:13:50,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 02:13:50,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 02:13:50,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 02:13:50,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 02:13:50,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 02:13:50,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 02:13:50,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 02:13:50,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 02:13:50,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:13:50,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 02:13:50,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 02:13:50,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 02:13:50,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 02:13:50,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 02:13:50,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 02:13:50,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 02:13:50,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 02:13:50,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 02:13:50,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 02:13:50,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 02:13:50,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 02:13:50,417 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 02:13:50,417 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 02:13:50,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d1e152d/139f0f7f1f0f4107a45d6456cd489de2/FLAG17d1f6901 [2022-01-18 02:13:50,827 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 02:13:50,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-18 02:13:50,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d1e152d/139f0f7f1f0f4107a45d6456cd489de2/FLAG17d1f6901 [2022-01-18 02:13:50,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d1e152d/139f0f7f1f0f4107a45d6456cd489de2 [2022-01-18 02:13:50,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 02:13:50,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 02:13:50,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 02:13:50,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 02:13:50,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 02:13:50,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:13:50" (1/1) ... [2022-01-18 02:13:50,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350c5eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:50, skipping insertion in model container [2022-01-18 02:13:50,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:13:50" (1/1) ... [2022-01-18 02:13:50,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 02:13:50,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 02:13:51,006 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 02:13:51,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:13:51,015 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 02:13:51,041 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 02:13:51,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:13:51,054 INFO L208 MainTranslator]: Completed translation [2022-01-18 02:13:51,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51 WrapperNode [2022-01-18 02:13:51,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 02:13:51,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 02:13:51,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 02:13:51,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 02:13:51,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,098 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-01-18 02:13:51,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 02:13:51,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 02:13:51,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 02:13:51,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 02:13:51,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 02:13:51,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 02:13:51,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 02:13:51,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 02:13:51,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (1/1) ... [2022-01-18 02:13:51,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:13:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:51,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 02:13:51,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 02:13:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 02:13:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 02:13:51,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 02:13:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 02:13:51,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 02:13:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 02:13:51,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 02:13:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 02:13:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 02:13:51,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 02:13:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 02:13:51,219 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 02:13:51,282 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 02:13:51,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 02:13:51,458 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 02:13:51,517 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 02:13:51,517 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 02:13:51,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:13:51 BoogieIcfgContainer [2022-01-18 02:13:51,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 02:13:51,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 02:13:51,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 02:13:51,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 02:13:51,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 02:13:50" (1/3) ... [2022-01-18 02:13:51,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e891bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:13:51, skipping insertion in model container [2022-01-18 02:13:51,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:13:51" (2/3) ... [2022-01-18 02:13:51,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e891bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:13:51, skipping insertion in model container [2022-01-18 02:13:51,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:13:51" (3/3) ... [2022-01-18 02:13:51,527 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-01-18 02:13:51,531 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 02:13:51,531 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 02:13:51,531 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 02:13:51,531 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 02:13:51,597 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,597 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,597 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,597 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,598 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,599 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,601 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,603 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,605 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,605 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,605 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,605 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,605 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,607 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,607 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,610 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,610 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,630 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,647 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,651 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,652 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,652 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,652 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,652 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,652 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:13:51,662 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 02:13:51,706 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 02:13:51,710 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 02:13:51,710 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 02:13:51,720 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 153 transitions, 330 flow [2022-01-18 02:13:51,890 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 02:13:51,902 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 02:13:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 02:13:51,938 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:51,939 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 02:13:51,939 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 02:13:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1167185864, now seen corresponding path program 1 times [2022-01-18 02:13:51,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:51,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567217327] [2022-01-18 02:13:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:51,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:13:52,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:52,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567217327] [2022-01-18 02:13:52,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567217327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:52,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:52,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 02:13:52,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961205958] [2022-01-18 02:13:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:52,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 02:13:52,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 02:13:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:13:52,225 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 02:13:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:52,307 INFO L93 Difference]: Finished difference Result 3808 states and 13367 transitions. [2022-01-18 02:13:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 02:13:52,309 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 02:13:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:52,350 INFO L225 Difference]: With dead ends: 3808 [2022-01-18 02:13:52,350 INFO L226 Difference]: Without dead ends: 3804 [2022-01-18 02:13:52,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:13:52,354 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 02:13:52,354 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 02:13:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2022-01-18 02:13:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3804. [2022-01-18 02:13:52,515 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 02:13:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 13363 transitions. [2022-01-18 02:13:52,532 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 13363 transitions. Word has length 105 [2022-01-18 02:13:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:52,533 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 13363 transitions. [2022-01-18 02:13:52,533 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 02:13:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 13363 transitions. [2022-01-18 02:13:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 02:13:52,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:52,545 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 02:13:52,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 02:13:52,545 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 02:13:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash 80050112, now seen corresponding path program 1 times [2022-01-18 02:13:52,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:52,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635391738] [2022-01-18 02:13:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:52,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:13:52,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635391738] [2022-01-18 02:13:52,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635391738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:52,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:13:52,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 02:13:52,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789787075] [2022-01-18 02:13:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:52,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 02:13:52,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 02:13:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-18 02:13:52,795 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 02:13:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:53,057 INFO L93 Difference]: Finished difference Result 3820 states and 13379 transitions. [2022-01-18 02:13:53,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:13:53,058 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 02:13:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:53,075 INFO L225 Difference]: With dead ends: 3820 [2022-01-18 02:13:53,075 INFO L226 Difference]: Without dead ends: 3810 [2022-01-18 02:13:53,078 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 02:13:53,079 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 02:13:53,080 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 02:13:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-01-18 02:13:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3805. [2022-01-18 02:13:53,217 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 02:13:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 13364 transitions. [2022-01-18 02:13:53,236 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 13364 transitions. Word has length 105 [2022-01-18 02:13:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:53,238 INFO L470 AbstractCegarLoop]: Abstraction has 3805 states and 13364 transitions. [2022-01-18 02:13:53,239 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 02:13:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 13364 transitions. [2022-01-18 02:13:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-18 02:13:53,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:53,250 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 02:13:53,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 02:13:53,250 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 02:13:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 956153110, now seen corresponding path program 1 times [2022-01-18 02:13:53,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:53,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568730948] [2022-01-18 02:13:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:53,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:53,440 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 02:13:53,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568730948] [2022-01-18 02:13:53,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568730948] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083779695] [2022-01-18 02:13:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:53,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:53,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:13:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 02:13:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:53,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:13:53,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:53,814 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 02:13:53,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:13:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:13:54,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083779695] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:54,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:13:54,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 02:13:54,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93433909] [2022-01-18 02:13:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:54,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:13:54,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:54,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:13:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:13:54,049 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 02:13:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:54,146 INFO L93 Difference]: Finished difference Result 4189 states and 14753 transitions. [2022-01-18 02:13:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:13:54,146 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 02:13:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:54,170 INFO L225 Difference]: With dead ends: 4189 [2022-01-18 02:13:54,170 INFO L226 Difference]: Without dead ends: 4189 [2022-01-18 02:13:54,170 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 02:13:54,171 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 02:13:54,171 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 02:13:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2022-01-18 02:13:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4189. [2022-01-18 02:13:54,273 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 02:13:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 14753 transitions. [2022-01-18 02:13:54,285 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 14753 transitions. Word has length 112 [2022-01-18 02:13:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:54,285 INFO L470 AbstractCegarLoop]: Abstraction has 4189 states and 14753 transitions. [2022-01-18 02:13:54,286 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 02:13:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 14753 transitions. [2022-01-18 02:13:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 02:13:54,295 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:54,295 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 02:13:54,313 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 02:13:54,511 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 02:13:54,511 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 02:13:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1389244231, now seen corresponding path program 1 times [2022-01-18 02:13:54,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485338698] [2022-01-18 02:13:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:54,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:54,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485338698] [2022-01-18 02:13:54,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485338698] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984219803] [2022-01-18 02:13:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:54,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:54,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:54,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:13:54,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 02:13:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:54,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:13:54,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:54,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:13:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:55,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984219803] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:55,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:13:55,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-18 02:13:55,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711079319] [2022-01-18 02:13:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:55,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 02:13:55,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 02:13:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-18 02:13:55,218 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 02:13:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:55,445 INFO L93 Difference]: Finished difference Result 7486 states and 26533 transitions. [2022-01-18 02:13:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 02:13:55,446 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 02:13:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:55,475 INFO L225 Difference]: With dead ends: 7486 [2022-01-18 02:13:55,476 INFO L226 Difference]: Without dead ends: 7486 [2022-01-18 02:13:55,476 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 02:13:55,477 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 02:13:55,477 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 02:13:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7486 states. [2022-01-18 02:13:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7486 to 4736. [2022-01-18 02:13:55,658 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 02:13:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 16555 transitions. [2022-01-18 02:13:55,671 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 16555 transitions. Word has length 117 [2022-01-18 02:13:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:55,672 INFO L470 AbstractCegarLoop]: Abstraction has 4736 states and 16555 transitions. [2022-01-18 02:13:55,672 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 02:13:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 16555 transitions. [2022-01-18 02:13:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-18 02:13:55,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:55,684 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 02:13:55,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-18 02:13:55,901 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 02:13:55,901 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 02:13:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1124966041, now seen corresponding path program 2 times [2022-01-18 02:13:55,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:55,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516662391] [2022-01-18 02:13:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:55,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:13:55,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516662391] [2022-01-18 02:13:55,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516662391] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674025873] [2022-01-18 02:13:55,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:13:55,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:55,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:13:56,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 02:13:56,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-18 02:13:56,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:13:56,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-18 02:13:56,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:56,381 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 02:13:56,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-18 02:13:56,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674025873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:13:56,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-18 02:13:56,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-01-18 02:13:56,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949261364] [2022-01-18 02:13:56,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:13:56,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:13:56,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:13:56,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:13:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:13:56,383 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 02:13:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:13:56,551 INFO L93 Difference]: Finished difference Result 5126 states and 17992 transitions. [2022-01-18 02:13:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:13:56,551 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 02:13:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:13:56,565 INFO L225 Difference]: With dead ends: 5126 [2022-01-18 02:13:56,565 INFO L226 Difference]: Without dead ends: 5126 [2022-01-18 02:13:56,566 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 02:13:56,566 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 179 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 02:13:56,567 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 02:13:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2022-01-18 02:13:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4579. [2022-01-18 02:13:56,708 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 02:13:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 16190 transitions. [2022-01-18 02:13:56,721 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 16190 transitions. Word has length 117 [2022-01-18 02:13:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:13:56,721 INFO L470 AbstractCegarLoop]: Abstraction has 4579 states and 16190 transitions. [2022-01-18 02:13:56,721 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 02:13:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 16190 transitions. [2022-01-18 02:13:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-18 02:13:56,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:13:56,731 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 02:13:56,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 02:13:56,946 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 02:13:56,947 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 02:13:56,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:13:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 209670700, now seen corresponding path program 1 times [2022-01-18 02:13:56,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:13:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693215626] [2022-01-18 02:13:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:56,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:13:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:58,267 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 02:13:58,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:13:58,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693215626] [2022-01-18 02:13:58,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693215626] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:13:58,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405952905] [2022-01-18 02:13:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:13:58,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:13:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:13:58,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:13:58,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 02:13:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:13:58,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-18 02:13:58,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:13:58,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:13:58,472 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:13:58,473 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 02:13:59,269 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:13:59,269 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 02:14:01,123 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 02:14:01,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:01,547 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 02:14:01,820 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:01,820 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 02:14:02,345 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 02:14:02,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:02,583 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 02:14:02,731 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 02:14:03,387 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:03,387 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 02:14:03,399 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 02:14:03,406 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 02:14:03,415 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 02:14:03,426 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 02:14:06,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:14:06,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-18 02:14:06,467 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 02:14:06,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405952905] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:06,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:06,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 30] total 80 [2022-01-18 02:14:06,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848104092] [2022-01-18 02:14:06,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:06,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-01-18 02:14:06,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:06,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-01-18 02:14:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=5445, Unknown=12, NotChecked=306, Total=6320 [2022-01-18 02:14:06,470 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 02:14:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:15,093 INFO L93 Difference]: Finished difference Result 17157 states and 60126 transitions. [2022-01-18 02:14:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-18 02:14:15,093 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 02:14:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:15,144 INFO L225 Difference]: With dead ends: 17157 [2022-01-18 02:14:15,144 INFO L226 Difference]: Without dead ends: 16857 [2022-01-18 02:14:15,148 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 02:14:15,150 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 2843 mSDsluCounter, 9999 mSDsCounter, 0 mSdLazyCounter, 5204 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:14:15,150 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.4s Time] [2022-01-18 02:14:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16857 states. [2022-01-18 02:14:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16857 to 7634. [2022-01-18 02:14:15,380 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 02:14:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7634 states to 7634 states and 27173 transitions. [2022-01-18 02:14:15,401 INFO L78 Accepts]: Start accepts. Automaton has 7634 states and 27173 transitions. Word has length 122 [2022-01-18 02:14:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:15,402 INFO L470 AbstractCegarLoop]: Abstraction has 7634 states and 27173 transitions. [2022-01-18 02:14:15,402 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 02:14:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7634 states and 27173 transitions. [2022-01-18 02:14:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-18 02:14:15,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:15,417 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 02:14:15,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-18 02:14:15,631 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 02:14:15,632 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 02:14:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2069424044, now seen corresponding path program 2 times [2022-01-18 02:14:15,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:15,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464486652] [2022-01-18 02:14:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:15,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:16,625 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 02:14:16,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:16,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464486652] [2022-01-18 02:14:16,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464486652] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:16,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812757155] [2022-01-18 02:14:16,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:14:16,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:16,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:16,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 02:14:16,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:14:16,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:16,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-18 02:14:16,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:16,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:16,880 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 02:14:16,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 02:14:17,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:17,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:17,250 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-18 02:14:17,250 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 02:14:18,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:18,035 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 02:14:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:18,385 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 02:14:18,707 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:18,707 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 02:14:19,232 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 02:14:19,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:19,530 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 02:14:20,202 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:20,202 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 02:14:20,207 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 02:14:20,219 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 02:14:20,223 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 02:14:20,227 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 02:14:21,691 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 02:14:21,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812757155] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:14:21,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:14:21,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 24] total 63 [2022-01-18 02:14:21,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426815300] [2022-01-18 02:14:21,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:14:21,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-18 02:14:21,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:14:21,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-18 02:14:21,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3374, Unknown=22, NotChecked=120, Total=3906 [2022-01-18 02:14:21,694 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 02:14:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:14:34,450 INFO L93 Difference]: Finished difference Result 19549 states and 67407 transitions. [2022-01-18 02:14:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-01-18 02:14:34,450 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 02:14:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:14:34,535 INFO L225 Difference]: With dead ends: 19549 [2022-01-18 02:14:34,535 INFO L226 Difference]: Without dead ends: 19099 [2022-01-18 02:14:34,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 174 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13098 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2825, Invalid=27600, Unknown=29, NotChecked=346, Total=30800 [2022-01-18 02:14:34,543 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 02:14:34,543 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 02:14:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19099 states. [2022-01-18 02:14:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19099 to 7586. [2022-01-18 02:14:34,786 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 02:14:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7586 states to 7586 states and 27001 transitions. [2022-01-18 02:14:34,811 INFO L78 Accepts]: Start accepts. Automaton has 7586 states and 27001 transitions. Word has length 122 [2022-01-18 02:14:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:14:34,812 INFO L470 AbstractCegarLoop]: Abstraction has 7586 states and 27001 transitions. [2022-01-18 02:14:34,812 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 02:14:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7586 states and 27001 transitions. [2022-01-18 02:14:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-18 02:14:34,831 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:14:34,831 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 02:14:34,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:35,055 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 02:14:35,055 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 02:14:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:14:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1805425292, now seen corresponding path program 3 times [2022-01-18 02:14:35,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:14:35,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506142786] [2022-01-18 02:14:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:14:35,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:14:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:14:35,916 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 02:14:35,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:14:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506142786] [2022-01-18 02:14:35,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506142786] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:14:35,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130439747] [2022-01-18 02:14:35,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:14:35,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:14:35,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:14:35,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:14:35,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 02:14:35,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:14:35,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:14:35,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-18 02:14:35,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:14:36,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 02:14:36,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 02:14:37,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:37,155 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 02:14:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:14:37,370 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 02:14:37,597 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:37,597 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 02:14:38,293 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 02:14:38,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:14:38,742 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 02:14:38,905 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 02:14:40,165 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 02:14:40,711 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 02:14:47,423 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 02:14:49,097 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 02:14:50,036 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 02:14:52,943 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:14:52,943 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 02:14:52,967 INFO L353 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-01-18 02:14:52,975 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 02:14:53,030 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 02:14:53,044 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 02:14:53,065 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 02:14:53,065 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 02:14:53,096 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 02:14:53,097 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 02:14:53,150 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 02:14:53,164 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 02:14:53,178 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 02:14:53,192 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 02:14:53,208 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 02:14:53,225 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 02:14:53,238 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-18 02:14:53,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 02:14:53,457 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 02:14:53,458 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 02:14:53,462 INFO L158 Benchmark]: Toolchain (without parser) took 62619.21ms. Allocated memory was 392.2MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 337.6MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 701.2MB. Max. memory is 16.0GB. [2022-01-18 02:14:53,462 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 392.2MB. Free memory is still 353.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:14:53,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.26ms. Allocated memory is still 392.2MB. Free memory was 337.3MB in the beginning and 361.3MB in the end (delta: -24.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.0GB. [2022-01-18 02:14:53,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.99ms. Allocated memory is still 392.2MB. Free memory was 361.3MB in the beginning and 359.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 02:14:53,463 INFO L158 Benchmark]: Boogie Preprocessor took 40.82ms. Allocated memory is still 392.2MB. Free memory was 359.2MB in the beginning and 358.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 02:14:53,463 INFO L158 Benchmark]: RCFGBuilder took 378.96ms. Allocated memory is still 392.2MB. Free memory was 358.2MB in the beginning and 339.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-18 02:14:53,463 INFO L158 Benchmark]: TraceAbstraction took 61941.34ms. Allocated memory was 392.2MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 339.3MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 704.6MB. Max. memory is 16.0GB. [2022-01-18 02:14:53,464 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.09ms. Allocated memory is still 392.2MB. Free memory is still 353.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 211.26ms. Allocated memory is still 392.2MB. Free memory was 337.3MB in the beginning and 361.3MB in the end (delta: -24.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.99ms. Allocated memory is still 392.2MB. Free memory was 361.3MB in the beginning and 359.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.82ms. Allocated memory is still 392.2MB. Free memory was 359.2MB in the beginning and 358.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 378.96ms. Allocated memory is still 392.2MB. Free memory was 358.2MB in the beginning and 339.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 61941.34ms. Allocated memory was 392.2MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 339.3MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 704.6MB. 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 02:14:53,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...